./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.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.1.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 160554c42c564a52ebd5fe8cd6d07ff66d908df6432eaaa8c30073c4760a7967 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:23:36,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:23:36,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:23:36,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:23:36,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:23:36,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:23:36,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:23:36,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:23:36,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:23:36,719 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:23:36,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:23:36,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:23:36,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:23:36,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:23:36,720 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:23:36,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:23:36,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:23:36,720 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:23:36,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:23:36,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:23:36,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:23:36,720 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:23:36,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:23:36,721 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:23:36,721 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:23:36,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:23:36,721 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:23:36,721 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:23:36,721 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:23:36,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:23:36,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:23:36,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:23:36,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:23:36,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:23:36,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:23:36,722 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:23:36,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:23:36,722 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:23:36,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:23:36,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:23:36,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:23:36,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:23:36,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:23:36,723 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 -> 160554c42c564a52ebd5fe8cd6d07ff66d908df6432eaaa8c30073c4760a7967 [2025-03-08 06:23:36,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:23:36,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:23:36,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:23:36,948 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:23:36,948 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:23:36,949 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.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-08 06:23:38,125 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/defc0391b/b7ba38e8944f4554aa19ad75aa6225a1/FLAGe33e46288 [2025-03-08 06:23:38,363 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:23:38,364 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-08 06:23:38,373 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/defc0391b/b7ba38e8944f4554aa19ad75aa6225a1/FLAGe33e46288 [2025-03-08 06:23:38,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/defc0391b/b7ba38e8944f4554aa19ad75aa6225a1 [2025-03-08 06:23:38,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:23:38,699 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:23:38,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:23:38,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:23:38,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:23:38,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:23:38" (1/1) ... [2025-03-08 06:23:38,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207b3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:38, skipping insertion in model container [2025-03-08 06:23:38,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:23:38" (1/1) ... [2025-03-08 06:23:38,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:23:38,842 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.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[4902,4915] [2025-03-08 06:23:38,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:23:38,870 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:23:38,903 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.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[4902,4915] [2025-03-08 06:23:38,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:23:38,934 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:23:38,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:38 WrapperNode [2025-03-08 06:23:38,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:23:38,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:23:38,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:23:38,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:23:38,941 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:23:38" (1/1) ... [2025-03-08 06:23:38,954 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:23:38" (1/1) ... [2025-03-08 06:23:38,976 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 375 [2025-03-08 06:23:38,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:23:38,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:23:38,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:23:38,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:23:38,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:38" (1/1) ... [2025-03-08 06:23:38,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:38" (1/1) ... [2025-03-08 06:23:38,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:38" (1/1) ... [2025-03-08 06:23:39,014 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:23:39,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:38" (1/1) ... [2025-03-08 06:23:39,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:38" (1/1) ... [2025-03-08 06:23:39,021 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:38" (1/1) ... [2025-03-08 06:23:39,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:38" (1/1) ... [2025-03-08 06:23:39,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:38" (1/1) ... [2025-03-08 06:23:39,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:38" (1/1) ... [2025-03-08 06:23:39,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:23:39,031 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:23:39,031 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:23:39,031 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:23:39,032 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:38" (1/1) ... [2025-03-08 06:23:39,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:23:39,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:23:39,059 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:23:39,061 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:23:39,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:23:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:23:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:23:39,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:23:39,156 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:23:39,157 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:23:39,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L184: havoc main_~node3__m3~0#1; [2025-03-08 06:23:39,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-08 06:23:39,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: havoc main_~node2__m2~0#1; [2025-03-08 06:23:39,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L153: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:23:39,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L353: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-08 06:23:39,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L444: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-08 06:23:39,428 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:23:39,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L199: havoc main_~node4__m4~0#1; [2025-03-08 06:23:39,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L398: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-08 06:23:39,443 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-08 06:23:39,443 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:23:39,451 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:23:39,452 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:23:39,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:23:39 BoogieIcfgContainer [2025-03-08 06:23:39,453 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:23:39,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:23:39,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:23:39,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:23:39,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:23:38" (1/3) ... [2025-03-08 06:23:39,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48fce350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:23:39, skipping insertion in model container [2025-03-08 06:23:39,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:38" (2/3) ... [2025-03-08 06:23:39,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48fce350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:23:39, skipping insertion in model container [2025-03-08 06:23:39,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:23:39" (3/3) ... [2025-03-08 06:23:39,462 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-08 06:23:39,471 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:23:39,472 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.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:23:39,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:23:39,519 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;@57118053, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:23:39,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:23:39,522 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:23:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 06:23:39,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:39,527 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:23:39,527 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:39,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:39,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1983963079, now seen corresponding path program 1 times [2025-03-08 06:23:39,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:39,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249037214] [2025-03-08 06:23:39,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:39,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:39,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 06:23:39,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 06:23:39,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:39,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:39,818 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:23:39,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:39,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249037214] [2025-03-08 06:23:39,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249037214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:39,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:39,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:23:39,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972811850] [2025-03-08 06:23:39,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:39,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:23:39,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:39,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:23:39,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:39,840 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:23:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:39,883 INFO L93 Difference]: Finished difference Result 177 states and 286 transitions. [2025-03-08 06:23:39,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:23:39,885 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:23:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:39,890 INFO L225 Difference]: With dead ends: 177 [2025-03-08 06:23:39,890 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 06:23:39,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:39,895 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:23:39,896 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:23:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 06:23:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2025-03-08 06:23:39,915 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:23:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 169 transitions. [2025-03-08 06:23:39,919 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 169 transitions. Word has length 47 [2025-03-08 06:23:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:39,919 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 169 transitions. [2025-03-08 06:23:39,920 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:23:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 169 transitions. [2025-03-08 06:23:39,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 06:23:39,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:39,920 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:23:39,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:23:39,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:39,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:39,921 INFO L85 PathProgramCache]: Analyzing trace with hash 996552528, now seen corresponding path program 1 times [2025-03-08 06:23:39,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:39,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716639659] [2025-03-08 06:23:39,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:39,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:39,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 06:23:39,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 06:23:39,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:39,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:40,032 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:23:40,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:40,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716639659] [2025-03-08 06:23:40,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716639659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:40,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:40,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:23:40,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834812491] [2025-03-08 06:23:40,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:40,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:23:40,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:40,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:23:40,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:40,036 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:23:40,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:40,061 INFO L93 Difference]: Finished difference Result 280 states and 429 transitions. [2025-03-08 06:23:40,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:23:40,064 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:23:40,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:40,065 INFO L225 Difference]: With dead ends: 280 [2025-03-08 06:23:40,065 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 06:23:40,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:40,066 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:23:40,066 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:23:40,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 06:23:40,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2025-03-08 06:23:40,074 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:23:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 283 transitions. [2025-03-08 06:23:40,075 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 283 transitions. Word has length 48 [2025-03-08 06:23:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:40,075 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 283 transitions. [2025-03-08 06:23:40,075 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:23:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 283 transitions. [2025-03-08 06:23:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 06:23:40,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:40,076 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:23:40,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:23:40,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:40,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:40,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1539141012, now seen corresponding path program 1 times [2025-03-08 06:23:40,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:40,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535826581] [2025-03-08 06:23:40,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:40,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:40,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 06:23:40,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 06:23:40,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:40,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:40,172 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:23:40,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:40,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535826581] [2025-03-08 06:23:40,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535826581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:40,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:40,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:23:40,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070714640] [2025-03-08 06:23:40,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:40,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:23:40,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:40,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:23:40,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:40,173 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:23:40,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:40,203 INFO L93 Difference]: Finished difference Result 480 states and 745 transitions. [2025-03-08 06:23:40,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:23:40,203 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:23:40,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:40,206 INFO L225 Difference]: With dead ends: 480 [2025-03-08 06:23:40,206 INFO L226 Difference]: Without dead ends: 318 [2025-03-08 06:23:40,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:40,207 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:23:40,207 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:23:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-08 06:23:40,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2025-03-08 06:23:40,224 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:23:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 483 transitions. [2025-03-08 06:23:40,226 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 483 transitions. Word has length 49 [2025-03-08 06:23:40,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:40,227 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 483 transitions. [2025-03-08 06:23:40,227 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:23:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 483 transitions. [2025-03-08 06:23:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 06:23:40,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:40,228 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:23:40,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:23:40,228 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:40,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:40,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1645998845, now seen corresponding path program 1 times [2025-03-08 06:23:40,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:40,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216791434] [2025-03-08 06:23:40,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:40,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:40,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 06:23:40,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 06:23:40,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:40,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:40,310 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:23:40,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:40,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216791434] [2025-03-08 06:23:40,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216791434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:40,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:40,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:23:40,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339363847] [2025-03-08 06:23:40,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:40,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:23:40,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:40,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:23:40,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:40,312 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:23:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:40,332 INFO L93 Difference]: Finished difference Result 832 states and 1293 transitions. [2025-03-08 06:23:40,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:23:40,332 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:23:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:40,334 INFO L225 Difference]: With dead ends: 832 [2025-03-08 06:23:40,334 INFO L226 Difference]: Without dead ends: 542 [2025-03-08 06:23:40,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:40,335 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:23:40,338 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:23:40,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-08 06:23:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 540. [2025-03-08 06:23:40,356 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:23:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 827 transitions. [2025-03-08 06:23:40,358 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 827 transitions. Word has length 50 [2025-03-08 06:23:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:40,358 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 827 transitions. [2025-03-08 06:23:40,358 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:23:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 827 transitions. [2025-03-08 06:23:40,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 06:23:40,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:40,359 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:23:40,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:23:40,360 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:40,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:40,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1271575649, now seen corresponding path program 1 times [2025-03-08 06:23:40,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:40,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694516115] [2025-03-08 06:23:40,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:40,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:40,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 06:23:40,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 06:23:40,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:40,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:40,478 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:23:40,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:40,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694516115] [2025-03-08 06:23:40,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694516115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:40,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:40,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:23:40,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268808469] [2025-03-08 06:23:40,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:40,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:23:40,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:40,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:23:40,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:23:40,479 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:23:40,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:40,646 INFO L93 Difference]: Finished difference Result 4652 states and 7235 transitions. [2025-03-08 06:23:40,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:23:40,647 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:23:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:40,661 INFO L225 Difference]: With dead ends: 4652 [2025-03-08 06:23:40,661 INFO L226 Difference]: Without dead ends: 4138 [2025-03-08 06:23:40,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:23:40,666 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:23:40,666 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:23:40,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2025-03-08 06:23:40,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 1052. [2025-03-08 06:23:40,720 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:23:40,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1595 transitions. [2025-03-08 06:23:40,723 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1595 transitions. Word has length 51 [2025-03-08 06:23:40,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:40,724 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1595 transitions. [2025-03-08 06:23:40,724 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:23:40,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1595 transitions. [2025-03-08 06:23:40,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 06:23:40,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:40,725 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:23:40,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:23:40,725 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:40,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:40,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2042597206, now seen corresponding path program 1 times [2025-03-08 06:23:40,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:40,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016702138] [2025-03-08 06:23:40,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:40,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:40,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 06:23:40,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 06:23:40,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:40,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:40,792 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:23:40,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:40,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016702138] [2025-03-08 06:23:40,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016702138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:40,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:40,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:23:40,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098134860] [2025-03-08 06:23:40,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:40,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:23:40,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:40,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:23:40,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:40,793 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:23:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:40,815 INFO L93 Difference]: Finished difference Result 2570 states and 3911 transitions. [2025-03-08 06:23:40,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:23:40,816 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:23:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:40,820 INFO L225 Difference]: With dead ends: 2570 [2025-03-08 06:23:40,820 INFO L226 Difference]: Without dead ends: 1544 [2025-03-08 06:23:40,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:40,822 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:23:40,822 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:23:40,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2025-03-08 06:23:40,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1542. [2025-03-08 06:23:40,846 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:23:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2317 transitions. [2025-03-08 06:23:40,851 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2317 transitions. Word has length 53 [2025-03-08 06:23:40,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:40,851 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2317 transitions. [2025-03-08 06:23:40,851 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:23:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2317 transitions. [2025-03-08 06:23:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 06:23:40,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:40,852 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:23:40,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:23:40,852 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:40,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:40,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2041435357, now seen corresponding path program 1 times [2025-03-08 06:23:40,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:40,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56326566] [2025-03-08 06:23:40,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:40,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:40,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 06:23:40,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 06:23:40,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:40,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:41,076 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:23:41,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:41,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56326566] [2025-03-08 06:23:41,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56326566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:41,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:41,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:23:41,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807396515] [2025-03-08 06:23:41,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:41,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:23:41,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:41,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:23:41,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:23:41,078 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:23:41,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:41,183 INFO L93 Difference]: Finished difference Result 3058 states and 4607 transitions. [2025-03-08 06:23:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:23:41,184 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:23:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:41,189 INFO L225 Difference]: With dead ends: 3058 [2025-03-08 06:23:41,189 INFO L226 Difference]: Without dead ends: 1544 [2025-03-08 06:23:41,192 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:23:41,193 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:23:41,193 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:23:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2025-03-08 06:23:41,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1542. [2025-03-08 06:23:41,214 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:23:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2293 transitions. [2025-03-08 06:23:41,218 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2293 transitions. Word has length 53 [2025-03-08 06:23:41,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:41,218 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2293 transitions. [2025-03-08 06:23:41,219 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:23:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2293 transitions. [2025-03-08 06:23:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 06:23:41,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:41,221 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:23:41,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:23:41,222 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:41,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:41,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1140968741, now seen corresponding path program 1 times [2025-03-08 06:23:41,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:41,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498502872] [2025-03-08 06:23:41,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:41,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:41,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 06:23:41,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 06:23:41,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:41,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:41,448 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:23:41,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:41,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498502872] [2025-03-08 06:23:41,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498502872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:41,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:41,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:23:41,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493779706] [2025-03-08 06:23:41,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:41,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:23:41,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:41,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:23:41,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:23:41,449 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:23:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:41,477 INFO L93 Difference]: Finished difference Result 1608 states and 2390 transitions. [2025-03-08 06:23:41,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:23:41,478 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:23:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:41,482 INFO L225 Difference]: With dead ends: 1608 [2025-03-08 06:23:41,482 INFO L226 Difference]: Without dead ends: 1606 [2025-03-08 06:23:41,483 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:23:41,484 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:23:41,484 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:23:41,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-03-08 06:23:41,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2025-03-08 06:23:41,513 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:23:41,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2349 transitions. [2025-03-08 06:23:41,518 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2349 transitions. Word has length 54 [2025-03-08 06:23:41,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:41,518 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 2349 transitions. [2025-03-08 06:23:41,518 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:23:41,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2349 transitions. [2025-03-08 06:23:41,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 06:23:41,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:41,520 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:23:41,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:23:41,520 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:41,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:41,521 INFO L85 PathProgramCache]: Analyzing trace with hash -805800741, now seen corresponding path program 1 times [2025-03-08 06:23:41,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:41,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017334680] [2025-03-08 06:23:41,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:41,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:41,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:23:41,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:23:41,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:41,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:41,655 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:23:41,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:41,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017334680] [2025-03-08 06:23:41,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017334680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:41,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:41,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:23:41,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838291599] [2025-03-08 06:23:41,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:41,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:23:41,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:41,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:23:41,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:23:41,657 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:23:41,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:41,781 INFO L93 Difference]: Finished difference Result 8224 states and 12058 transitions. [2025-03-08 06:23:41,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:23:41,782 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:23:41,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:41,800 INFO L225 Difference]: With dead ends: 8224 [2025-03-08 06:23:41,800 INFO L226 Difference]: Without dead ends: 6646 [2025-03-08 06:23:41,804 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:23:41,805 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 438 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:23:41,806 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:23:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6646 states. [2025-03-08 06:23:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6646 to 3182. [2025-03-08 06:23:41,885 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:23:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4645 transitions. [2025-03-08 06:23:41,895 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4645 transitions. Word has length 76 [2025-03-08 06:23:41,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:41,896 INFO L471 AbstractCegarLoop]: Abstraction has 3182 states and 4645 transitions. [2025-03-08 06:23:41,896 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:23:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4645 transitions. [2025-03-08 06:23:41,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 06:23:41,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:41,898 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:23:41,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:23:41,898 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:41,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:41,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1345919099, now seen corresponding path program 1 times [2025-03-08 06:23:41,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:41,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161165635] [2025-03-08 06:23:41,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:41,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:41,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:23:41,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:23:41,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:41,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:42,051 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:23:42,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:42,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161165635] [2025-03-08 06:23:42,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161165635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:42,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:42,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:23:42,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102722684] [2025-03-08 06:23:42,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:42,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:23:42,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:42,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:23:42,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:23:42,054 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:23:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:42,142 INFO L93 Difference]: Finished difference Result 9800 states and 14354 transitions. [2025-03-08 06:23:42,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:23:42,143 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:23:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:42,168 INFO L225 Difference]: With dead ends: 9800 [2025-03-08 06:23:42,169 INFO L226 Difference]: Without dead ends: 8222 [2025-03-08 06:23:42,173 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:23:42,174 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:42,174 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.0s Time] [2025-03-08 06:23:42,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8222 states. [2025-03-08 06:23:42,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8222 to 5550. [2025-03-08 06:23:42,265 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:23:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5550 states to 5550 states and 8069 transitions. [2025-03-08 06:23:42,276 INFO L78 Accepts]: Start accepts. Automaton has 5550 states and 8069 transitions. Word has length 76 [2025-03-08 06:23:42,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:42,276 INFO L471 AbstractCegarLoop]: Abstraction has 5550 states and 8069 transitions. [2025-03-08 06:23:42,276 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:23:42,276 INFO L276 IsEmpty]: Start isEmpty. Operand 5550 states and 8069 transitions. [2025-03-08 06:23:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 06:23:42,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:42,281 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:23:42,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:23:42,281 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:42,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:42,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1553763355, now seen corresponding path program 1 times [2025-03-08 06:23:42,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:42,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516308374] [2025-03-08 06:23:42,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:42,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:42,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:23:42,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:23:42,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:42,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:23:42,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:42,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516308374] [2025-03-08 06:23:42,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516308374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:42,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:42,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:23:42,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587925555] [2025-03-08 06:23:42,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:42,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:23:42,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:42,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:23:42,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:23:42,387 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:23:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:42,490 INFO L93 Difference]: Finished difference Result 11376 states and 16650 transitions. [2025-03-08 06:23:42,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:23:42,491 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:23:42,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:42,515 INFO L225 Difference]: With dead ends: 11376 [2025-03-08 06:23:42,515 INFO L226 Difference]: Without dead ends: 9798 [2025-03-08 06:23:42,521 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:23:42,522 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:23:42,523 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:23:42,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9798 states. [2025-03-08 06:23:42,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9798 to 7126. [2025-03-08 06:23:42,643 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:23:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7126 states to 7126 states and 10365 transitions. [2025-03-08 06:23:42,658 INFO L78 Accepts]: Start accepts. Automaton has 7126 states and 10365 transitions. Word has length 76 [2025-03-08 06:23:42,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:42,658 INFO L471 AbstractCegarLoop]: Abstraction has 7126 states and 10365 transitions. [2025-03-08 06:23:42,658 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:23:42,659 INFO L276 IsEmpty]: Start isEmpty. Operand 7126 states and 10365 transitions. [2025-03-08 06:23:42,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 06:23:42,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:42,660 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:23:42,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:23:42,660 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:42,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:42,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1844617531, now seen corresponding path program 1 times [2025-03-08 06:23:42,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:42,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040590630] [2025-03-08 06:23:42,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:42,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:42,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:23:42,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:23:42,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:42,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:42,761 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:23:42,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:42,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040590630] [2025-03-08 06:23:42,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040590630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:42,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:42,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:23:42,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978273542] [2025-03-08 06:23:42,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:42,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:23:42,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:42,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:23:42,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:23:42,763 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:23:42,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:42,867 INFO L93 Difference]: Finished difference Result 11976 states and 17538 transitions. [2025-03-08 06:23:42,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:23:42,868 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:23:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:42,885 INFO L225 Difference]: With dead ends: 11976 [2025-03-08 06:23:42,885 INFO L226 Difference]: Without dead ends: 10886 [2025-03-08 06:23:42,890 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:23:42,890 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:23:42,890 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:23:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10886 states. [2025-03-08 06:23:42,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10886 to 8214. [2025-03-08 06:23:42,985 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:23:43,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8214 states to 8214 states and 11965 transitions. [2025-03-08 06:23:43,042 INFO L78 Accepts]: Start accepts. Automaton has 8214 states and 11965 transitions. Word has length 76 [2025-03-08 06:23:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:43,043 INFO L471 AbstractCegarLoop]: Abstraction has 8214 states and 11965 transitions. [2025-03-08 06:23:43,043 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:23:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 8214 states and 11965 transitions. [2025-03-08 06:23:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:23:43,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:43,044 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:23:43,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:23:43,045 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:43,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:43,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1757472576, now seen corresponding path program 1 times [2025-03-08 06:23:43,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:43,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501858025] [2025-03-08 06:23:43,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:43,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:43,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:23:43,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:23:43,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:43,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:43,272 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:23:43,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:43,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501858025] [2025-03-08 06:23:43,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501858025] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:23:43,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318288370] [2025-03-08 06:23:43,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:43,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:23:43,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:23:43,275 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:23:43,277 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:23:43,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:23:43,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:23:43,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:43,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:43,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 06:23:43,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:23:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:23:43,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:23:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:23:44,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318288370] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:23:44,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:23:44,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-08 06:23:44,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196647196] [2025-03-08 06:23:44,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:23:44,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 06:23:44,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:44,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 06:23:44,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2025-03-08 06:23:44,511 INFO L87 Difference]: Start difference. First operand 8214 states and 11965 transitions. Second operand has 26 states, 26 states have (on average 7.576923076923077) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:47,913 INFO L93 Difference]: Finished difference Result 74904 states and 108294 transitions. [2025-03-08 06:23:47,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-03-08 06:23:47,913 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.576923076923077) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 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:23:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:48,035 INFO L225 Difference]: With dead ends: 74904 [2025-03-08 06:23:48,035 INFO L226 Difference]: Without dead ends: 66718 [2025-03-08 06:23:48,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4395 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2448, Invalid=11358, Unknown=0, NotChecked=0, Total=13806 [2025-03-08 06:23:48,061 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 2507 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 1838 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2507 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:48,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2507 Valid, 1416 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1838 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:23:48,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66718 states. [2025-03-08 06:23:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66718 to 38182. [2025-03-08 06:23:48,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38182 states, 38181 states have (on average 1.4234043110447605) internal successors, (54347), 38181 states have internal predecessors, (54347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38182 states to 38182 states and 54347 transitions. [2025-03-08 06:23:48,678 INFO L78 Accepts]: Start accepts. Automaton has 38182 states and 54347 transitions. Word has length 77 [2025-03-08 06:23:48,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:48,678 INFO L471 AbstractCegarLoop]: Abstraction has 38182 states and 54347 transitions. [2025-03-08 06:23:48,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.576923076923077) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 38182 states and 54347 transitions. [2025-03-08 06:23:48,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:23:48,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:48,682 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:23:48,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 06:23:48,883 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:23:48,883 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:48,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:48,883 INFO L85 PathProgramCache]: Analyzing trace with hash -443481417, now seen corresponding path program 1 times [2025-03-08 06:23:48,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:48,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308988073] [2025-03-08 06:23:48,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:48,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:48,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:23:48,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:23:48,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:48,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:23:49,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:49,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308988073] [2025-03-08 06:23:49,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308988073] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:23:49,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559068497] [2025-03-08 06:23:49,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:49,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:23:49,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:23:49,114 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:23:49,116 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:23:49,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:23:49,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:23:49,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:49,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:49,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 06:23:49,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:23:49,753 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:23:49,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:23:50,419 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:23:50,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559068497] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:23:50,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:23:50,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 29 [2025-03-08 06:23:50,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161774395] [2025-03-08 06:23:50,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:23:50,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 06:23:50,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:50,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 06:23:50,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2025-03-08 06:23:50,422 INFO L87 Difference]: Start difference. First operand 38182 states and 54347 transitions. Second operand has 30 states, 30 states have (on average 7.4) internal successors, (222), 29 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:55,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:55,072 INFO L93 Difference]: Finished difference Result 405646 states and 573988 transitions. [2025-03-08 06:23:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2025-03-08 06:23:55,073 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.4) internal successors, (222), 29 states have internal predecessors, (222), 0 states have call successors, (0), 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:23:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:56,025 INFO L225 Difference]: With dead ends: 405646 [2025-03-08 06:23:56,025 INFO L226 Difference]: Without dead ends: 367492 [2025-03-08 06:23:56,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7355 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3870, Invalid=18182, Unknown=0, NotChecked=0, Total=22052 [2025-03-08 06:23:56,070 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 3439 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3439 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:56,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3439 Valid, 971 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:23:56,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367492 states. [2025-03-08 06:23:58,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367492 to 226190. [2025-03-08 06:23:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226190 states, 226189 states have (on average 1.3932994089014055) internal successors, (315149), 226189 states have internal predecessors, (315149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226190 states to 226190 states and 315149 transitions. [2025-03-08 06:23:59,907 INFO L78 Accepts]: Start accepts. Automaton has 226190 states and 315149 transitions. Word has length 78 [2025-03-08 06:23:59,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:59,907 INFO L471 AbstractCegarLoop]: Abstraction has 226190 states and 315149 transitions. [2025-03-08 06:23:59,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.4) internal successors, (222), 29 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 226190 states and 315149 transitions. [2025-03-08 06:23:59,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 06:23:59,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:59,915 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, 1] [2025-03-08 06:23:59,927 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:00,115 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:00,116 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:00,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:00,117 INFO L85 PathProgramCache]: Analyzing trace with hash -463233283, now seen corresponding path program 1 times [2025-03-08 06:24:00,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:00,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603666649] [2025-03-08 06:24:00,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:00,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:00,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 06:24:00,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 06:24:00,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:00,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:00,154 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:00,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:00,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603666649] [2025-03-08 06:24:00,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603666649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:00,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:00,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:00,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194362683] [2025-03-08 06:24:00,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:00,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:00,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:00,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:00,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:00,156 INFO L87 Difference]: Start difference. First operand 226190 states and 315149 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 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:01,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:01,540 INFO L93 Difference]: Finished difference Result 414674 states and 578744 transitions. [2025-03-08 06:24:01,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:01,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-08 06:24:01,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:01,979 INFO L225 Difference]: With dead ends: 414674 [2025-03-08 06:24:01,980 INFO L226 Difference]: Without dead ends: 188512 [2025-03-08 06:24:02,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:02,097 INFO L435 NwaCegarLoop]: 102 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, 142 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:02,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 142 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:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188512 states. [2025-03-08 06:24:03,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188512 to 188512. [2025-03-08 06:24:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188512 states, 188511 states have (on average 1.3806356127759123) internal successors, (260265), 188511 states have internal predecessors, (260265), 0 states have call successors, (0), 0 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:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188512 states to 188512 states and 260265 transitions. [2025-03-08 06:24:04,700 INFO L78 Accepts]: Start accepts. Automaton has 188512 states and 260265 transitions. Word has length 80 [2025-03-08 06:24:04,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:04,700 INFO L471 AbstractCegarLoop]: Abstraction has 188512 states and 260265 transitions. [2025-03-08 06:24:04,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 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:04,700 INFO L276 IsEmpty]: Start isEmpty. Operand 188512 states and 260265 transitions. [2025-03-08 06:24:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 06:24:04,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:04,729 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, 1] [2025-03-08 06:24:04,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:24:04,729 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:04,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:04,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1256657020, now seen corresponding path program 1 times [2025-03-08 06:24:04,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:04,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138703699] [2025-03-08 06:24:04,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:04,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:04,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 06:24:04,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 06:24:04,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:04,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:04,946 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:04,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:04,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138703699] [2025-03-08 06:24:04,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138703699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:04,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:04,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:04,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861519885] [2025-03-08 06:24:04,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:04,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:04,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:04,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:04,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:04,951 INFO L87 Difference]: Start difference. First operand 188512 states and 260265 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:06,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:06,258 INFO L93 Difference]: Finished difference Result 372618 states and 515393 transitions. [2025-03-08 06:24:06,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:06,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-08 06:24:06,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:06,509 INFO L225 Difference]: With dead ends: 372618 [2025-03-08 06:24:06,509 INFO L226 Difference]: Without dead ends: 184134 [2025-03-08 06:24:06,579 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:06,580 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 48 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 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:06,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 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:06,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184134 states. [2025-03-08 06:24:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184134 to 179812. [2025-03-08 06:24:08,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179812 states, 179811 states have (on average 1.367964140124909) internal successors, (245975), 179811 states have internal predecessors, (245975), 0 states have call successors, (0), 0 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:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179812 states to 179812 states and 245975 transitions. [2025-03-08 06:24:08,787 INFO L78 Accepts]: Start accepts. Automaton has 179812 states and 245975 transitions. Word has length 80 [2025-03-08 06:24:08,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:08,787 INFO L471 AbstractCegarLoop]: Abstraction has 179812 states and 245975 transitions. [2025-03-08 06:24:08,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:08,787 INFO L276 IsEmpty]: Start isEmpty. Operand 179812 states and 245975 transitions. [2025-03-08 06:24:08,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 06:24:08,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:08,792 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, 1] [2025-03-08 06:24:08,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:24:08,793 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:08,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:08,793 INFO L85 PathProgramCache]: Analyzing trace with hash -914179452, now seen corresponding path program 1 times [2025-03-08 06:24:08,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:08,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629086106] [2025-03-08 06:24:08,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:08,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:08,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 06:24:08,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 06:24:08,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:08,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:09,716 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:09,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:09,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629086106] [2025-03-08 06:24:09,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629086106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:24:09,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117135142] [2025-03-08 06:24:09,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:09,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:24:09,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:24:09,719 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:09,721 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:09,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 06:24:09,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 06:24:09,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:09,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:09,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 06:24:09,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:24:10,690 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:10,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:24:11,384 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:11,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117135142] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:24:11,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:24:11,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36 [2025-03-08 06:24:11,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322980035] [2025-03-08 06:24:11,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:24:11,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 06:24:11,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:11,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 06:24:11,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 06:24:11,385 INFO L87 Difference]: Start difference. First operand 179812 states and 245975 transitions. Second operand has 36 states, 36 states have (on average 6.277777777777778) internal successors, (226), 36 states have internal predecessors, (226), 0 states have call successors, (0), 0 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:22,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:22,795 INFO L93 Difference]: Finished difference Result 482084 states and 663063 transitions. [2025-03-08 06:24:22,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2025-03-08 06:24:22,795 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 6.277777777777778) internal successors, (226), 36 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-08 06:24:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:23,290 INFO L225 Difference]: With dead ends: 482084 [2025-03-08 06:24:23,290 INFO L226 Difference]: Without dead ends: 379716 [2025-03-08 06:24:23,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12959 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=4657, Invalid=32399, Unknown=0, NotChecked=0, Total=37056 [2025-03-08 06:24:23,424 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 6304 mSDsluCounter, 4430 mSDsCounter, 0 mSdLazyCounter, 2393 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6304 SdHoareTripleChecker+Valid, 4625 SdHoareTripleChecker+Invalid, 2423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:23,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6304 Valid, 4625 Invalid, 2423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2393 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 06:24:23,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379716 states. [2025-03-08 06:24:26,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379716 to 183896. [2025-03-08 06:24:26,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183896 states, 183895 states have (on average 1.36801435601838) internal successors, (251571), 183895 states have internal predecessors, (251571), 0 states have call successors, (0), 0 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:26,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183896 states to 183896 states and 251571 transitions. [2025-03-08 06:24:26,566 INFO L78 Accepts]: Start accepts. Automaton has 183896 states and 251571 transitions. Word has length 80 [2025-03-08 06:24:26,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:26,567 INFO L471 AbstractCegarLoop]: Abstraction has 183896 states and 251571 transitions. [2025-03-08 06:24:26,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 6.277777777777778) internal successors, (226), 36 states have internal predecessors, (226), 0 states have call successors, (0), 0 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:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 183896 states and 251571 transitions. [2025-03-08 06:24:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 06:24:26,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:26,570 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, 1] [2025-03-08 06:24:26,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 06:24:26,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:24:26,771 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:26,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:26,771 INFO L85 PathProgramCache]: Analyzing trace with hash -951967292, now seen corresponding path program 1 times [2025-03-08 06:24:26,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:26,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305266305] [2025-03-08 06:24:26,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:26,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:26,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 06:24:26,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 06:24:26,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:26,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:27,162 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:27,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:27,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305266305] [2025-03-08 06:24:27,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305266305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:27,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:27,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:27,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950272988] [2025-03-08 06:24:27,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:27,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:27,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:27,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:27,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:27,163 INFO L87 Difference]: Start difference. First operand 183896 states and 251571 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:27,753 INFO L93 Difference]: Finished difference Result 277084 states and 378597 transitions. [2025-03-08 06:24:27,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:27,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-08 06:24:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:27,866 INFO L225 Difference]: With dead ends: 277084 [2025-03-08 06:24:27,867 INFO L226 Difference]: Without dead ends: 93216 [2025-03-08 06:24:27,960 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:27,961 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 39 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 214 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:27,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 214 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:28,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93216 states. [2025-03-08 06:24:28,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93216 to 91942. [2025-03-08 06:24:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91942 states, 91941 states have (on average 1.3473096877345254) internal successors, (123873), 91941 states have internal predecessors, (123873), 0 states have call successors, (0), 0 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:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91942 states to 91942 states and 123873 transitions. [2025-03-08 06:24:29,310 INFO L78 Accepts]: Start accepts. Automaton has 91942 states and 123873 transitions. Word has length 80 [2025-03-08 06:24:29,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:29,310 INFO L471 AbstractCegarLoop]: Abstraction has 91942 states and 123873 transitions. [2025-03-08 06:24:29,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 91942 states and 123873 transitions. [2025-03-08 06:24:29,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 06:24:29,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:29,312 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, 1] [2025-03-08 06:24:29,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:24:29,313 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:29,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:29,313 INFO L85 PathProgramCache]: Analyzing trace with hash 734293188, now seen corresponding path program 1 times [2025-03-08 06:24:29,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:29,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905107225] [2025-03-08 06:24:29,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:29,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:29,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 06:24:29,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 06:24:29,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:29,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:30,517 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:30,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:30,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905107225] [2025-03-08 06:24:30,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905107225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:24:30,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556979558] [2025-03-08 06:24:30,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:30,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:24:30,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:24:30,519 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:24:30,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:24:30,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 06:24:30,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 06:24:30,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:30,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:30,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 06:24:30,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:24:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:33,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:24:34,957 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:34,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556979558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:24:34,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:24:34,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 25] total 68 [2025-03-08 06:24:34,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353479989] [2025-03-08 06:24:34,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:24:34,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-08 06:24:34,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:34,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-08 06:24:34,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=4062, Unknown=0, NotChecked=0, Total=4556 [2025-03-08 06:24:34,959 INFO L87 Difference]: Start difference. First operand 91942 states and 123873 transitions. Second operand has 68 states, 68 states have (on average 3.323529411764706) internal successors, (226), 68 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)