./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash afac0863a681e4712e7bffaf04a415cd693c6153e1fe439605f11a4c250fdcc1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:56:43,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:56:44,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:56:44,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:56:44,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:56:44,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:56:44,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:56:44,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:56:44,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:56:44,065 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:56:44,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:56:44,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:56:44,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:56:44,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:56:44,069 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:56:44,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:56:44,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:56:44,070 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:56:44,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:56:44,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:56:44,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:56:44,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:56:44,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:56:44,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:56:44,078 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:56:44,079 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:56:44,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:56:44,079 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:56:44,079 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:56:44,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:56:44,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:56:44,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:56:44,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:56:44,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:56:44,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:56:44,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:56:44,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:56:44,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:56:44,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:56:44,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:56:44,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:56:44,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:56:44,085 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> afac0863a681e4712e7bffaf04a415cd693c6153e1fe439605f11a4c250fdcc1 [2024-11-09 23:56:44,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:56:44,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:56:44,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:56:44,349 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:56:44,350 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:56:44,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-11-09 23:56:45,844 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:56:46,019 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:56:46,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-11-09 23:56:46,030 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c6ec11e4/5f674f5009e648f8970d672fb82c0e71/FLAG5706aea83 [2024-11-09 23:56:46,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c6ec11e4/5f674f5009e648f8970d672fb82c0e71 [2024-11-09 23:56:46,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:56:46,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:56:46,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:56:46,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:56:46,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:56:46,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:56:46" (1/1) ... [2024-11-09 23:56:46,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@409f53ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:46, skipping insertion in model container [2024-11-09 23:56:46,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:56:46" (1/1) ... [2024-11-09 23:56:46,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:56:46,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4069,4082] [2024-11-09 23:56:46,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:56:46,368 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:56:46,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4069,4082] [2024-11-09 23:56:46,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:56:46,438 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:56:46,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:46 WrapperNode [2024-11-09 23:56:46,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:56:46,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:56:46,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:56:46,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:56:46,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:46" (1/1) ... [2024-11-09 23:56:46,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:46" (1/1) ... [2024-11-09 23:56:46,505 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 296 [2024-11-09 23:56:46,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:56:46,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:56:46,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:56:46,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:56:46,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:46" (1/1) ... [2024-11-09 23:56:46,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:46" (1/1) ... [2024-11-09 23:56:46,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:46" (1/1) ... [2024-11-09 23:56:46,552 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]. [2024-11-09 23:56:46,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:46" (1/1) ... [2024-11-09 23:56:46,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:46" (1/1) ... [2024-11-09 23:56:46,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:46" (1/1) ... [2024-11-09 23:56:46,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:46" (1/1) ... [2024-11-09 23:56:46,570 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:46" (1/1) ... [2024-11-09 23:56:46,571 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:46" (1/1) ... [2024-11-09 23:56:46,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:56:46,579 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:56:46,579 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:56:46,579 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:56:46,580 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:46" (1/1) ... [2024-11-09 23:56:46,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:56:46,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:56:46,616 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) [2024-11-09 23:56:46,623 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 [2024-11-09 23:56:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:56:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:56:46,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:56:46,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:56:46,779 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:56:46,782 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:56:47,180 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-09 23:56:47,183 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:56:47,183 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:56:47,183 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:56:47,183 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:56:47,183 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:56:47,184 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-09 23:56:47,184 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L354: havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-09 23:56:47,184 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L156: havoc main_~node3__m3~0#1;havoc main_~node2__m2~0#1; [2024-11-09 23:56:47,184 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L156: havoc main_~node3__m3~0#1;havoc main_~node2__m2~0#1; [2024-11-09 23:56:47,184 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L156: havoc main_~node3__m3~0#1;havoc main_~node2__m2~0#1; [2024-11-09 23:56:47,184 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:56:47,185 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:56:47,185 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:56:47,186 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:56:47,186 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:56:47,186 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:56:47,186 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:56:47,186 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:56:47,187 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:56:47,187 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:56:47,187 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:56:47,188 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:56:47,189 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:56:47,189 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:56:47,189 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:56:47,190 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:56:47,190 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:56:47,190 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:56:47,210 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-09 23:56:47,210 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:56:47,225 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:56:47,227 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:56:47,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:56:47 BoogieIcfgContainer [2024-11-09 23:56:47,228 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:56:47,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:56:47,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:56:47,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:56:47,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:56:46" (1/3) ... [2024-11-09 23:56:47,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c206d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:56:47, skipping insertion in model container [2024-11-09 23:56:47,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:46" (2/3) ... [2024-11-09 23:56:47,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c206d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:56:47, skipping insertion in model container [2024-11-09 23:56:47,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:56:47" (3/3) ... [2024-11-09 23:56:47,236 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-11-09 23:56:47,250 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:56:47,250 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:56:47,308 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:56:47,316 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;@34258bb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:56:47,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:56:47,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 66 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:47,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 23:56:47,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:56:47,329 INFO L215 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] [2024-11-09 23:56:47,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:56:47,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:56:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash 176432499, now seen corresponding path program 1 times [2024-11-09 23:56:47,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:56:47,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396040100] [2024-11-09 23:56:47,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:56:47,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:56:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:56:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:56:47,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:56:47,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396040100] [2024-11-09 23:56:47,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396040100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:56:47,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:56:47,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:56:47,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529489646] [2024-11-09 23:56:47,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:56:47,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:56:47,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:56:47,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:56:47,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:56:47,734 INFO L87 Difference]: Start difference. First operand has 67 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 66 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:56:47,786 INFO L93 Difference]: Finished difference Result 153 states and 237 transitions. [2024-11-09 23:56:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:56:47,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-09 23:56:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:56:47,805 INFO L225 Difference]: With dead ends: 153 [2024-11-09 23:56:47,806 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 23:56:47,809 INFO L431 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 [2024-11-09 23:56:47,812 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 71 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:56:47,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 226 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:56:47,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 23:56:47,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-09 23:56:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.4375) internal successors, (138), 96 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2024-11-09 23:56:47,853 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 37 [2024-11-09 23:56:47,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:56:47,854 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2024-11-09 23:56:47,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:47,854 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2024-11-09 23:56:47,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 23:56:47,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:56:47,856 INFO L215 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] [2024-11-09 23:56:47,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:56:47,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:56:47,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:56:47,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1579387573, now seen corresponding path program 1 times [2024-11-09 23:56:47,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:56:47,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330184533] [2024-11-09 23:56:47,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:56:47,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:56:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:56:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:56:47,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:56:47,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330184533] [2024-11-09 23:56:47,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330184533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:56:47,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:56:47,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:56:47,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048558004] [2024-11-09 23:56:47,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:56:48,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:56:48,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:56:48,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:56:48,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:56:48,001 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:56:48,036 INFO L93 Difference]: Finished difference Result 237 states and 350 transitions. [2024-11-09 23:56:48,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:56:48,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-09 23:56:48,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:56:48,039 INFO L225 Difference]: With dead ends: 237 [2024-11-09 23:56:48,039 INFO L226 Difference]: Without dead ends: 159 [2024-11-09 23:56:48,040 INFO L431 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 [2024-11-09 23:56:48,042 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 51 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:56:48,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 193 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:56:48,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-09 23:56:48,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2024-11-09 23:56:48,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.4615384615384615) internal successors, (228), 156 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 228 transitions. [2024-11-09 23:56:48,064 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 228 transitions. Word has length 38 [2024-11-09 23:56:48,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:56:48,065 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 228 transitions. [2024-11-09 23:56:48,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:48,069 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 228 transitions. [2024-11-09 23:56:48,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 23:56:48,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:56:48,071 INFO L215 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] [2024-11-09 23:56:48,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:56:48,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:56:48,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:56:48,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2095242818, now seen corresponding path program 1 times [2024-11-09 23:56:48,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:56:48,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591145836] [2024-11-09 23:56:48,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:56:48,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:56:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:56:48,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:56:48,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:56:48,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591145836] [2024-11-09 23:56:48,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591145836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:56:48,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:56:48,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:56:48,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460248839] [2024-11-09 23:56:48,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:56:48,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:56:48,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:56:48,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:56:48,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:56:48,202 INFO L87 Difference]: Start difference. First operand 157 states and 228 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:48,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:56:48,227 INFO L93 Difference]: Finished difference Result 401 states and 594 transitions. [2024-11-09 23:56:48,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:56:48,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-09 23:56:48,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:56:48,233 INFO L225 Difference]: With dead ends: 401 [2024-11-09 23:56:48,233 INFO L226 Difference]: Without dead ends: 263 [2024-11-09 23:56:48,234 INFO L431 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 [2024-11-09 23:56:48,235 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 46 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:56:48,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:56:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-09 23:56:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2024-11-09 23:56:48,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.4615384615384615) internal successors, (380), 260 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:48,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 380 transitions. [2024-11-09 23:56:48,268 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 380 transitions. Word has length 39 [2024-11-09 23:56:48,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:56:48,268 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 380 transitions. [2024-11-09 23:56:48,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:48,269 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 380 transitions. [2024-11-09 23:56:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 23:56:48,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:56:48,270 INFO L215 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] [2024-11-09 23:56:48,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:56:48,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:56:48,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:56:48,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1257409625, now seen corresponding path program 1 times [2024-11-09 23:56:48,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:56:48,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507875541] [2024-11-09 23:56:48,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:56:48,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:56:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:56:48,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:56:48,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:56:48,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507875541] [2024-11-09 23:56:48,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507875541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:56:48,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:56:48,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:56:48,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330011573] [2024-11-09 23:56:48,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:56:48,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:56:48,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:56:48,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:56:48,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:56:48,428 INFO L87 Difference]: Start difference. First operand 261 states and 380 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:56:48,562 INFO L93 Difference]: Finished difference Result 1713 states and 2546 transitions. [2024-11-09 23:56:48,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:56:48,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-11-09 23:56:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:56:48,569 INFO L225 Difference]: With dead ends: 1713 [2024-11-09 23:56:48,569 INFO L226 Difference]: Without dead ends: 1471 [2024-11-09 23:56:48,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:56:48,577 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 379 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:56:48,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 602 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:56:48,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2024-11-09 23:56:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 501. [2024-11-09 23:56:48,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.448) internal successors, (724), 500 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 724 transitions. [2024-11-09 23:56:48,618 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 724 transitions. Word has length 40 [2024-11-09 23:56:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:56:48,618 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 724 transitions. [2024-11-09 23:56:48,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:48,619 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 724 transitions. [2024-11-09 23:56:48,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 23:56:48,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:56:48,620 INFO L215 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] [2024-11-09 23:56:48,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:56:48,620 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:56:48,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:56:48,621 INFO L85 PathProgramCache]: Analyzing trace with hash 203211755, now seen corresponding path program 1 times [2024-11-09 23:56:48,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:56:48,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040970132] [2024-11-09 23:56:48,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:56:48,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:56:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:56:48,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:56:48,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:56:48,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040970132] [2024-11-09 23:56:48,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040970132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:56:48,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:56:48,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:56:48,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90714551] [2024-11-09 23:56:48,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:56:48,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:56:48,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:56:48,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:56:48,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:56:48,900 INFO L87 Difference]: Start difference. First operand 501 states and 724 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:48,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:56:48,975 INFO L93 Difference]: Finished difference Result 985 states and 1430 transitions. [2024-11-09 23:56:48,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:56:48,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-11-09 23:56:48,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:56:48,978 INFO L225 Difference]: With dead ends: 985 [2024-11-09 23:56:48,978 INFO L226 Difference]: Without dead ends: 503 [2024-11-09 23:56:48,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:56:48,982 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 88 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:56:48,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 207 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:56:48,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-09 23:56:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2024-11-09 23:56:48,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.432) internal successors, (716), 500 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 716 transitions. [2024-11-09 23:56:48,998 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 716 transitions. Word has length 43 [2024-11-09 23:56:48,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:56:48,999 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 716 transitions. [2024-11-09 23:56:48,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:48,999 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 716 transitions. [2024-11-09 23:56:49,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 23:56:49,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:56:49,003 INFO L215 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] [2024-11-09 23:56:49,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:56:49,003 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:56:49,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:56:49,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1961815080, now seen corresponding path program 1 times [2024-11-09 23:56:49,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:56:49,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797580420] [2024-11-09 23:56:49,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:56:49,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:56:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:56:49,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:56:49,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:56:49,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797580420] [2024-11-09 23:56:49,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797580420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:56:49,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:56:49,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:56:49,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472348156] [2024-11-09 23:56:49,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:56:49,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:56:49,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:56:49,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:56:49,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:56:49,096 INFO L87 Difference]: Start difference. First operand 501 states and 716 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:56:49,116 INFO L93 Difference]: Finished difference Result 1208 states and 1737 transitions. [2024-11-09 23:56:49,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:56:49,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-11-09 23:56:49,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:56:49,119 INFO L225 Difference]: With dead ends: 1208 [2024-11-09 23:56:49,121 INFO L226 Difference]: Without dead ends: 726 [2024-11-09 23:56:49,122 INFO L431 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 [2024-11-09 23:56:49,123 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 37 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:56:49,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 163 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:56:49,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-11-09 23:56:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 724. [2024-11-09 23:56:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 1.4204702627939143) internal successors, (1027), 723 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:49,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1027 transitions. [2024-11-09 23:56:49,141 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1027 transitions. Word has length 45 [2024-11-09 23:56:49,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:56:49,142 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1027 transitions. [2024-11-09 23:56:49,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:49,142 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1027 transitions. [2024-11-09 23:56:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 23:56:49,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:56:49,145 INFO L215 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] [2024-11-09 23:56:49,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:56:49,145 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:56:49,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:56:49,146 INFO L85 PathProgramCache]: Analyzing trace with hash 95224292, now seen corresponding path program 1 times [2024-11-09 23:56:49,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:56:49,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846147647] [2024-11-09 23:56:49,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:56:49,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:56:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:56:49,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:56:49,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:56:49,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846147647] [2024-11-09 23:56:49,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846147647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:56:49,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:56:49,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:56:49,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050873784] [2024-11-09 23:56:49,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:56:49,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:56:49,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:56:49,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:56:49,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:56:49,457 INFO L87 Difference]: Start difference. First operand 724 states and 1027 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:49,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:56:49,486 INFO L93 Difference]: Finished difference Result 790 states and 1108 transitions. [2024-11-09 23:56:49,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:56:49,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-11-09 23:56:49,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:56:49,489 INFO L225 Difference]: With dead ends: 790 [2024-11-09 23:56:49,489 INFO L226 Difference]: Without dead ends: 788 [2024-11-09 23:56:49,490 INFO L431 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 [2024-11-09 23:56:49,493 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:56:49,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 320 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:56:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-11-09 23:56:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2024-11-09 23:56:49,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.3811944091486659) internal successors, (1087), 787 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:49,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1087 transitions. [2024-11-09 23:56:49,509 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1087 transitions. Word has length 46 [2024-11-09 23:56:49,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:56:49,510 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1087 transitions. [2024-11-09 23:56:49,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1087 transitions. [2024-11-09 23:56:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 23:56:49,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:56:49,512 INFO L215 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] [2024-11-09 23:56:49,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:56:49,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:56:49,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:56:49,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2067479107, now seen corresponding path program 1 times [2024-11-09 23:56:49,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:56:49,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054978984] [2024-11-09 23:56:49,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:56:49,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:56:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:56:49,674 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:56:49,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:56:49,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054978984] [2024-11-09 23:56:49,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054978984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:56:49,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:56:49,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:56:49,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398916776] [2024-11-09 23:56:49,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:56:49,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:56:49,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:56:49,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:56:49,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:56:49,677 INFO L87 Difference]: Start difference. First operand 788 states and 1087 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:49,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:56:49,749 INFO L93 Difference]: Finished difference Result 3036 states and 4195 transitions. [2024-11-09 23:56:49,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:56:49,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-09 23:56:49,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:56:49,760 INFO L225 Difference]: With dead ends: 3036 [2024-11-09 23:56:49,760 INFO L226 Difference]: Without dead ends: 2490 [2024-11-09 23:56:49,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:56:49,762 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 225 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:56:49,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 395 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:56:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2490 states. [2024-11-09 23:56:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2490 to 1448. [2024-11-09 23:56:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1447 states have (on average 1.3759502418797511) internal successors, (1991), 1447 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1991 transitions. [2024-11-09 23:56:49,801 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1991 transitions. Word has length 65 [2024-11-09 23:56:49,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:56:49,805 INFO L471 AbstractCegarLoop]: Abstraction has 1448 states and 1991 transitions. [2024-11-09 23:56:49,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1991 transitions. [2024-11-09 23:56:49,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 23:56:49,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:56:49,806 INFO L215 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] [2024-11-09 23:56:49,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:56:49,807 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:56:49,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:56:49,807 INFO L85 PathProgramCache]: Analyzing trace with hash -581586276, now seen corresponding path program 1 times [2024-11-09 23:56:49,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:56:49,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864266409] [2024-11-09 23:56:49,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:56:49,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:56:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:56:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 23:56:49,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:56:49,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864266409] [2024-11-09 23:56:49,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864266409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:56:49,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:56:49,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:56:49,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015644351] [2024-11-09 23:56:49,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:56:49,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:56:49,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:56:49,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:56:49,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:56:49,933 INFO L87 Difference]: Start difference. First operand 1448 states and 1991 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:50,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:56:50,010 INFO L93 Difference]: Finished difference Result 3800 states and 5251 transitions. [2024-11-09 23:56:50,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:56:50,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-09 23:56:50,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:56:50,021 INFO L225 Difference]: With dead ends: 3800 [2024-11-09 23:56:50,022 INFO L226 Difference]: Without dead ends: 3034 [2024-11-09 23:56:50,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:56:50,025 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 226 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:56:50,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 377 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:56:50,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states. [2024-11-09 23:56:50,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 2484. [2024-11-09 23:56:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2484 states, 2483 states have (on average 1.373741441804269) internal successors, (3411), 2483 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2484 states and 3411 transitions. [2024-11-09 23:56:50,080 INFO L78 Accepts]: Start accepts. Automaton has 2484 states and 3411 transitions. Word has length 65 [2024-11-09 23:56:50,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:56:50,081 INFO L471 AbstractCegarLoop]: Abstraction has 2484 states and 3411 transitions. [2024-11-09 23:56:50,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 3411 transitions. [2024-11-09 23:56:50,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 23:56:50,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:56:50,082 INFO L215 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] [2024-11-09 23:56:50,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:56:50,083 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:56:50,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:56:50,083 INFO L85 PathProgramCache]: Analyzing trace with hash -502824739, now seen corresponding path program 1 times [2024-11-09 23:56:50,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:56:50,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174496931] [2024-11-09 23:56:50,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:56:50,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:56:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:56:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 23:56:50,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:56:50,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174496931] [2024-11-09 23:56:50,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174496931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:56:50,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:56:50,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:56:50,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015565404] [2024-11-09 23:56:50,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:56:50,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:56:50,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:56:50,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:56:50,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:56:50,184 INFO L87 Difference]: Start difference. First operand 2484 states and 3411 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:56:50,268 INFO L93 Difference]: Finished difference Result 4564 states and 6303 transitions. [2024-11-09 23:56:50,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:56:50,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-09 23:56:50,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:56:50,280 INFO L225 Difference]: With dead ends: 4564 [2024-11-09 23:56:50,280 INFO L226 Difference]: Without dead ends: 3798 [2024-11-09 23:56:50,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:56:50,283 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 225 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:56:50,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 401 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:56:50,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2024-11-09 23:56:50,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3248. [2024-11-09 23:56:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3248 states, 3247 states have (on average 1.3744995380351093) internal successors, (4463), 3247 states have internal predecessors, (4463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 4463 transitions. [2024-11-09 23:56:50,361 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 4463 transitions. Word has length 65 [2024-11-09 23:56:50,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:56:50,362 INFO L471 AbstractCegarLoop]: Abstraction has 3248 states and 4463 transitions. [2024-11-09 23:56:50,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:50,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 4463 transitions. [2024-11-09 23:56:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 23:56:50,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:56:50,363 INFO L215 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] [2024-11-09 23:56:50,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:56:50,363 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:56:50,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:56:50,364 INFO L85 PathProgramCache]: Analyzing trace with hash 415509208, now seen corresponding path program 1 times [2024-11-09 23:56:50,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:56:50,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354278054] [2024-11-09 23:56:50,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:56:50,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:56:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:56:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:56:50,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:56:50,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354278054] [2024-11-09 23:56:50,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354278054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:56:50,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557897663] [2024-11-09 23:56:50,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:56:50,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:56:50,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:56:50,626 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) [2024-11-09 23:56:50,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:56:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:56:50,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 23:56:50,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:56:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:56:51,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:56:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:56:52,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557897663] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:56:52,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:56:52,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-09 23:56:52,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294767666] [2024-11-09 23:56:52,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:56:52,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 23:56:52,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:56:52,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 23:56:52,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:56:52,051 INFO L87 Difference]: Start difference. First operand 3248 states and 4463 transitions. Second operand has 23 states, 23 states have (on average 6.869565217391305) internal successors, (158), 22 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:52,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:56:52,844 INFO L93 Difference]: Finished difference Result 12964 states and 17966 transitions. [2024-11-09 23:56:52,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 23:56:52,844 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.869565217391305) internal successors, (158), 22 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-09 23:56:52,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:56:52,879 INFO L225 Difference]: With dead ends: 12964 [2024-11-09 23:56:52,880 INFO L226 Difference]: Without dead ends: 9738 [2024-11-09 23:56:52,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 23:56:52,889 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 595 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:56:52,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 523 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:56:52,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9738 states. [2024-11-09 23:56:53,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9738 to 7803. [2024-11-09 23:56:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7803 states, 7802 states have (on average 1.363496539348885) internal successors, (10638), 7802 states have internal predecessors, (10638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7803 states to 7803 states and 10638 transitions. [2024-11-09 23:56:53,073 INFO L78 Accepts]: Start accepts. Automaton has 7803 states and 10638 transitions. Word has length 67 [2024-11-09 23:56:53,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:56:53,074 INFO L471 AbstractCegarLoop]: Abstraction has 7803 states and 10638 transitions. [2024-11-09 23:56:53,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.869565217391305) internal successors, (158), 22 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:56:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 7803 states and 10638 transitions. [2024-11-09 23:56:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 23:56:53,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:56:53,076 INFO L215 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] [2024-11-09 23:56:53,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 23:56:53,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 23:56:53,281 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:56:53,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:56:53,281 INFO L85 PathProgramCache]: Analyzing trace with hash 494270745, now seen corresponding path program 1 times [2024-11-09 23:56:53,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:56:53,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123625575] [2024-11-09 23:56:53,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:56:53,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:56:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:56:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:56:53,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:56:53,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123625575] [2024-11-09 23:56:53,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123625575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:56:53,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111587499] [2024-11-09 23:56:53,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:56:53,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:56:53,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:56:53,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:56:53,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 23:56:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:56:53,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 23:56:53,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:56:54,653 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:56:54,653 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:56:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:56:55,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111587499] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:56:55,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:56:55,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2024-11-09 23:56:55,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956437922] [2024-11-09 23:56:55,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:56:55,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 23:56:55,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:56:55,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 23:56:55,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2024-11-09 23:56:55,311 INFO L87 Difference]: Start difference. First operand 7803 states and 10638 transitions. Second operand has 30 states, 30 states have (on average 6.266666666666667) internal successors, (188), 30 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:05,707 INFO L93 Difference]: Finished difference Result 49403 states and 67820 transitions. [2024-11-09 23:57:05,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2024-11-09 23:57:05,708 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.266666666666667) internal successors, (188), 30 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-09 23:57:05,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:05,798 INFO L225 Difference]: With dead ends: 49403 [2024-11-09 23:57:05,798 INFO L226 Difference]: Without dead ends: 41622 [2024-11-09 23:57:05,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21434 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=7988, Invalid=44682, Unknown=0, NotChecked=0, Total=52670 [2024-11-09 23:57:05,829 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 5181 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 2077 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5181 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 2142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:05,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5181 Valid, 1313 Invalid, 2142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2077 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 23:57:05,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41622 states. [2024-11-09 23:57:06,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41622 to 20473. [2024-11-09 23:57:06,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20473 states, 20472 states have (on average 1.3498925361469325) internal successors, (27635), 20472 states have internal predecessors, (27635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20473 states to 20473 states and 27635 transitions. [2024-11-09 23:57:06,334 INFO L78 Accepts]: Start accepts. Automaton has 20473 states and 27635 transitions. Word has length 67 [2024-11-09 23:57:06,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:06,335 INFO L471 AbstractCegarLoop]: Abstraction has 20473 states and 27635 transitions. [2024-11-09 23:57:06,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.266666666666667) internal successors, (188), 30 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 20473 states and 27635 transitions. [2024-11-09 23:57:06,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 23:57:06,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:06,338 INFO L215 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] [2024-11-09 23:57:06,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 23:57:06,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 23:57:06,539 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:06,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:06,540 INFO L85 PathProgramCache]: Analyzing trace with hash -827395713, now seen corresponding path program 1 times [2024-11-09 23:57:06,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:06,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195117582] [2024-11-09 23:57:06,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:06,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:07,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:07,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195117582] [2024-11-09 23:57:07,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195117582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:57:07,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001800974] [2024-11-09 23:57:07,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:07,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:57:07,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:57:07,346 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:57:07,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 23:57:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:07,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 23:57:07,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:57:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:10,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:57:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:12,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001800974] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:57:12,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:57:12,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 21] total 52 [2024-11-09 23:57:12,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113369660] [2024-11-09 23:57:12,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:57:12,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 23:57:12,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:12,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 23:57:12,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2362, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 23:57:12,908 INFO L87 Difference]: Start difference. First operand 20473 states and 27635 transitions. Second operand has 52 states, 52 states have (on average 3.576923076923077) internal successors, (186), 52 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)