./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.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.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8080e0a725fc4bb7ff7c553cf5cace8f3ab82ec5bf4c36129edf77f076dbcbd3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:58:44,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:58:44,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:58:44,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:58:44,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:58:44,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:58:44,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:58:44,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:58:44,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:58:44,386 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:58:44,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:58:44,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:58:44,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:58:44,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:58:44,390 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:58:44,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:58:44,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:58:44,391 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:58:44,391 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:58:44,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:58:44,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:58:44,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:58:44,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:58:44,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:58:44,396 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:58:44,396 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:58:44,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:58:44,397 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:58:44,397 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:58:44,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:58:44,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:58:44,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:58:44,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:58:44,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:58:44,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:58:44,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:58:44,401 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:58:44,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:58:44,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:58:44,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:58:44,402 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:58:44,402 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:58:44,402 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 -> 8080e0a725fc4bb7ff7c553cf5cace8f3ab82ec5bf4c36129edf77f076dbcbd3 [2024-11-09 23:58:44,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:58:44,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:58:44,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:58:44,718 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:58:44,719 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:58:44,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-09 23:58:46,144 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:58:46,361 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:58:46,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-09 23:58:46,373 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3230d483f/db786af4da3047678779bc856db513a0/FLAG4f3bbc2c3 [2024-11-09 23:58:46,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3230d483f/db786af4da3047678779bc856db513a0 [2024-11-09 23:58:46,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:58:46,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:58:46,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:58:46,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:58:46,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:58:46,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:58:46" (1/1) ... [2024-11-09 23:58:46,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b7cb71d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:46, skipping insertion in model container [2024-11-09 23:58:46,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:58:46" (1/1) ... [2024-11-09 23:58:46,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:58:46,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4940,4953] [2024-11-09 23:58:46,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:58:46,673 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:58:46,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4940,4953] [2024-11-09 23:58:46,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:58:46,752 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:58:46,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:46 WrapperNode [2024-11-09 23:58:46,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:58:46,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:58:46,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:58:46,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:58:46,760 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:58:46" (1/1) ... [2024-11-09 23:58:46,768 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:58:46" (1/1) ... [2024-11-09 23:58:46,797 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 370 [2024-11-09 23:58:46,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:58:46,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:58:46,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:58:46,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:58:46,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:46" (1/1) ... [2024-11-09 23:58:46,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:46" (1/1) ... [2024-11-09 23:58:46,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:46" (1/1) ... [2024-11-09 23:58:46,868 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:58:46,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:46" (1/1) ... [2024-11-09 23:58:46,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:46" (1/1) ... [2024-11-09 23:58:46,884 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:46" (1/1) ... [2024-11-09 23:58:46,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:46" (1/1) ... [2024-11-09 23:58:46,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:46" (1/1) ... [2024-11-09 23:58:46,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:46" (1/1) ... [2024-11-09 23:58:46,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:58:46,920 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:58:46,920 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:58:46,921 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:58:46,922 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:46" (1/1) ... [2024-11-09 23:58:46,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:58:46,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:58:46,967 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:58:46,974 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:58:47,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:58:47,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:58:47,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:58:47,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:58:47,150 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:58:47,152 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:58:47,513 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node4____CPAchecker_TMP_0~0#1; [2024-11-09 23:58:47,514 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L201: havoc main_~node4__m4~0#1;havoc main_~node3__m3~0#1; [2024-11-09 23:58:47,514 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L201: havoc main_~node4__m4~0#1;havoc main_~node3__m3~0#1; [2024-11-09 23:58:47,514 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L201: havoc main_~node4__m4~0#1;havoc main_~node3__m3~0#1; [2024-11-09 23:58:47,514 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L449: havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-09 23:58:47,514 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L88: havoc main_~init__tmp~0#1; [2024-11-09 23:58:47,514 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L171: havoc main_~node2__m2~0#1;havoc main_~node1__m1~0#1; [2024-11-09 23:58:47,514 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L171: havoc main_~node2__m2~0#1;havoc main_~node1__m1~0#1; [2024-11-09 23:58:47,515 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L171: havoc main_~node2__m2~0#1;havoc main_~node1__m1~0#1; [2024-11-09 23:58:47,515 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L171: havoc main_~node2__m2~0#1;havoc main_~node1__m1~0#1; [2024-11-09 23:58:47,515 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L353: havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-09 23:58:47,515 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L239: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:58:47,515 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L239: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:58:47,515 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L239: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:58:47,515 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L239: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:58:47,515 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L239: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:58:47,516 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L398: havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-09 23:58:47,551 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-09 23:58:47,551 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:58:47,570 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:58:47,572 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:58:47,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:58:47 BoogieIcfgContainer [2024-11-09 23:58:47,574 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:58:47,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:58:47,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:58:47,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:58:47,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:58:46" (1/3) ... [2024-11-09 23:58:47,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416fe09d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:58:47, skipping insertion in model container [2024-11-09 23:58:47,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:46" (2/3) ... [2024-11-09 23:58:47,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416fe09d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:58:47, skipping insertion in model container [2024-11-09 23:58:47,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:58:47" (3/3) ... [2024-11-09 23:58:47,586 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-09 23:58:47,606 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:58:47,606 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:58:47,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:58:47,672 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;@3346d470, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:58:47,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:58:47,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 83 states have (on average 1.6746987951807228) internal successors, (139), 84 states have internal predecessors, (139), 0 states have call successors, (0), 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:58:47,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 23:58:47,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:47,688 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, 1, 1] [2024-11-09 23:58:47,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:47,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:47,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1414520674, now seen corresponding path program 1 times [2024-11-09 23:58:47,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:47,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953962854] [2024-11-09 23:58:47,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:47,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:48,168 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:58:48,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:48,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953962854] [2024-11-09 23:58:48,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953962854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:48,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:48,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:58:48,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550891918] [2024-11-09 23:58:48,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:48,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:58:48,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:48,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:58:48,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:58:48,210 INFO L87 Difference]: Start difference. First operand has 85 states, 83 states have (on average 1.6746987951807228) internal successors, (139), 84 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:48,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:48,277 INFO L93 Difference]: Finished difference Result 193 states and 302 transitions. [2024-11-09 23:58:48,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:58:48,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-09 23:58:48,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:48,293 INFO L225 Difference]: With dead ends: 193 [2024-11-09 23:58:48,293 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 23:58:48,297 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:58:48,302 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 87 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 282 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:58:48,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 282 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:58:48,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 23:58:48,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2024-11-09 23:58:48,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.448) internal successors, (181), 125 states have internal predecessors, (181), 0 states have call successors, (0), 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:58:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 181 transitions. [2024-11-09 23:58:48,348 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 181 transitions. Word has length 48 [2024-11-09 23:58:48,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:48,349 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 181 transitions. [2024-11-09 23:58:48,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 181 transitions. [2024-11-09 23:58:48,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 23:58:48,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:48,351 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, 1, 1, 1] [2024-11-09 23:58:48,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:58:48,352 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:48,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:48,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1853359873, now seen corresponding path program 1 times [2024-11-09 23:58:48,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:48,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212908254] [2024-11-09 23:58:48,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:48,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:48,522 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:58:48,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:48,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212908254] [2024-11-09 23:58:48,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212908254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:48,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:48,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:58:48,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764200848] [2024-11-09 23:58:48,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:48,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:58:48,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:48,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:58:48,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:58:48,527 INFO L87 Difference]: Start difference. First operand 126 states and 181 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:48,572 INFO L93 Difference]: Finished difference Result 310 states and 465 transitions. [2024-11-09 23:58:48,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:58:48,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-09 23:58:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:48,575 INFO L225 Difference]: With dead ends: 310 [2024-11-09 23:58:48,575 INFO L226 Difference]: Without dead ends: 210 [2024-11-09 23:58:48,576 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:58:48,577 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 65 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 240 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:58:48,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 240 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:58:48,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-09 23:58:48,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2024-11-09 23:58:48,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.4830917874396135) internal successors, (307), 207 states have internal predecessors, (307), 0 states have call successors, (0), 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:58:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 307 transitions. [2024-11-09 23:58:48,598 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 307 transitions. Word has length 49 [2024-11-09 23:58:48,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:48,600 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 307 transitions. [2024-11-09 23:58:48,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 307 transitions. [2024-11-09 23:58:48,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 23:58:48,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:48,602 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, 1, 1, 1, 1] [2024-11-09 23:58:48,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:58:48,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:48,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:48,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1998449587, now seen corresponding path program 1 times [2024-11-09 23:58:48,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:48,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037482346] [2024-11-09 23:58:48,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:48,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:48,725 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:58:48,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:48,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037482346] [2024-11-09 23:58:48,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037482346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:48,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:48,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:58:48,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945653583] [2024-11-09 23:58:48,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:48,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:58:48,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:48,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:58:48,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:58:48,732 INFO L87 Difference]: Start difference. First operand 208 states and 307 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:48,755 INFO L93 Difference]: Finished difference Result 540 states and 817 transitions. [2024-11-09 23:58:48,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:58:48,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-09 23:58:48,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:48,759 INFO L225 Difference]: With dead ends: 540 [2024-11-09 23:58:48,759 INFO L226 Difference]: Without dead ends: 358 [2024-11-09 23:58:48,760 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:58:48,761 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 60 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 236 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:58:48,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 236 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:58:48,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-09 23:58:48,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2024-11-09 23:58:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 1.495774647887324) internal successors, (531), 355 states have internal predecessors, (531), 0 states have call successors, (0), 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:58:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 531 transitions. [2024-11-09 23:58:48,789 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 531 transitions. Word has length 50 [2024-11-09 23:58:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:48,790 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 531 transitions. [2024-11-09 23:58:48,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 531 transitions. [2024-11-09 23:58:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 23:58:48,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:48,791 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, 1, 1, 1, 1, 1] [2024-11-09 23:58:48,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:58:48,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:48,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:48,795 INFO L85 PathProgramCache]: Analyzing trace with hash -36967571, now seen corresponding path program 1 times [2024-11-09 23:58:48,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:48,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269591692] [2024-11-09 23:58:48,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:48,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:49,014 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:58:49,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:49,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269591692] [2024-11-09 23:58:49,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269591692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:49,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:49,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:58:49,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423458864] [2024-11-09 23:58:49,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:49,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:58:49,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:49,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:58:49,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:58:49,017 INFO L87 Difference]: Start difference. First operand 356 states and 531 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:49,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:49,246 INFO L93 Difference]: Finished difference Result 2996 states and 4571 transitions. [2024-11-09 23:58:49,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:58:49,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-09 23:58:49,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:49,260 INFO L225 Difference]: With dead ends: 2996 [2024-11-09 23:58:49,260 INFO L226 Difference]: Without dead ends: 2666 [2024-11-09 23:58:49,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:58:49,267 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 663 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:49,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 1328 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:58:49,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2024-11-09 23:58:49,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 684. [2024-11-09 23:58:49,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.4919472913616398) internal successors, (1019), 683 states have internal predecessors, (1019), 0 states have call successors, (0), 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:58:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1019 transitions. [2024-11-09 23:58:49,330 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1019 transitions. Word has length 51 [2024-11-09 23:58:49,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:49,330 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1019 transitions. [2024-11-09 23:58:49,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1019 transitions. [2024-11-09 23:58:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 23:58:49,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:49,335 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:49,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:58:49,336 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:49,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:49,336 INFO L85 PathProgramCache]: Analyzing trace with hash -371511366, now seen corresponding path program 1 times [2024-11-09 23:58:49,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:49,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475510613] [2024-11-09 23:58:49,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:49,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:49,645 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:58:49,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:49,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475510613] [2024-11-09 23:58:49,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475510613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:49,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:49,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:58:49,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143343836] [2024-11-09 23:58:49,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:49,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:58:49,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:49,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:58:49,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:58:49,650 INFO L87 Difference]: Start difference. First operand 684 states and 1019 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:49,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:49,781 INFO L93 Difference]: Finished difference Result 1344 states and 2013 transitions. [2024-11-09 23:58:49,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:58:49,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-09 23:58:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:49,788 INFO L225 Difference]: With dead ends: 1344 [2024-11-09 23:58:49,788 INFO L226 Difference]: Without dead ends: 686 [2024-11-09 23:58:49,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:58:49,791 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 122 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:49,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 382 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:58:49,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-11-09 23:58:49,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 684. [2024-11-09 23:58:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.4802342606149341) internal successors, (1011), 683 states have internal predecessors, (1011), 0 states have call successors, (0), 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:58:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1011 transitions. [2024-11-09 23:58:49,813 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1011 transitions. Word has length 54 [2024-11-09 23:58:49,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:49,814 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1011 transitions. [2024-11-09 23:58:49,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1011 transitions. [2024-11-09 23:58:49,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 23:58:49,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:49,816 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:49,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:58:49,817 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:49,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:49,818 INFO L85 PathProgramCache]: Analyzing trace with hash -832363696, now seen corresponding path program 1 times [2024-11-09 23:58:49,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:49,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621399170] [2024-11-09 23:58:49,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:49,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:49,931 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:58:49,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:49,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621399170] [2024-11-09 23:58:49,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621399170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:49,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:49,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:58:49,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014509875] [2024-11-09 23:58:49,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:49,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:58:49,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:49,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:58:49,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:58:49,933 INFO L87 Difference]: Start difference. First operand 684 states and 1011 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:49,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:49,958 INFO L93 Difference]: Finished difference Result 1840 states and 2725 transitions. [2024-11-09 23:58:49,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:58:49,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-09 23:58:49,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:49,964 INFO L225 Difference]: With dead ends: 1840 [2024-11-09 23:58:49,964 INFO L226 Difference]: Without dead ends: 1182 [2024-11-09 23:58:49,965 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:58:49,968 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 72 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 256 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:58:49,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 256 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:58:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-11-09 23:58:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1180. [2024-11-09 23:58:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1179 states have (on average 1.4614079728583544) internal successors, (1723), 1179 states have internal predecessors, (1723), 0 states have call successors, (0), 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:58:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1723 transitions. [2024-11-09 23:58:49,993 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1723 transitions. Word has length 54 [2024-11-09 23:58:49,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:49,993 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1723 transitions. [2024-11-09 23:58:49,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1723 transitions. [2024-11-09 23:58:49,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 23:58:49,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:49,998 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:49,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:58:49,998 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:49,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:49,999 INFO L85 PathProgramCache]: Analyzing trace with hash -591292265, now seen corresponding path program 1 times [2024-11-09 23:58:49,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:49,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105797710] [2024-11-09 23:58:49,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:49,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:50,090 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:58:50,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:50,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105797710] [2024-11-09 23:58:50,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105797710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:50,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:50,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:58:50,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104867071] [2024-11-09 23:58:50,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:50,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:58:50,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:50,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:58:50,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:58:50,092 INFO L87 Difference]: Start difference. First operand 1180 states and 1723 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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:58:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:50,124 INFO L93 Difference]: Finished difference Result 2890 states and 4239 transitions. [2024-11-09 23:58:50,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:58:50,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-09 23:58:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:50,130 INFO L225 Difference]: With dead ends: 2890 [2024-11-09 23:58:50,130 INFO L226 Difference]: Without dead ends: 1736 [2024-11-09 23:58:50,132 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:58:50,133 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:50,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:58:50,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2024-11-09 23:58:50,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1718. [2024-11-09 23:58:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1717 states have (on average 1.4472917880023297) internal successors, (2485), 1717 states have internal predecessors, (2485), 0 states have call successors, (0), 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:58:50,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2485 transitions. [2024-11-09 23:58:50,167 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2485 transitions. Word has length 56 [2024-11-09 23:58:50,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:50,169 INFO L471 AbstractCegarLoop]: Abstraction has 1718 states and 2485 transitions. [2024-11-09 23:58:50,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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:58:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2485 transitions. [2024-11-09 23:58:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 23:58:50,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:50,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:50,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:58:50,171 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:50,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1741692136, now seen corresponding path program 1 times [2024-11-09 23:58:50,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:50,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780700194] [2024-11-09 23:58:50,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:50,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:50,487 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:58:50,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:50,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780700194] [2024-11-09 23:58:50,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780700194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:50,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:50,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:58:50,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552256682] [2024-11-09 23:58:50,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:50,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:58:50,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:50,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:58:50,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:58:50,492 INFO L87 Difference]: Start difference. First operand 1718 states and 2485 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:50,525 INFO L93 Difference]: Finished difference Result 1848 states and 2646 transitions. [2024-11-09 23:58:50,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:58:50,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-09 23:58:50,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:50,533 INFO L225 Difference]: With dead ends: 1848 [2024-11-09 23:58:50,533 INFO L226 Difference]: Without dead ends: 1846 [2024-11-09 23:58:50,534 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:58:50,535 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:50,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:58:50,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2024-11-09 23:58:50,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1846. [2024-11-09 23:58:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1845 states have (on average 1.4119241192411924) internal successors, (2605), 1845 states have internal predecessors, (2605), 0 states have call successors, (0), 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:58:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2605 transitions. [2024-11-09 23:58:50,590 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2605 transitions. Word has length 57 [2024-11-09 23:58:50,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:50,590 INFO L471 AbstractCegarLoop]: Abstraction has 1846 states and 2605 transitions. [2024-11-09 23:58:50,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2605 transitions. [2024-11-09 23:58:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 23:58:50,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:50,594 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:50,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:58:50,595 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:50,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:50,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2125361846, now seen corresponding path program 1 times [2024-11-09 23:58:50,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:50,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672573174] [2024-11-09 23:58:50,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:50,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 23:58:50,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:50,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672573174] [2024-11-09 23:58:50,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672573174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:50,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:50,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:58:50,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846250775] [2024-11-09 23:58:50,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:50,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:58:50,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:50,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:58:50,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:58:50,758 INFO L87 Difference]: Start difference. First operand 1846 states and 2605 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:50,905 INFO L93 Difference]: Finished difference Result 9504 states and 13426 transitions. [2024-11-09 23:58:50,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:58:50,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-09 23:58:50,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:50,932 INFO L225 Difference]: With dead ends: 9504 [2024-11-09 23:58:50,932 INFO L226 Difference]: Without dead ends: 7686 [2024-11-09 23:58:50,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:58:50,938 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 473 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:50,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 680 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:58:50,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7686 states. [2024-11-09 23:58:51,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7686 to 3662. [2024-11-09 23:58:51,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3662 states, 3661 states have (on average 1.408631521442229) internal successors, (5157), 3661 states have internal predecessors, (5157), 0 states have call successors, (0), 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:58:51,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 5157 transitions. [2024-11-09 23:58:51,046 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 5157 transitions. Word has length 80 [2024-11-09 23:58:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:51,047 INFO L471 AbstractCegarLoop]: Abstraction has 3662 states and 5157 transitions. [2024-11-09 23:58:51,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 5157 transitions. [2024-11-09 23:58:51,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 23:58:51,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:51,049 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:51,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:58:51,049 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:51,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:51,049 INFO L85 PathProgramCache]: Analyzing trace with hash -683712619, now seen corresponding path program 1 times [2024-11-09 23:58:51,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:51,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406858077] [2024-11-09 23:58:51,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:51,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 23:58:51,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:51,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406858077] [2024-11-09 23:58:51,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406858077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:51,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:51,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:58:51,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21660068] [2024-11-09 23:58:51,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:51,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:58:51,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:51,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:58:51,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:58:51,185 INFO L87 Difference]: Start difference. First operand 3662 states and 5157 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:51,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:51,329 INFO L93 Difference]: Finished difference Result 11320 states and 15978 transitions. [2024-11-09 23:58:51,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:58:51,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-09 23:58:51,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:51,366 INFO L225 Difference]: With dead ends: 11320 [2024-11-09 23:58:51,370 INFO L226 Difference]: Without dead ends: 9502 [2024-11-09 23:58:51,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:58:51,377 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 506 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:51,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 623 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:58:51,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9502 states. [2024-11-09 23:58:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9502 to 6398. [2024-11-09 23:58:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6398 states, 6397 states have (on average 1.402688760356417) internal successors, (8973), 6397 states have internal predecessors, (8973), 0 states have call successors, (0), 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:58:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6398 states to 6398 states and 8973 transitions. [2024-11-09 23:58:51,548 INFO L78 Accepts]: Start accepts. Automaton has 6398 states and 8973 transitions. Word has length 80 [2024-11-09 23:58:51,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:51,549 INFO L471 AbstractCegarLoop]: Abstraction has 6398 states and 8973 transitions. [2024-11-09 23:58:51,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand 6398 states and 8973 transitions. [2024-11-09 23:58:51,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 23:58:51,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:51,551 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:51,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:58:51,551 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:51,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:51,552 INFO L85 PathProgramCache]: Analyzing trace with hash -604951082, now seen corresponding path program 1 times [2024-11-09 23:58:51,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:51,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694341834] [2024-11-09 23:58:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:51,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 23:58:51,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:51,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694341834] [2024-11-09 23:58:51,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694341834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:51,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:51,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:58:51,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423886384] [2024-11-09 23:58:51,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:51,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:58:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:51,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:58:51,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:58:51,682 INFO L87 Difference]: Start difference. First operand 6398 states and 8973 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:51,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:51,825 INFO L93 Difference]: Finished difference Result 13136 states and 18530 transitions. [2024-11-09 23:58:51,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:58:51,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-09 23:58:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:51,846 INFO L225 Difference]: With dead ends: 13136 [2024-11-09 23:58:51,846 INFO L226 Difference]: Without dead ends: 11318 [2024-11-09 23:58:51,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:58:51,853 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 483 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:51,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 655 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:58:51,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11318 states. [2024-11-09 23:58:51,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11318 to 8214. [2024-11-09 23:58:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8214 states, 8213 states have (on average 1.4032631194447827) internal successors, (11525), 8213 states have internal predecessors, (11525), 0 states have call successors, (0), 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:58:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8214 states to 8214 states and 11525 transitions. [2024-11-09 23:58:51,995 INFO L78 Accepts]: Start accepts. Automaton has 8214 states and 11525 transitions. Word has length 80 [2024-11-09 23:58:51,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:51,996 INFO L471 AbstractCegarLoop]: Abstraction has 8214 states and 11525 transitions. [2024-11-09 23:58:51,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:51,996 INFO L276 IsEmpty]: Start isEmpty. Operand 8214 states and 11525 transitions. [2024-11-09 23:58:51,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 23:58:51,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:51,998 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:51,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:58:51,998 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:51,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:51,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1748398439, now seen corresponding path program 1 times [2024-11-09 23:58:51,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:51,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957160122] [2024-11-09 23:58:51,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:51,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 23:58:52,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:52,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957160122] [2024-11-09 23:58:52,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957160122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:52,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:52,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:58:52,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025437100] [2024-11-09 23:58:52,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:52,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:58:52,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:52,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:58:52,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:58:52,165 INFO L87 Difference]: Start difference. First operand 8214 states and 11525 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:52,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:52,307 INFO L93 Difference]: Finished difference Result 13880 states and 19578 transitions. [2024-11-09 23:58:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:58:52,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-09 23:58:52,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:52,335 INFO L225 Difference]: With dead ends: 13880 [2024-11-09 23:58:52,336 INFO L226 Difference]: Without dead ends: 12598 [2024-11-09 23:58:52,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:58:52,343 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 470 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:52,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 743 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:58:52,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12598 states. [2024-11-09 23:58:52,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12598 to 9494. [2024-11-09 23:58:52,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9494 states, 9493 states have (on average 1.4045085852733594) internal successors, (13333), 9493 states have internal predecessors, (13333), 0 states have call successors, (0), 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:58:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9494 states to 9494 states and 13333 transitions. [2024-11-09 23:58:52,606 INFO L78 Accepts]: Start accepts. Automaton has 9494 states and 13333 transitions. Word has length 81 [2024-11-09 23:58:52,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:52,606 INFO L471 AbstractCegarLoop]: Abstraction has 9494 states and 13333 transitions. [2024-11-09 23:58:52,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 9494 states and 13333 transitions. [2024-11-09 23:58:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 23:58:52,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:52,609 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:52,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:58:52,609 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:52,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:52,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1056339441, now seen corresponding path program 1 times [2024-11-09 23:58:52,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:52,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930087149] [2024-11-09 23:58:52,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:52,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:52,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:52,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930087149] [2024-11-09 23:58:52,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930087149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:52,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:52,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:58:52,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682414278] [2024-11-09 23:58:52,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:52,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:58:52,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:52,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:58:52,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:58:52,720 INFO L87 Difference]: Start difference. First operand 9494 states and 13333 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:52,767 INFO L93 Difference]: Finished difference Result 16573 states and 23323 transitions. [2024-11-09 23:58:52,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:58:52,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-09 23:58:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:52,781 INFO L225 Difference]: With dead ends: 16573 [2024-11-09 23:58:52,781 INFO L226 Difference]: Without dead ends: 7107 [2024-11-09 23:58:52,793 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:58:52,794 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 51 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:52,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 238 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:58:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7107 states. [2024-11-09 23:58:52,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7107 to 7105. [2024-11-09 23:58:52,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7105 states, 7104 states have (on average 1.3975225225225225) internal successors, (9928), 7104 states have internal predecessors, (9928), 0 states have call successors, (0), 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:58:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 9928 transitions. [2024-11-09 23:58:52,972 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 9928 transitions. Word has length 82 [2024-11-09 23:58:52,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:52,972 INFO L471 AbstractCegarLoop]: Abstraction has 7105 states and 9928 transitions. [2024-11-09 23:58:52,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 9928 transitions. [2024-11-09 23:58:52,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 23:58:52,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:52,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:52,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:58:52,976 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:52,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1914134653, now seen corresponding path program 1 times [2024-11-09 23:58:52,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:52,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198827893] [2024-11-09 23:58:52,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:53,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:53,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198827893] [2024-11-09 23:58:53,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198827893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:58:53,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957816382] [2024-11-09 23:58:53,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:53,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:58:53,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:58:53,333 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:58:53,335 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:58:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:53,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 23:58:53,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:58:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:55,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:58:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:55,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957816382] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:58:55,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:58:55,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2024-11-09 23:58:55,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345675853] [2024-11-09 23:58:55,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:58:55,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 23:58:55,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:55,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 23:58:55,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2024-11-09 23:58:55,874 INFO L87 Difference]: Start difference. First operand 7105 states and 9928 transitions. Second operand has 30 states, 30 states have (on average 7.466666666666667) internal successors, (224), 30 states have internal predecessors, (224), 0 states have call successors, (0), 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:59:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:06,061 INFO L93 Difference]: Finished difference Result 109256 states and 154230 transitions. [2024-11-09 23:59:06,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2024-11-09 23:59:06,061 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.466666666666667) internal successors, (224), 30 states have internal predecessors, (224), 0 states have call successors, (0), 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 83 [2024-11-09 23:59:06,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:06,260 INFO L225 Difference]: With dead ends: 109256 [2024-11-09 23:59:06,261 INFO L226 Difference]: Without dead ends: 102181 [2024-11-09 23:59:06,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19196 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=6164, Invalid=43342, Unknown=0, NotChecked=0, Total=49506 [2024-11-09 23:59:06,304 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 12055 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 2622 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12055 SdHoareTripleChecker+Valid, 2029 SdHoareTripleChecker+Invalid, 2724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:06,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12055 Valid, 2029 Invalid, 2724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2622 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 23:59:06,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102181 states. [2024-11-09 23:59:07,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102181 to 62959. [2024-11-09 23:59:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62959 states, 62958 states have (on average 1.3783951205565614) internal successors, (86781), 62958 states have internal predecessors, (86781), 0 states have call successors, (0), 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:59:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62959 states to 62959 states and 86781 transitions. [2024-11-09 23:59:08,182 INFO L78 Accepts]: Start accepts. Automaton has 62959 states and 86781 transitions. Word has length 83 [2024-11-09 23:59:08,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:08,183 INFO L471 AbstractCegarLoop]: Abstraction has 62959 states and 86781 transitions. [2024-11-09 23:59:08,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.466666666666667) internal successors, (224), 30 states have internal predecessors, (224), 0 states have call successors, (0), 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:59:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 62959 states and 86781 transitions. [2024-11-09 23:59:08,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 23:59:08,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:08,195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:59:08,232 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:59:08,395 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,SelfDestructingSolverStorable13 [2024-11-09 23:59:08,396 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:08,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:08,396 INFO L85 PathProgramCache]: Analyzing trace with hash 144870613, now seen corresponding path program 1 times [2024-11-09 23:59:08,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:08,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383448762] [2024-11-09 23:59:08,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:08,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:08,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:08,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383448762] [2024-11-09 23:59:08,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383448762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:59:08,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029777371] [2024-11-09 23:59:08,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:08,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:59:08,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:59:08,918 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:59:08,919 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:59:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:09,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 23:59:09,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:59:09,490 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:09,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:59:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:10,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029777371] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:59:10,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:59:10,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-09 23:59:10,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248123208] [2024-11-09 23:59:10,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:59:10,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 23:59:10,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:10,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 23:59:10,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-11-09 23:59:10,155 INFO L87 Difference]: Start difference. First operand 62959 states and 86781 transitions. Second operand has 21 states, 21 states have (on average 9.571428571428571) internal successors, (201), 20 states have internal predecessors, (201), 0 states have call successors, (0), 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:59:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:11,712 INFO L93 Difference]: Finished difference Result 311775 states and 431133 transitions. [2024-11-09 23:59:11,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 23:59:11,713 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.571428571428571) internal successors, (201), 20 states have internal predecessors, (201), 0 states have call successors, (0), 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 84 [2024-11-09 23:59:11,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:12,423 INFO L225 Difference]: With dead ends: 311775 [2024-11-09 23:59:12,424 INFO L226 Difference]: Without dead ends: 248879 [2024-11-09 23:59:12,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=428, Invalid=1294, Unknown=0, NotChecked=0, Total=1722 [2024-11-09 23:59:12,605 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 1583 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:12,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 591 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:59:12,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248879 states. [2024-11-09 23:59:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248879 to 151336. [2024-11-09 23:59:15,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151336 states, 151335 states have (on average 1.367945286946179) internal successors, (207018), 151335 states have internal predecessors, (207018), 0 states have call successors, (0), 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:59:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151336 states to 151336 states and 207018 transitions. [2024-11-09 23:59:15,766 INFO L78 Accepts]: Start accepts. Automaton has 151336 states and 207018 transitions. Word has length 84 [2024-11-09 23:59:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:15,766 INFO L471 AbstractCegarLoop]: Abstraction has 151336 states and 207018 transitions. [2024-11-09 23:59:15,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.571428571428571) internal successors, (201), 20 states have internal predecessors, (201), 0 states have call successors, (0), 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:59:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 151336 states and 207018 transitions. [2024-11-09 23:59:15,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 23:59:15,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:15,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:59:15,795 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:59:15,973 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,SelfDestructingSolverStorable14 [2024-11-09 23:59:15,974 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:15,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:15,975 INFO L85 PathProgramCache]: Analyzing trace with hash 550958412, now seen corresponding path program 1 times [2024-11-09 23:59:15,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:15,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156010240] [2024-11-09 23:59:15,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:15,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:16,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:16,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156010240] [2024-11-09 23:59:16,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156010240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:59:16,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053150031] [2024-11-09 23:59:16,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:16,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:59:16,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:59:16,284 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:59:16,285 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:59:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:16,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 23:59:16,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:59:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:20,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:59:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:21,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053150031] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:59:21,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:59:21,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 24, 22] total 52 [2024-11-09 23:59:21,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114005217] [2024-11-09 23:59:21,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:59:21,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 23:59:21,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:21,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 23:59:21,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2370, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 23:59:21,928 INFO L87 Difference]: Start difference. First operand 151336 states and 207018 transitions. Second operand has 52 states, 52 states have (on average 4.480769230769231) internal successors, (233), 52 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)