./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-var-start-time.4.ufo.UNBOUNDED.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 dcec1ccd806a412efdabd457261f7c023005f550a4699f0a865a5aa2d5f9f4d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:27:23,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:27:23,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:27:23,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:27:23,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:27:23,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:27:23,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:27:23,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:27:23,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:27:23,142 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:27:23,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:27:23,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:27:23,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:27:23,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:27:23,143 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:27:23,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:27:23,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:27:23,143 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:27:23,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:27:23,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:27:23,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:27:23,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:27:23,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:27:23,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:27:23,144 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:27:23,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:27:23,144 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:27:23,144 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:27:23,144 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:27:23,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:27:23,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:27:23,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:27:23,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:27:23,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:27:23,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:27:23,145 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:27:23,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:27:23,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:27:23,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:27:23,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:27:23,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:27:23,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:27:23,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:27:23,146 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 -> dcec1ccd806a412efdabd457261f7c023005f550a4699f0a865a5aa2d5f9f4d9 [2025-03-16 19:27:23,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:27:23,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:27:23,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:27:23,405 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:27:23,406 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:27:23,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-16 19:27:24,559 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64183e2fe/9401edc649d14f5f91673858cbb576f5/FLAG4a500353d [2025-03-16 19:27:24,826 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:27:24,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-16 19:27:24,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64183e2fe/9401edc649d14f5f91673858cbb576f5/FLAG4a500353d [2025-03-16 19:27:24,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64183e2fe/9401edc649d14f5f91673858cbb576f5 [2025-03-16 19:27:24,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:27:24,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:27:24,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:27:24,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:27:24,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:27:24,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:27:24" (1/1) ... [2025-03-16 19:27:24,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ac541f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:27:24, skipping insertion in model container [2025-03-16 19:27:24,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:27:24" (1/1) ... [2025-03-16 19:27:24,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:27:25,028 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-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5375,5388] [2025-03-16 19:27:25,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:27:25,056 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:27:25,088 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-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5375,5388] [2025-03-16 19:27:25,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:27:25,128 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:27:25,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:27:25 WrapperNode [2025-03-16 19:27:25,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:27:25,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:27:25,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:27:25,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:27:25,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:27:25" (1/1) ... [2025-03-16 19:27:25,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:27:25" (1/1) ... [2025-03-16 19:27:25,158 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 465 [2025-03-16 19:27:25,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:27:25,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:27:25,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:27:25,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:27:25,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:27:25" (1/1) ... [2025-03-16 19:27:25,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:27:25" (1/1) ... [2025-03-16 19:27:25,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:27:25" (1/1) ... [2025-03-16 19:27:25,177 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-16 19:27:25,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:27:25" (1/1) ... [2025-03-16 19:27:25,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:27:25" (1/1) ... [2025-03-16 19:27:25,182 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:27:25" (1/1) ... [2025-03-16 19:27:25,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:27:25" (1/1) ... [2025-03-16 19:27:25,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:27:25" (1/1) ... [2025-03-16 19:27:25,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:27:25" (1/1) ... [2025-03-16 19:27:25,191 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:27:25,196 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:27:25,196 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:27:25,196 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:27:25,197 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:27:25" (1/1) ... [2025-03-16 19:27:25,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:27:25,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:27:25,222 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-16 19:27:25,224 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-16 19:27:25,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:27:25,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:27:25,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:27:25,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:27:25,317 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:27:25,318 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:27:25,675 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L349: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-16 19:27:25,675 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L184: havoc main_~node2__m2~0#1; [2025-03-16 19:27:25,675 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L202: havoc main_~node3__m3~0#1; [2025-03-16 19:27:25,675 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L220: havoc main_~node4__m4~0#1; [2025-03-16 19:27:25,675 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L435: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-16 19:27:25,675 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L584: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:27:25,675 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L321: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:27:25,675 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L521: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:27:25,675 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L257: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:27:25,675 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L407: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:27:25,675 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L161: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:27:25,675 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L493: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:27:25,676 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L612: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-16 19:27:25,700 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-16 19:27:25,700 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:27:25,708 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:27:25,708 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:27:25,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:27:25 BoogieIcfgContainer [2025-03-16 19:27:25,709 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:27:25,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:27:25,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:27:25,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:27:25,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:27:24" (1/3) ... [2025-03-16 19:27:25,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455e1ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:27:25, skipping insertion in model container [2025-03-16 19:27:25,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:27:25" (2/3) ... [2025-03-16 19:27:25,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455e1ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:27:25, skipping insertion in model container [2025-03-16 19:27:25,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:27:25" (3/3) ... [2025-03-16 19:27:25,718 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-16 19:27:25,728 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:27:25,732 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 111 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:27:25,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:27:25,796 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;@497b5c1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:27:25,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:27:25,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 109 states have (on average 1.688073394495413) internal successors, (184), 110 states have internal predecessors, (184), 0 states have call successors, (0), 0 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-16 19:27:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 19:27:25,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:25,807 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-16 19:27:25,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:25,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:25,812 INFO L85 PathProgramCache]: Analyzing trace with hash -968657515, now seen corresponding path program 1 times [2025-03-16 19:27:25,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:25,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827930300] [2025-03-16 19:27:25,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:25,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:25,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 19:27:25,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 19:27:25,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:25,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:26,168 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-16 19:27:26,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:26,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827930300] [2025-03-16 19:27:26,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827930300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:26,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:26,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:26,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721927723] [2025-03-16 19:27:26,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:26,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:26,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:26,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:26,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:26,189 INFO L87 Difference]: Start difference. First operand has 111 states, 109 states have (on average 1.688073394495413) internal successors, (184), 110 states have internal predecessors, (184), 0 states have call successors, (0), 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 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-16 19:27:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:26,234 INFO L93 Difference]: Finished difference Result 265 states and 424 transitions. [2025-03-16 19:27:26,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:26,238 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-16 19:27:26,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:26,243 INFO L225 Difference]: With dead ends: 265 [2025-03-16 19:27:26,245 INFO L226 Difference]: Without dead ends: 174 [2025-03-16 19:27:26,248 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-16 19:27:26,250 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 130 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:26,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 383 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:26,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-16 19:27:26,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2025-03-16 19:27:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.5087719298245614) internal successors, (258), 171 states have internal predecessors, (258), 0 states have call successors, (0), 0 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-16 19:27:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 258 transitions. [2025-03-16 19:27:26,290 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 258 transitions. Word has length 48 [2025-03-16 19:27:26,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:26,290 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 258 transitions. [2025-03-16 19:27:26,290 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-16 19:27:26,290 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 258 transitions. [2025-03-16 19:27:26,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 19:27:26,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:26,291 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-16 19:27:26,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:27:26,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:26,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:26,292 INFO L85 PathProgramCache]: Analyzing trace with hash -841529743, now seen corresponding path program 1 times [2025-03-16 19:27:26,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:26,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000431368] [2025-03-16 19:27:26,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:26,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:26,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 19:27:26,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 19:27:26,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:26,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:26,428 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-16 19:27:26,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:26,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000431368] [2025-03-16 19:27:26,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000431368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:26,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:26,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:26,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255830526] [2025-03-16 19:27:26,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:26,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:26,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:26,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:26,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:26,431 INFO L87 Difference]: Start difference. First operand 172 states and 258 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-16 19:27:26,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:26,467 INFO L93 Difference]: Finished difference Result 432 states and 670 transitions. [2025-03-16 19:27:26,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:26,468 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-16 19:27:26,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:26,472 INFO L225 Difference]: With dead ends: 432 [2025-03-16 19:27:26,472 INFO L226 Difference]: Without dead ends: 286 [2025-03-16 19:27:26,473 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-16 19:27:26,473 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 108 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:26,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 328 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:26,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-16 19:27:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2025-03-16 19:27:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.5371024734982333) internal successors, (435), 283 states have internal predecessors, (435), 0 states have call successors, (0), 0 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-16 19:27:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 435 transitions. [2025-03-16 19:27:26,490 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 435 transitions. Word has length 49 [2025-03-16 19:27:26,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:26,490 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 435 transitions. [2025-03-16 19:27:26,490 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-16 19:27:26,490 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 435 transitions. [2025-03-16 19:27:26,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:27:26,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:26,491 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-16 19:27:26,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:27:26,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:26,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:26,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1400739311, now seen corresponding path program 1 times [2025-03-16 19:27:26,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:26,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134211934] [2025-03-16 19:27:26,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:26,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:26,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 19:27:26,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:27:26,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:26,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:26,604 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-16 19:27:26,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:26,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134211934] [2025-03-16 19:27:26,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134211934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:26,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:26,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:26,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576646464] [2025-03-16 19:27:26,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:26,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:26,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:26,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:26,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:26,606 INFO L87 Difference]: Start difference. First operand 284 states and 435 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-16 19:27:26,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:26,629 INFO L93 Difference]: Finished difference Result 736 states and 1149 transitions. [2025-03-16 19:27:26,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:26,629 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-16 19:27:26,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:26,631 INFO L225 Difference]: With dead ends: 736 [2025-03-16 19:27:26,631 INFO L226 Difference]: Without dead ends: 478 [2025-03-16 19:27:26,632 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-16 19:27:26,632 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 103 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:26,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 313 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-16 19:27:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 476. [2025-03-16 19:27:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.5473684210526315) internal successors, (735), 475 states have internal predecessors, (735), 0 states have call successors, (0), 0 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-16 19:27:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 735 transitions. [2025-03-16 19:27:26,671 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 735 transitions. Word has length 50 [2025-03-16 19:27:26,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:26,671 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 735 transitions. [2025-03-16 19:27:26,671 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-16 19:27:26,671 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 735 transitions. [2025-03-16 19:27:26,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 19:27:26,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:26,673 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-16 19:27:26,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:27:26,673 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:26,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:26,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1417037813, now seen corresponding path program 1 times [2025-03-16 19:27:26,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:26,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503930821] [2025-03-16 19:27:26,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:26,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:26,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 19:27:26,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 19:27:26,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:26,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:26,835 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-16 19:27:26,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:26,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503930821] [2025-03-16 19:27:26,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503930821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:26,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:26,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:26,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786714682] [2025-03-16 19:27:26,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:26,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:27:26,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:26,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:27:26,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:26,838 INFO L87 Difference]: Start difference. First operand 476 states and 735 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-16 19:27:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:26,953 INFO L93 Difference]: Finished difference Result 2726 states and 4280 transitions. [2025-03-16 19:27:26,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:27:26,954 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-16 19:27:26,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:26,963 INFO L225 Difference]: With dead ends: 2726 [2025-03-16 19:27:26,963 INFO L226 Difference]: Without dead ends: 2276 [2025-03-16 19:27:26,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:26,968 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1024 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:26,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 1304 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:26,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2025-03-16 19:27:27,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 924. [2025-03-16 19:27:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 923 states have (on average 1.5460455037919827) internal successors, (1427), 923 states have internal predecessors, (1427), 0 states have call successors, (0), 0 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-16 19:27:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1427 transitions. [2025-03-16 19:27:27,005 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1427 transitions. Word has length 51 [2025-03-16 19:27:27,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:27,006 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1427 transitions. [2025-03-16 19:27:27,006 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-16 19:27:27,006 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1427 transitions. [2025-03-16 19:27:27,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 19:27:27,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:27,009 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] [2025-03-16 19:27:27,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:27:27,009 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:27,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:27,010 INFO L85 PathProgramCache]: Analyzing trace with hash -977543937, now seen corresponding path program 1 times [2025-03-16 19:27:27,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:27,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624913572] [2025-03-16 19:27:27,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:27,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:27,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 19:27:27,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 19:27:27,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:27,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:27,183 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-16 19:27:27,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:27,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624913572] [2025-03-16 19:27:27,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624913572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:27,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:27,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:27,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467798370] [2025-03-16 19:27:27,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:27,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:27:27,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:27,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:27:27,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:27,185 INFO L87 Difference]: Start difference. First operand 924 states and 1427 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-16 19:27:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:27,270 INFO L93 Difference]: Finished difference Result 4028 states and 6231 transitions. [2025-03-16 19:27:27,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:27:27,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-16 19:27:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:27,281 INFO L225 Difference]: With dead ends: 4028 [2025-03-16 19:27:27,281 INFO L226 Difference]: Without dead ends: 3130 [2025-03-16 19:27:27,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:27,283 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 581 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:27,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 550 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3130 states. [2025-03-16 19:27:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3130 to 3124. [2025-03-16 19:27:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 3123 states have (on average 1.5405059237912264) internal successors, (4811), 3123 states have internal predecessors, (4811), 0 states have call successors, (0), 0 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-16 19:27:27,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4811 transitions. [2025-03-16 19:27:27,352 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4811 transitions. Word has length 52 [2025-03-16 19:27:27,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:27,353 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 4811 transitions. [2025-03-16 19:27:27,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-16 19:27:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4811 transitions. [2025-03-16 19:27:27,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 19:27:27,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:27,354 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-16 19:27:27,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:27:27,354 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:27,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:27,355 INFO L85 PathProgramCache]: Analyzing trace with hash 480127589, now seen corresponding path program 1 times [2025-03-16 19:27:27,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:27,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596251335] [2025-03-16 19:27:27,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:27,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:27,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 19:27:27,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 19:27:27,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:27,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:27,407 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-16 19:27:27,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:27,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596251335] [2025-03-16 19:27:27,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596251335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:27,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:27,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:27,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701430676] [2025-03-16 19:27:27,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:27,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:27,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:27,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:27,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:27,410 INFO L87 Difference]: Start difference. First operand 3124 states and 4811 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-16 19:27:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:27,448 INFO L93 Difference]: Finished difference Result 8248 states and 12653 transitions. [2025-03-16 19:27:27,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:27,448 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-16 19:27:27,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:27,463 INFO L225 Difference]: With dead ends: 8248 [2025-03-16 19:27:27,463 INFO L226 Difference]: Without dead ends: 5150 [2025-03-16 19:27:27,470 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-16 19:27:27,471 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 115 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:27,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 368 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:27,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5150 states. [2025-03-16 19:27:27,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5150 to 5148. [2025-03-16 19:27:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5148 states, 5147 states have (on average 1.5160287546143385) internal successors, (7803), 5147 states have internal predecessors, (7803), 0 states have call successors, (0), 0 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-16 19:27:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 7803 transitions. [2025-03-16 19:27:27,583 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 7803 transitions. Word has length 53 [2025-03-16 19:27:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:27,583 INFO L471 AbstractCegarLoop]: Abstraction has 5148 states and 7803 transitions. [2025-03-16 19:27:27,583 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-16 19:27:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 7803 transitions. [2025-03-16 19:27:27,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 19:27:27,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:27,583 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-16 19:27:27,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:27:27,584 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:27,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:27,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1181635777, now seen corresponding path program 1 times [2025-03-16 19:27:27,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:27,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127958540] [2025-03-16 19:27:27,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:27,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:27,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 19:27:27,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 19:27:27,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:27,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:27,831 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-16 19:27:27,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:27,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127958540] [2025-03-16 19:27:27,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127958540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:27,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:27,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:27:27,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266959113] [2025-03-16 19:27:27,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:27,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:27:27,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:27,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:27:27,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:27:27,834 INFO L87 Difference]: Start difference. First operand 5148 states and 7803 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-16 19:27:27,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:27,884 INFO L93 Difference]: Finished difference Result 5406 states and 8188 transitions. [2025-03-16 19:27:27,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:27:27,886 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-16 19:27:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:27,903 INFO L225 Difference]: With dead ends: 5406 [2025-03-16 19:27:27,904 INFO L226 Difference]: Without dead ends: 5404 [2025-03-16 19:27:27,907 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-16 19:27:27,907 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:27,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 602 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5404 states. [2025-03-16 19:27:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5404 to 5404. [2025-03-16 19:27:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5404 states, 5403 states have (on average 1.4915787525448825) internal successors, (8059), 5403 states have internal predecessors, (8059), 0 states have call successors, (0), 0 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-16 19:27:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5404 states to 5404 states and 8059 transitions. [2025-03-16 19:27:28,014 INFO L78 Accepts]: Start accepts. Automaton has 5404 states and 8059 transitions. Word has length 54 [2025-03-16 19:27:28,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:28,015 INFO L471 AbstractCegarLoop]: Abstraction has 5404 states and 8059 transitions. [2025-03-16 19:27:28,015 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-16 19:27:28,015 INFO L276 IsEmpty]: Start isEmpty. Operand 5404 states and 8059 transitions. [2025-03-16 19:27:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 19:27:28,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:28,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:28,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:27:28,017 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:28,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:28,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2019228023, now seen corresponding path program 1 times [2025-03-16 19:27:28,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:28,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631194671] [2025-03-16 19:27:28,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:28,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:28,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 19:27:28,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 19:27:28,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:28,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:28,129 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-16 19:27:28,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:28,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631194671] [2025-03-16 19:27:28,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631194671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:28,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:28,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:28,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945052145] [2025-03-16 19:27:28,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:28,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:28,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:28,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:28,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:28,131 INFO L87 Difference]: Start difference. First operand 5404 states and 8059 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-16 19:27:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:28,184 INFO L93 Difference]: Finished difference Result 13258 states and 19787 transitions. [2025-03-16 19:27:28,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:28,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-16 19:27:28,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:28,213 INFO L225 Difference]: With dead ends: 13258 [2025-03-16 19:27:28,213 INFO L226 Difference]: Without dead ends: 7880 [2025-03-16 19:27:28,225 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-16 19:27:28,226 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 92 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:28,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 280 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:28,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7880 states. [2025-03-16 19:27:28,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7880 to 7822. [2025-03-16 19:27:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7822 states, 7821 states have (on average 1.4812683800025572) internal successors, (11585), 7821 states have internal predecessors, (11585), 0 states have call successors, (0), 0 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-16 19:27:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7822 states to 7822 states and 11585 transitions. [2025-03-16 19:27:28,390 INFO L78 Accepts]: Start accepts. Automaton has 7822 states and 11585 transitions. Word has length 55 [2025-03-16 19:27:28,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:28,390 INFO L471 AbstractCegarLoop]: Abstraction has 7822 states and 11585 transitions. [2025-03-16 19:27:28,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-16 19:27:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand 7822 states and 11585 transitions. [2025-03-16 19:27:28,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:27:28,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:28,395 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, 1] [2025-03-16 19:27:28,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:27:28,395 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:28,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:28,396 INFO L85 PathProgramCache]: Analyzing trace with hash -517759730, now seen corresponding path program 1 times [2025-03-16 19:27:28,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:28,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210281826] [2025-03-16 19:27:28,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:28,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:28,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:27:28,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:27:28,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:28,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:28,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:28,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210281826] [2025-03-16 19:27:28,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210281826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:27:28,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797347948] [2025-03-16 19:27:28,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:28,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:27:28,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:27:28,709 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-16 19:27:28,710 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-16 19:27:28,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:27:28,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:27:28,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:28,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:28,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-16 19:27:28,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:27:29,535 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:29,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:27:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:30,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797347948] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:27:30,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:27:30,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-16 19:27:30,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590022099] [2025-03-16 19:27:30,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:27:30,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-16 19:27:30,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:30,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-16 19:27:30,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-03-16 19:27:30,065 INFO L87 Difference]: Start difference. First operand 7822 states and 11585 transitions. Second operand has 22 states, 22 states have (on average 10.272727272727273) internal successors, (226), 22 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-16 19:27:35,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:35,796 INFO L93 Difference]: Finished difference Result 63801 states and 93786 transitions. [2025-03-16 19:27:35,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2025-03-16 19:27:35,797 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.272727272727273) internal successors, (226), 22 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 78 [2025-03-16 19:27:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:35,905 INFO L225 Difference]: With dead ends: 63801 [2025-03-16 19:27:35,906 INFO L226 Difference]: Without dead ends: 56007 [2025-03-16 19:27:35,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7084 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3206, Invalid=14884, Unknown=0, NotChecked=0, Total=18090 [2025-03-16 19:27:35,927 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 7751 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 2678 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7751 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:35,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7751 Valid, 2198 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2678 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 19:27:35,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56007 states. [2025-03-16 19:27:36,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56007 to 50282. [2025-03-16 19:27:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50282 states, 50281 states have (on average 1.4519798731131044) internal successors, (73007), 50281 states have internal predecessors, (73007), 0 states have call successors, (0), 0 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-16 19:27:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50282 states to 50282 states and 73007 transitions. [2025-03-16 19:27:36,848 INFO L78 Accepts]: Start accepts. Automaton has 50282 states and 73007 transitions. Word has length 78 [2025-03-16 19:27:36,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:36,848 INFO L471 AbstractCegarLoop]: Abstraction has 50282 states and 73007 transitions. [2025-03-16 19:27:36,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.272727272727273) internal successors, (226), 22 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-16 19:27:36,849 INFO L276 IsEmpty]: Start isEmpty. Operand 50282 states and 73007 transitions. [2025-03-16 19:27:36,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:27:36,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:36,852 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:36,860 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-16 19:27:37,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:27:37,053 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:37,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:37,054 INFO L85 PathProgramCache]: Analyzing trace with hash 143969647, now seen corresponding path program 1 times [2025-03-16 19:27:37,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:37,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453305481] [2025-03-16 19:27:37,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:37,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:37,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:27:37,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:27:37,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:37,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:37,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:37,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453305481] [2025-03-16 19:27:37,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453305481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:37,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:37,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:37,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246727816] [2025-03-16 19:27:37,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:37,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:37,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:37,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:37,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:37,111 INFO L87 Difference]: Start difference. First operand 50282 states and 73007 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:37,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:37,546 INFO L93 Difference]: Finished difference Result 125282 states and 181379 transitions. [2025-03-16 19:27:37,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:37,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-16 19:27:37,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:37,702 INFO L225 Difference]: With dead ends: 125282 [2025-03-16 19:27:37,702 INFO L226 Difference]: Without dead ends: 85182 [2025-03-16 19:27:37,744 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-16 19:27:37,744 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 88 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:37,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 299 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:37,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85182 states. [2025-03-16 19:27:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85182 to 85180. [2025-03-16 19:27:38,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85180 states, 85179 states have (on average 1.4350250648634053) internal successors, (122234), 85179 states have internal predecessors, (122234), 0 states have call successors, (0), 0 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-16 19:27:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85180 states to 85180 states and 122234 transitions. [2025-03-16 19:27:38,869 INFO L78 Accepts]: Start accepts. Automaton has 85180 states and 122234 transitions. Word has length 79 [2025-03-16 19:27:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:38,869 INFO L471 AbstractCegarLoop]: Abstraction has 85180 states and 122234 transitions. [2025-03-16 19:27:38,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 85180 states and 122234 transitions. [2025-03-16 19:27:38,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:27:38,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:38,874 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:38,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:27:38,874 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:38,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:38,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1260847245, now seen corresponding path program 1 times [2025-03-16 19:27:38,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:38,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638406973] [2025-03-16 19:27:38,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:38,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:38,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:27:38,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:27:38,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:38,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:38,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:38,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638406973] [2025-03-16 19:27:38,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638406973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:38,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:38,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:38,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683269661] [2025-03-16 19:27:38,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:38,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:38,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:38,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:38,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:38,925 INFO L87 Difference]: Start difference. First operand 85180 states and 122234 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:39,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:39,465 INFO L93 Difference]: Finished difference Result 194684 states and 278374 transitions. [2025-03-16 19:27:39,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:39,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-16 19:27:39,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:39,630 INFO L225 Difference]: With dead ends: 194684 [2025-03-16 19:27:39,631 INFO L226 Difference]: Without dead ends: 119863 [2025-03-16 19:27:39,675 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-16 19:27:39,677 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 89 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:39,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 318 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:39,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119863 states. [2025-03-16 19:27:41,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119863 to 116497. [2025-03-16 19:27:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116497 states, 116496 states have (on average 1.417301881609669) internal successors, (165110), 116496 states have internal predecessors, (165110), 0 states have call successors, (0), 0 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-16 19:27:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116497 states to 116497 states and 165110 transitions. [2025-03-16 19:27:41,424 INFO L78 Accepts]: Start accepts. Automaton has 116497 states and 165110 transitions. Word has length 79 [2025-03-16 19:27:41,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:41,424 INFO L471 AbstractCegarLoop]: Abstraction has 116497 states and 165110 transitions. [2025-03-16 19:27:41,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 116497 states and 165110 transitions. [2025-03-16 19:27:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:27:41,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:41,430 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:41,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:27:41,431 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:41,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:41,431 INFO L85 PathProgramCache]: Analyzing trace with hash 324108737, now seen corresponding path program 1 times [2025-03-16 19:27:41,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:41,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131327210] [2025-03-16 19:27:41,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:41,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:41,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:27:41,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:27:41,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:41,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:41,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:41,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131327210] [2025-03-16 19:27:41,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131327210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:41,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:41,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:41,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140872173] [2025-03-16 19:27:41,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:41,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:41,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:41,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:41,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:41,477 INFO L87 Difference]: Start difference. First operand 116497 states and 165110 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:41,993 INFO L93 Difference]: Finished difference Result 188080 states and 265501 transitions. [2025-03-16 19:27:41,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:41,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-16 19:27:41,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:42,144 INFO L225 Difference]: With dead ends: 188080 [2025-03-16 19:27:42,144 INFO L226 Difference]: Without dead ends: 120646 [2025-03-16 19:27:42,193 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-16 19:27:42,193 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 93 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:42,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 367 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120646 states. [2025-03-16 19:27:43,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120646 to 109308. [2025-03-16 19:27:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109308 states, 109307 states have (on average 1.3972847118665777) internal successors, (152733), 109307 states have internal predecessors, (152733), 0 states have call successors, (0), 0 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-16 19:27:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109308 states to 109308 states and 152733 transitions. [2025-03-16 19:27:43,801 INFO L78 Accepts]: Start accepts. Automaton has 109308 states and 152733 transitions. Word has length 79 [2025-03-16 19:27:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:43,802 INFO L471 AbstractCegarLoop]: Abstraction has 109308 states and 152733 transitions. [2025-03-16 19:27:43,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 109308 states and 152733 transitions. [2025-03-16 19:27:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:27:43,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:43,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:43,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:27:43,806 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:43,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:43,806 INFO L85 PathProgramCache]: Analyzing trace with hash 926134951, now seen corresponding path program 1 times [2025-03-16 19:27:43,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:43,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959517179] [2025-03-16 19:27:43,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:43,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:43,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:27:43,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:27:43,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:43,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:43,907 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-16 19:27:43,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:43,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959517179] [2025-03-16 19:27:43,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959517179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:43,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:43,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:43,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092607489] [2025-03-16 19:27:43,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:43,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:27:43,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:43,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:27:43,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:43,909 INFO L87 Difference]: Start difference. First operand 109308 states and 152733 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-16 19:27:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:44,696 INFO L93 Difference]: Finished difference Result 263813 states and 371813 transitions. [2025-03-16 19:27:44,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:27:44,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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 79 [2025-03-16 19:27:44,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:45,223 INFO L225 Difference]: With dead ends: 263813 [2025-03-16 19:27:45,223 INFO L226 Difference]: Without dead ends: 222724 [2025-03-16 19:27:45,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:45,281 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 733 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:45,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1036 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:45,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222724 states. [2025-03-16 19:27:46,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222724 to 148965. [2025-03-16 19:27:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148965 states, 148964 states have (on average 1.3924505249590504) internal successors, (207425), 148964 states have internal predecessors, (207425), 0 states have call successors, (0), 0 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-16 19:27:47,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148965 states to 148965 states and 207425 transitions. [2025-03-16 19:27:47,491 INFO L78 Accepts]: Start accepts. Automaton has 148965 states and 207425 transitions. Word has length 79 [2025-03-16 19:27:47,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:47,491 INFO L471 AbstractCegarLoop]: Abstraction has 148965 states and 207425 transitions. [2025-03-16 19:27:47,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-16 19:27:47,491 INFO L276 IsEmpty]: Start isEmpty. Operand 148965 states and 207425 transitions. [2025-03-16 19:27:47,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:27:47,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:47,495 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:47,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:27:47,496 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:47,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:47,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1285358857, now seen corresponding path program 1 times [2025-03-16 19:27:47,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:47,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105055591] [2025-03-16 19:27:47,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:47,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:47,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:27:47,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:27:47,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:47,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:47,573 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-16 19:27:47,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:47,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105055591] [2025-03-16 19:27:47,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105055591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:47,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:47,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:47,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589640154] [2025-03-16 19:27:47,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:47,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:27:47,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:47,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:27:47,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:47,576 INFO L87 Difference]: Start difference. First operand 148965 states and 207425 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:48,561 INFO L93 Difference]: Finished difference Result 311200 states and 437565 transitions. [2025-03-16 19:27:48,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:27:48,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-16 19:27:48,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:48,930 INFO L225 Difference]: With dead ends: 311200 [2025-03-16 19:27:48,930 INFO L226 Difference]: Without dead ends: 261879 [2025-03-16 19:27:48,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:48,983 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 784 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:48,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 1074 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261879 states. [2025-03-16 19:27:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261879 to 196542. [2025-03-16 19:27:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196542 states, 196541 states have (on average 1.3901272508026314) internal successors, (273217), 196541 states have internal predecessors, (273217), 0 states have call successors, (0), 0 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-16 19:27:51,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196542 states to 196542 states and 273217 transitions. [2025-03-16 19:27:51,766 INFO L78 Accepts]: Start accepts. Automaton has 196542 states and 273217 transitions. Word has length 79 [2025-03-16 19:27:51,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:51,766 INFO L471 AbstractCegarLoop]: Abstraction has 196542 states and 273217 transitions. [2025-03-16 19:27:51,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:51,766 INFO L276 IsEmpty]: Start isEmpty. Operand 196542 states and 273217 transitions. [2025-03-16 19:27:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:27:51,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:51,770 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:51,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:27:51,770 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:51,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:51,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1512132269, now seen corresponding path program 1 times [2025-03-16 19:27:51,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:51,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198341680] [2025-03-16 19:27:51,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:51,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:51,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:27:51,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:27:51,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:51,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:51,851 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-16 19:27:51,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:51,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198341680] [2025-03-16 19:27:51,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198341680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:51,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:51,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:51,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068038825] [2025-03-16 19:27:51,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:51,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:27:51,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:51,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:27:51,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:51,857 INFO L87 Difference]: Start difference. First operand 196542 states and 273217 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-16 19:27:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:52,876 INFO L93 Difference]: Finished difference Result 363724 states and 510345 transitions. [2025-03-16 19:27:52,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:27:52,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-16 19:27:52,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:53,257 INFO L225 Difference]: With dead ends: 363724 [2025-03-16 19:27:53,257 INFO L226 Difference]: Without dead ends: 309383 [2025-03-16 19:27:53,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:53,348 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 784 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:53,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 958 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:53,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309383 states. [2025-03-16 19:27:56,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309383 to 233651. [2025-03-16 19:27:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233651 states, 233650 states have (on average 1.389278835865611) internal successors, (324605), 233650 states have internal predecessors, (324605), 0 states have call successors, (0), 0 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-16 19:27:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233651 states to 233651 states and 324605 transitions. [2025-03-16 19:27:57,035 INFO L78 Accepts]: Start accepts. Automaton has 233651 states and 324605 transitions. Word has length 79 [2025-03-16 19:27:57,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:57,036 INFO L471 AbstractCegarLoop]: Abstraction has 233651 states and 324605 transitions. [2025-03-16 19:27:57,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-16 19:27:57,036 INFO L276 IsEmpty]: Start isEmpty. Operand 233651 states and 324605 transitions. [2025-03-16 19:27:57,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:27:57,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:57,040 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-16 19:27:57,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:27:57,040 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:57,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:57,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1734908230, now seen corresponding path program 1 times [2025-03-16 19:27:57,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:57,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428185526] [2025-03-16 19:27:57,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:57,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:57,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:27:57,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:27:57,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:57,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:57,112 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-16 19:27:57,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:57,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428185526] [2025-03-16 19:27:57,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428185526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:57,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:57,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:57,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718762975] [2025-03-16 19:27:57,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:57,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:27:57,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:57,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:27:57,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:57,114 INFO L87 Difference]: Start difference. First operand 233651 states and 324605 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-16 19:27:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:57,750 INFO L93 Difference]: Finished difference Result 356953 states and 499303 transitions. [2025-03-16 19:27:57,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:27:57,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-16 19:27:57,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:58,668 INFO L225 Difference]: With dead ends: 356953 [2025-03-16 19:27:58,669 INFO L226 Difference]: Without dead ends: 332707 [2025-03-16 19:27:58,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:58,733 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 808 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:58,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 950 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332707 states. [2025-03-16 19:28:01,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332707 to 257025. [2025-03-16 19:28:01,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257025 states, 257024 states have (on average 1.389632874750996) internal successors, (357169), 257024 states have internal predecessors, (357169), 0 states have call successors, (0), 0 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-16 19:28:02,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257025 states to 257025 states and 357169 transitions. [2025-03-16 19:28:02,193 INFO L78 Accepts]: Start accepts. Automaton has 257025 states and 357169 transitions. Word has length 80 [2025-03-16 19:28:02,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:02,193 INFO L471 AbstractCegarLoop]: Abstraction has 257025 states and 357169 transitions. [2025-03-16 19:28:02,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-16 19:28:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 257025 states and 357169 transitions. [2025-03-16 19:28:02,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:28:02,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:02,198 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, 1, 1] [2025-03-16 19:28:02,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:28:02,199 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:02,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:02,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1496872328, now seen corresponding path program 1 times [2025-03-16 19:28:02,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:02,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68908011] [2025-03-16 19:28:02,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:02,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:02,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:28:02,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:28:02,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:02,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:02,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:02,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68908011] [2025-03-16 19:28:02,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68908011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:02,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:02,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:02,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109539329] [2025-03-16 19:28:02,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:02,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:02,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:02,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:02,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:02,268 INFO L87 Difference]: Start difference. First operand 257025 states and 357169 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-16 19:28:04,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:04,154 INFO L93 Difference]: Finished difference Result 605157 states and 836305 transitions. [2025-03-16 19:28:04,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:04,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-16 19:28:04,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:04,700 INFO L225 Difference]: With dead ends: 605157 [2025-03-16 19:28:04,700 INFO L226 Difference]: Without dead ends: 380941 [2025-03-16 19:28:04,856 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-16 19:28:04,857 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 89 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:04,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 365 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:05,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380941 states.