./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.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.8.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 e4ea09104fdfc6025836c8ea5917b899069d556f85aa19eff5395187d58ecb3d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:04:39,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:04:39,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:04:39,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:04:39,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:04:39,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:04:39,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:04:39,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:04:39,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:04:39,872 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:04:39,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:04:39,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:04:39,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:04:39,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:04:39,874 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:04:39,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:04:39,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:04:39,875 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:04:39,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:04:39,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:04:39,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:04:39,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:04:39,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:04:39,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:04:39,884 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:04:39,884 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:04:39,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:04:39,885 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:04:39,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:04:39,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:04:39,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:04:39,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:04:39,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:04:39,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:04:39,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:04:39,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:04:39,890 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:04:39,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:04:39,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:04:39,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:04:39,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:04:39,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:04:39,892 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 -> e4ea09104fdfc6025836c8ea5917b899069d556f85aa19eff5395187d58ecb3d [2024-11-10 00:04:40,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:04:40,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:04:40,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:04:40,249 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:04:40,250 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:04:40,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-10 00:04:41,835 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:04:42,069 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:04:42,070 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-10 00:04:42,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a708c2150/e2cd3922fa894ca4a4de934a07a6aa84/FLAG561f4ce2e [2024-11-10 00:04:42,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a708c2150/e2cd3922fa894ca4a4de934a07a6aa84 [2024-11-10 00:04:42,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:04:42,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:04:42,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:04:42,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:04:42,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:04:42,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:04:42" (1/1) ... [2024-11-10 00:04:42,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b193dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:42, skipping insertion in model container [2024-11-10 00:04:42,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:04:42" (1/1) ... [2024-11-10 00:04:42,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:04:42,786 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.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[8640,8653] [2024-11-10 00:04:42,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:04:42,860 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:04:42,914 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.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[8640,8653] [2024-11-10 00:04:42,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:04:42,968 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:04:42,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:42 WrapperNode [2024-11-10 00:04:42,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:04:42,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:04:42,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:04:42,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:04:42,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:42" (1/1) ... [2024-11-10 00:04:42,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:42" (1/1) ... [2024-11-10 00:04:43,026 INFO L138 Inliner]: procedures = 28, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 716 [2024-11-10 00:04:43,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:04:43,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:04:43,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:04:43,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:04:43,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:42" (1/1) ... [2024-11-10 00:04:43,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:42" (1/1) ... [2024-11-10 00:04:43,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:42" (1/1) ... [2024-11-10 00:04:43,078 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-10 00:04:43,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:42" (1/1) ... [2024-11-10 00:04:43,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:42" (1/1) ... [2024-11-10 00:04:43,097 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:42" (1/1) ... [2024-11-10 00:04:43,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:42" (1/1) ... [2024-11-10 00:04:43,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:42" (1/1) ... [2024-11-10 00:04:43,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:42" (1/1) ... [2024-11-10 00:04:43,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:04:43,121 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:04:43,122 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:04:43,122 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:04:43,123 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:42" (1/1) ... [2024-11-10 00:04:43,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:04:43,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:04:43,166 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-10 00:04:43,171 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-10 00:04:43,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:04:43,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:04:43,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:04:43,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:04:43,427 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:04:43,433 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:04:44,102 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L333: havoc main_~node4__m4~0#1;havoc main_~node3__m3~0#1; [2024-11-10 00:04:44,103 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L333: havoc main_~node4__m4~0#1;havoc main_~node3__m3~0#1; [2024-11-10 00:04:44,103 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L333: havoc main_~node4__m4~0#1;havoc main_~node3__m3~0#1; [2024-11-10 00:04:44,103 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L829: havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-10 00:04:44,104 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L598: havoc main_~node6____CPAchecker_TMP_0~0#1; [2024-11-10 00:04:44,104 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L136: havoc main_~init__tmp~0#1; [2024-11-10 00:04:44,104 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L303: havoc main_~node2__m2~0#1;havoc main_~node1__m1~0#1; [2024-11-10 00:04:44,106 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L303: havoc main_~node2__m2~0#1;havoc main_~node1__m1~0#1; [2024-11-10 00:04:44,106 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L303: havoc main_~node2__m2~0#1;havoc main_~node1__m1~0#1; [2024-11-10 00:04:44,106 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L303: havoc main_~node2__m2~0#1;havoc main_~node1__m1~0#1; [2024-11-10 00:04:44,106 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-10 00:04:44,106 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc main_~node7____CPAchecker_TMP_0~0#1; [2024-11-10 00:04:44,107 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L439: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:04:44,107 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L439: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:04:44,107 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L439: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:04:44,107 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L439: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:04:44,107 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L439: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:04:44,107 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L688: havoc main_~node4____CPAchecker_TMP_0~0#1; [2024-11-10 00:04:44,107 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L508: havoc main_~node8____CPAchecker_TMP_0~0#1; [2024-11-10 00:04:44,107 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L393: havoc main_~node8__m8~0#1;havoc main_~node7__m7~0#1; [2024-11-10 00:04:44,107 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L393: havoc main_~node8__m8~0#1;havoc main_~node7__m7~0#1; [2024-11-10 00:04:44,107 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L393: havoc main_~node8__m8~0#1;havoc main_~node7__m7~0#1; [2024-11-10 00:04:44,108 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L643: havoc main_~node5____CPAchecker_TMP_0~0#1; [2024-11-10 00:04:44,108 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L363: havoc main_~node6__m6~0#1;havoc main_~node5__m5~0#1; [2024-11-10 00:04:44,108 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L363: havoc main_~node6__m6~0#1;havoc main_~node5__m5~0#1; [2024-11-10 00:04:44,108 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L363: havoc main_~node6__m6~0#1;havoc main_~node5__m5~0#1; [2024-11-10 00:04:44,108 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L778: havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-10 00:04:44,153 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-10 00:04:44,153 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:04:44,171 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:04:44,171 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:04:44,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:04:44 BoogieIcfgContainer [2024-11-10 00:04:44,172 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:04:44,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:04:44,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:04:44,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:04:44,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:04:42" (1/3) ... [2024-11-10 00:04:44,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538da53e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:04:44, skipping insertion in model container [2024-11-10 00:04:44,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:42" (2/3) ... [2024-11-10 00:04:44,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538da53e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:04:44, skipping insertion in model container [2024-11-10 00:04:44,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:04:44" (3/3) ... [2024-11-10 00:04:44,184 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-10 00:04:44,201 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:04:44,201 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 00:04:44,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:04:44,283 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;@1d4a088b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:04:44,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 00:04:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 161 states have (on average 1.7329192546583851) internal successors, (279), 162 states have internal predecessors, (279), 0 states have call successors, (0), 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-10 00:04:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 00:04:44,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:44,304 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:04:44,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:44,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:44,311 INFO L85 PathProgramCache]: Analyzing trace with hash 676558879, now seen corresponding path program 1 times [2024-11-10 00:04:44,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:44,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416167604] [2024-11-10 00:04:44,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:44,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:45,010 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-10 00:04:45,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:04:45,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416167604] [2024-11-10 00:04:45,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416167604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:04:45,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:04:45,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:04:45,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048553191] [2024-11-10 00:04:45,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:04:45,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:04:45,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:04:45,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:04:45,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:04:45,046 INFO L87 Difference]: Start difference. First operand has 163 states, 161 states have (on average 1.7329192546583851) internal successors, (279), 162 states have internal predecessors, (279), 0 states have call successors, (0), 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 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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-10 00:04:45,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:04:45,131 INFO L93 Difference]: Finished difference Result 351 states and 570 transitions. [2024-11-10 00:04:45,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:04:45,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-11-10 00:04:45,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:04:45,152 INFO L225 Difference]: With dead ends: 351 [2024-11-10 00:04:45,152 INFO L226 Difference]: Without dead ends: 246 [2024-11-10 00:04:45,157 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-10 00:04:45,161 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 189 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 550 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-10 00:04:45,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 550 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:04:45,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-10 00:04:45,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2024-11-10 00:04:45,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.4279835390946503) internal successors, (347), 243 states have internal predecessors, (347), 0 states have call successors, (0), 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-10 00:04:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 347 transitions. [2024-11-10 00:04:45,213 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 347 transitions. Word has length 102 [2024-11-10 00:04:45,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:04:45,214 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 347 transitions. [2024-11-10 00:04:45,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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-10 00:04:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 347 transitions. [2024-11-10 00:04:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 00:04:45,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:45,218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:04:45,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:04:45,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:45,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:45,220 INFO L85 PathProgramCache]: Analyzing trace with hash -354779404, now seen corresponding path program 1 times [2024-11-10 00:04:45,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:45,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370538807] [2024-11-10 00:04:45,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:45,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:45,444 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-10 00:04:45,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:04:45,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370538807] [2024-11-10 00:04:45,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370538807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:04:45,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:04:45,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:04:45,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026212350] [2024-11-10 00:04:45,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:04:45,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:04:45,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:04:45,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:04:45,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:04:45,448 INFO L87 Difference]: Start difference. First operand 244 states and 347 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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-10 00:04:45,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:04:45,507 INFO L93 Difference]: Finished difference Result 588 states and 887 transitions. [2024-11-10 00:04:45,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:04:45,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2024-11-10 00:04:45,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:04:45,512 INFO L225 Difference]: With dead ends: 588 [2024-11-10 00:04:45,512 INFO L226 Difference]: Without dead ends: 408 [2024-11-10 00:04:45,516 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-10 00:04:45,521 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 129 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 470 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-10 00:04:45,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 470 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:04:45,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-10 00:04:45,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 406. [2024-11-10 00:04:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.4839506172839507) internal successors, (601), 405 states have internal predecessors, (601), 0 states have call successors, (0), 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-10 00:04:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 601 transitions. [2024-11-10 00:04:45,554 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 601 transitions. Word has length 103 [2024-11-10 00:04:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:04:45,554 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 601 transitions. [2024-11-10 00:04:45,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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-10 00:04:45,555 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 601 transitions. [2024-11-10 00:04:45,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 00:04:45,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:45,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:04:45,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:04:45,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:45,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:45,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1415929354, now seen corresponding path program 1 times [2024-11-10 00:04:45,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:45,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999801158] [2024-11-10 00:04:45,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:45,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:45,812 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-10 00:04:45,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:04:45,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999801158] [2024-11-10 00:04:45,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999801158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:04:45,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:04:45,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:04:45,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607270102] [2024-11-10 00:04:45,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:04:45,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:04:45,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:04:45,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:04:45,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:04:45,818 INFO L87 Difference]: Start difference. First operand 406 states and 601 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-10 00:04:45,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:04:45,855 INFO L93 Difference]: Finished difference Result 1058 states and 1623 transitions. [2024-11-10 00:04:45,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:04:45,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2024-11-10 00:04:45,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:04:45,862 INFO L225 Difference]: With dead ends: 1058 [2024-11-10 00:04:45,862 INFO L226 Difference]: Without dead ends: 716 [2024-11-10 00:04:45,865 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-10 00:04:45,868 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 466 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-10 00:04:45,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 466 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:04:45,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2024-11-10 00:04:45,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 714. [2024-11-10 00:04:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 713 states have (on average 1.5161290322580645) internal successors, (1081), 713 states have internal predecessors, (1081), 0 states have call successors, (0), 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-10 00:04:45,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1081 transitions. [2024-11-10 00:04:45,915 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1081 transitions. Word has length 104 [2024-11-10 00:04:45,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:04:45,915 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 1081 transitions. [2024-11-10 00:04:45,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-10 00:04:45,916 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1081 transitions. [2024-11-10 00:04:45,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 00:04:45,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:45,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:04:45,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:04:45,922 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:45,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:45,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1365520798, now seen corresponding path program 1 times [2024-11-10 00:04:45,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:45,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500791496] [2024-11-10 00:04:45,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:45,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:46,093 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-10 00:04:46,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:04:46,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500791496] [2024-11-10 00:04:46,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500791496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:04:46,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:04:46,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:04:46,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154297945] [2024-11-10 00:04:46,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:04:46,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:04:46,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:04:46,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:04:46,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:04:46,099 INFO L87 Difference]: Start difference. First operand 714 states and 1081 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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-10 00:04:46,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:04:46,131 INFO L93 Difference]: Finished difference Result 1950 states and 3011 transitions. [2024-11-10 00:04:46,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:04:46,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-11-10 00:04:46,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:04:46,140 INFO L225 Difference]: With dead ends: 1950 [2024-11-10 00:04:46,141 INFO L226 Difference]: Without dead ends: 1300 [2024-11-10 00:04:46,145 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-10 00:04:46,146 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 119 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 462 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-10 00:04:46,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 462 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:04:46,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2024-11-10 00:04:46,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1298. [2024-11-10 00:04:46,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1297 states have (on average 1.5304548959136468) internal successors, (1985), 1297 states have internal predecessors, (1985), 0 states have call successors, (0), 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-10 00:04:46,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1985 transitions. [2024-11-10 00:04:46,186 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1985 transitions. Word has length 105 [2024-11-10 00:04:46,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:04:46,188 INFO L471 AbstractCegarLoop]: Abstraction has 1298 states and 1985 transitions. [2024-11-10 00:04:46,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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-10 00:04:46,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1985 transitions. [2024-11-10 00:04:46,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 00:04:46,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:46,192 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:04:46,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:04:46,192 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:46,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:46,193 INFO L85 PathProgramCache]: Analyzing trace with hash -566366379, now seen corresponding path program 1 times [2024-11-10 00:04:46,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:46,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660990376] [2024-11-10 00:04:46,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:46,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:46,361 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-10 00:04:46,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:04:46,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660990376] [2024-11-10 00:04:46,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660990376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:04:46,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:04:46,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:04:46,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950575402] [2024-11-10 00:04:46,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:04:46,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:04:46,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:04:46,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:04:46,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:04:46,366 INFO L87 Difference]: Start difference. First operand 1298 states and 1985 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-10 00:04:46,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:04:46,399 INFO L93 Difference]: Finished difference Result 3638 states and 5619 transitions. [2024-11-10 00:04:46,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:04:46,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2024-11-10 00:04:46,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:04:46,409 INFO L225 Difference]: With dead ends: 3638 [2024-11-10 00:04:46,410 INFO L226 Difference]: Without dead ends: 2404 [2024-11-10 00:04:46,413 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-10 00:04:46,415 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 114 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 458 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-10 00:04:46,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 458 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:04:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2024-11-10 00:04:46,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2402. [2024-11-10 00:04:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2402 states, 2401 states have (on average 1.5331112036651395) internal successors, (3681), 2401 states have internal predecessors, (3681), 0 states have call successors, (0), 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-10 00:04:46,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 3681 transitions. [2024-11-10 00:04:46,475 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 3681 transitions. Word has length 106 [2024-11-10 00:04:46,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:04:46,475 INFO L471 AbstractCegarLoop]: Abstraction has 2402 states and 3681 transitions. [2024-11-10 00:04:46,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-10 00:04:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 3681 transitions. [2024-11-10 00:04:46,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 00:04:46,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:46,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:04:46,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:04:46,480 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:46,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:46,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1163650928, now seen corresponding path program 1 times [2024-11-10 00:04:46,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:46,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318621077] [2024-11-10 00:04:46,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:46,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:46,613 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-10 00:04:46,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:04:46,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318621077] [2024-11-10 00:04:46,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318621077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:04:46,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:04:46,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:04:46,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997632903] [2024-11-10 00:04:46,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:04:46,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:04:46,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:04:46,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:04:46,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:04:46,615 INFO L87 Difference]: Start difference. First operand 2402 states and 3681 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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-10 00:04:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:04:46,668 INFO L93 Difference]: Finished difference Result 6822 states and 10499 transitions. [2024-11-10 00:04:46,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:04:46,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-11-10 00:04:46,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:04:46,686 INFO L225 Difference]: With dead ends: 6822 [2024-11-10 00:04:46,686 INFO L226 Difference]: Without dead ends: 4484 [2024-11-10 00:04:46,691 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-10 00:04:46,693 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 109 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 454 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-10 00:04:46,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 454 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:04:46,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4484 states. [2024-11-10 00:04:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4484 to 4482. [2024-11-10 00:04:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4482 states, 4481 states have (on average 1.528453470207543) internal successors, (6849), 4481 states have internal predecessors, (6849), 0 states have call successors, (0), 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-10 00:04:46,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4482 states to 4482 states and 6849 transitions. [2024-11-10 00:04:46,817 INFO L78 Accepts]: Start accepts. Automaton has 4482 states and 6849 transitions. Word has length 107 [2024-11-10 00:04:46,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:04:46,817 INFO L471 AbstractCegarLoop]: Abstraction has 4482 states and 6849 transitions. [2024-11-10 00:04:46,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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-10 00:04:46,818 INFO L276 IsEmpty]: Start isEmpty. Operand 4482 states and 6849 transitions. [2024-11-10 00:04:46,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 00:04:46,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:46,819 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:04:46,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:04:46,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:46,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:46,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1334572032, now seen corresponding path program 1 times [2024-11-10 00:04:46,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:46,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948408582] [2024-11-10 00:04:46,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:46,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:46,948 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-10 00:04:46,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:04:46,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948408582] [2024-11-10 00:04:46,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948408582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:04:46,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:04:46,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:04:46,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174726557] [2024-11-10 00:04:46,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:04:46,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:04:46,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:04:46,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:04:46,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:04:46,951 INFO L87 Difference]: Start difference. First operand 4482 states and 6849 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:04:47,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:04:47,024 INFO L93 Difference]: Finished difference Result 12806 states and 19587 transitions. [2024-11-10 00:04:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:04:47,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-10 00:04:47,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:04:47,056 INFO L225 Difference]: With dead ends: 12806 [2024-11-10 00:04:47,057 INFO L226 Difference]: Without dead ends: 8388 [2024-11-10 00:04:47,068 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-10 00:04:47,070 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 104 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 450 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-10 00:04:47,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 450 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:04:47,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8388 states. [2024-11-10 00:04:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8388 to 8386. [2024-11-10 00:04:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8386 states, 8385 states have (on average 1.5190220632081097) internal successors, (12737), 8385 states have internal predecessors, (12737), 0 states have call successors, (0), 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-10 00:04:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8386 states to 8386 states and 12737 transitions. [2024-11-10 00:04:47,324 INFO L78 Accepts]: Start accepts. Automaton has 8386 states and 12737 transitions. Word has length 108 [2024-11-10 00:04:47,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:04:47,325 INFO L471 AbstractCegarLoop]: Abstraction has 8386 states and 12737 transitions. [2024-11-10 00:04:47,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:04:47,325 INFO L276 IsEmpty]: Start isEmpty. Operand 8386 states and 12737 transitions. [2024-11-10 00:04:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 00:04:47,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:47,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:04:47,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:04:47,327 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:47,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:47,328 INFO L85 PathProgramCache]: Analyzing trace with hash -569662081, now seen corresponding path program 1 times [2024-11-10 00:04:47,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:47,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989661245] [2024-11-10 00:04:47,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:47,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:47,665 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-10 00:04:47,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:04:47,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989661245] [2024-11-10 00:04:47,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989661245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:04:47,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:04:47,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 00:04:47,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778904695] [2024-11-10 00:04:47,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:04:47,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:04:47,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:04:47,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:04:47,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:04:47,667 INFO L87 Difference]: Start difference. First operand 8386 states and 12737 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 0 states have call successors, (0), 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-10 00:04:49,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:04:49,042 INFO L93 Difference]: Finished difference Result 141538 states and 215505 transitions. [2024-11-10 00:04:49,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 00:04:49,056 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-11-10 00:04:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:04:49,824 INFO L225 Difference]: With dead ends: 141538 [2024-11-10 00:04:49,825 INFO L226 Difference]: Without dead ends: 133216 [2024-11-10 00:04:49,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-10 00:04:49,932 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 2692 mSDsluCounter, 6894 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2692 SdHoareTripleChecker+Valid, 7103 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:04:49,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2692 Valid, 7103 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:04:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133216 states. [2024-11-10 00:04:51,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133216 to 16706. [2024-11-10 00:04:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16706 states, 16705 states have (on average 1.505716851242143) internal successors, (25153), 16705 states have internal predecessors, (25153), 0 states have call successors, (0), 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-10 00:04:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16706 states to 16706 states and 25153 transitions. [2024-11-10 00:04:51,595 INFO L78 Accepts]: Start accepts. Automaton has 16706 states and 25153 transitions. Word has length 109 [2024-11-10 00:04:51,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:04:51,596 INFO L471 AbstractCegarLoop]: Abstraction has 16706 states and 25153 transitions. [2024-11-10 00:04:51,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 0 states have call successors, (0), 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-10 00:04:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 16706 states and 25153 transitions. [2024-11-10 00:04:51,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 00:04:51,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:51,598 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:04:51,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:04:51,598 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:51,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash 30503916, now seen corresponding path program 1 times [2024-11-10 00:04:51,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:51,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129564203] [2024-11-10 00:04:51,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:51,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:52,288 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-10 00:04:52,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:04:52,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129564203] [2024-11-10 00:04:52,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129564203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:04:52,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:04:52,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 00:04:52,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876398573] [2024-11-10 00:04:52,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:04:52,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:04:52,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:04:52,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:04:52,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:04:52,292 INFO L87 Difference]: Start difference. First operand 16706 states and 25153 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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-10 00:04:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:04:52,918 INFO L93 Difference]: Finished difference Result 33350 states and 50243 transitions. [2024-11-10 00:04:52,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 00:04:52,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-11-10 00:04:52,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:04:52,956 INFO L225 Difference]: With dead ends: 33350 [2024-11-10 00:04:52,956 INFO L226 Difference]: Without dead ends: 16708 [2024-11-10 00:04:52,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-10 00:04:52,981 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 369 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:04:52,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1300 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:04:52,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16708 states. [2024-11-10 00:04:53,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16708 to 16706. [2024-11-10 00:04:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16706 states, 16705 states have (on average 1.4980544747081712) internal successors, (25025), 16705 states have internal predecessors, (25025), 0 states have call successors, (0), 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-10 00:04:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16706 states to 16706 states and 25025 transitions. [2024-11-10 00:04:53,309 INFO L78 Accepts]: Start accepts. Automaton has 16706 states and 25025 transitions. Word has length 112 [2024-11-10 00:04:53,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:04:53,309 INFO L471 AbstractCegarLoop]: Abstraction has 16706 states and 25025 transitions. [2024-11-10 00:04:53,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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-10 00:04:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand 16706 states and 25025 transitions. [2024-11-10 00:04:53,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 00:04:53,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:53,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:04:53,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:04:53,311 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:53,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:53,312 INFO L85 PathProgramCache]: Analyzing trace with hash -293207188, now seen corresponding path program 1 times [2024-11-10 00:04:53,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:53,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711134630] [2024-11-10 00:04:53,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:53,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:53,417 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-10 00:04:53,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:04:53,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711134630] [2024-11-10 00:04:53,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711134630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:04:53,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:04:53,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:04:53,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042304830] [2024-11-10 00:04:53,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:04:53,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:04:53,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:04:53,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:04:53,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:04:53,420 INFO L87 Difference]: Start difference. First operand 16706 states and 25025 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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-10 00:04:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:04:53,540 INFO L93 Difference]: Finished difference Result 47430 states and 70851 transitions. [2024-11-10 00:04:53,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:04:53,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-11-10 00:04:53,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:04:53,746 INFO L225 Difference]: With dead ends: 47430 [2024-11-10 00:04:53,747 INFO L226 Difference]: Without dead ends: 30788 [2024-11-10 00:04:53,771 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-10 00:04:53,772 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 136 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 486 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-10 00:04:53,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 486 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:04:53,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30788 states. [2024-11-10 00:04:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30788 to 30786. [2024-11-10 00:04:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30786 states, 30785 states have (on average 1.4823128146824753) internal successors, (45633), 30785 states have internal predecessors, (45633), 0 states have call successors, (0), 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-10 00:04:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30786 states to 30786 states and 45633 transitions. [2024-11-10 00:04:54,355 INFO L78 Accepts]: Start accepts. Automaton has 30786 states and 45633 transitions. Word has length 112 [2024-11-10 00:04:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:04:54,356 INFO L471 AbstractCegarLoop]: Abstraction has 30786 states and 45633 transitions. [2024-11-10 00:04:54,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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-10 00:04:54,356 INFO L276 IsEmpty]: Start isEmpty. Operand 30786 states and 45633 transitions. [2024-11-10 00:04:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-10 00:04:54,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:54,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:04:54,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:04:54,358 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:54,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:54,359 INFO L85 PathProgramCache]: Analyzing trace with hash -801662775, now seen corresponding path program 1 times [2024-11-10 00:04:54,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:54,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491342037] [2024-11-10 00:04:54,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:54,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:54,805 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-10 00:04:54,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:04:54,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491342037] [2024-11-10 00:04:54,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491342037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:04:54,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:04:54,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:04:54,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58325746] [2024-11-10 00:04:54,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:04:54,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:04:54,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:04:54,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:04:54,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:04:54,812 INFO L87 Difference]: Start difference. First operand 30786 states and 45633 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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-10 00:04:55,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:04:55,208 INFO L93 Difference]: Finished difference Result 76488 states and 113477 transitions. [2024-11-10 00:04:55,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:04:55,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-10 00:04:55,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:04:55,300 INFO L225 Difference]: With dead ends: 76488 [2024-11-10 00:04:55,300 INFO L226 Difference]: Without dead ends: 45766 [2024-11-10 00:04:55,333 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-10 00:04:55,337 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 94 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 351 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-10 00:04:55,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 351 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:04:55,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45766 states. [2024-11-10 00:04:56,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45766 to 45508. [2024-11-10 00:04:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45508 states, 45507 states have (on average 1.4725426857406554) internal successors, (67011), 45507 states have internal predecessors, (67011), 0 states have call successors, (0), 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-10 00:04:56,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45508 states to 45508 states and 67011 transitions. [2024-11-10 00:04:56,257 INFO L78 Accepts]: Start accepts. Automaton has 45508 states and 67011 transitions. Word has length 114 [2024-11-10 00:04:56,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:04:56,258 INFO L471 AbstractCegarLoop]: Abstraction has 45508 states and 67011 transitions. [2024-11-10 00:04:56,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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-10 00:04:56,258 INFO L276 IsEmpty]: Start isEmpty. Operand 45508 states and 67011 transitions. [2024-11-10 00:04:56,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 00:04:56,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:56,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:04:56,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:04:56,260 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:56,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:56,260 INFO L85 PathProgramCache]: Analyzing trace with hash 326756650, now seen corresponding path program 1 times [2024-11-10 00:04:56,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:56,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324146884] [2024-11-10 00:04:56,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:56,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:56,459 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-10 00:04:56,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:04:56,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324146884] [2024-11-10 00:04:56,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324146884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:04:56,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:04:56,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:04:56,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131449062] [2024-11-10 00:04:56,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:04:56,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:04:56,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:04:56,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:04:56,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:04:56,463 INFO L87 Difference]: Start difference. First operand 45508 states and 67011 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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-10 00:04:57,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:04:57,029 INFO L93 Difference]: Finished difference Result 90950 states and 133956 transitions. [2024-11-10 00:04:57,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:04:57,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-11-10 00:04:57,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:04:57,103 INFO L225 Difference]: With dead ends: 90950 [2024-11-10 00:04:57,103 INFO L226 Difference]: Without dead ends: 45508 [2024-11-10 00:04:57,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:04:57,138 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 470 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:04:57,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 195 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:04:57,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45508 states. [2024-11-10 00:04:57,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45508 to 45508. [2024-11-10 00:04:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45508 states, 45507 states have (on average 1.4641044234952865) internal successors, (66627), 45507 states have internal predecessors, (66627), 0 states have call successors, (0), 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-10 00:04:58,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45508 states to 45508 states and 66627 transitions. [2024-11-10 00:04:58,059 INFO L78 Accepts]: Start accepts. Automaton has 45508 states and 66627 transitions. Word has length 115 [2024-11-10 00:04:58,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:04:58,059 INFO L471 AbstractCegarLoop]: Abstraction has 45508 states and 66627 transitions. [2024-11-10 00:04:58,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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-10 00:04:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 45508 states and 66627 transitions. [2024-11-10 00:04:58,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 00:04:58,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:58,060 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:04:58,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:04:58,061 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:58,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:58,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1419121289, now seen corresponding path program 1 times [2024-11-10 00:04:58,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:58,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766941957] [2024-11-10 00:04:58,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:58,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:58,498 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-10 00:04:58,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:04:58,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766941957] [2024-11-10 00:04:58,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766941957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:04:58,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:04:58,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:04:58,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12586644] [2024-11-10 00:04:58,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:04:58,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:04:58,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:04:58,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:04:58,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:04:58,502 INFO L87 Difference]: Start difference. First operand 45508 states and 66627 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 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-10 00:04:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:04:58,679 INFO L93 Difference]: Finished difference Result 47558 states and 69188 transitions. [2024-11-10 00:04:58,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:04:58,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-11-10 00:04:58,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:04:58,755 INFO L225 Difference]: With dead ends: 47558 [2024-11-10 00:04:58,756 INFO L226 Difference]: Without dead ends: 47556 [2024-11-10 00:04:58,778 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-10 00:04:58,779 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 0 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 825 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-10 00:04:58,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 825 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:04:58,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47556 states. [2024-11-10 00:04:59,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47556 to 47556. [2024-11-10 00:04:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47556 states, 47555 states have (on average 1.4414257175901588) internal successors, (68547), 47555 states have internal predecessors, (68547), 0 states have call successors, (0), 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-10 00:04:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47556 states to 47556 states and 68547 transitions. [2024-11-10 00:04:59,652 INFO L78 Accepts]: Start accepts. Automaton has 47556 states and 68547 transitions. Word has length 115 [2024-11-10 00:04:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:04:59,652 INFO L471 AbstractCegarLoop]: Abstraction has 47556 states and 68547 transitions. [2024-11-10 00:04:59,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 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-10 00:04:59,653 INFO L276 IsEmpty]: Start isEmpty. Operand 47556 states and 68547 transitions. [2024-11-10 00:04:59,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 00:04:59,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:59,667 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:04:59,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:04:59,668 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:59,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:59,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1771296095, now seen corresponding path program 1 times [2024-11-10 00:04:59,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:59,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364368444] [2024-11-10 00:04:59,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:59,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:05:00,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:00,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364368444] [2024-11-10 00:05:00,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364368444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:00,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:00,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 00:05:00,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462184964] [2024-11-10 00:05:00,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:00,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:05:00,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:00,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:05:00,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:05:00,208 INFO L87 Difference]: Start difference. First operand 47556 states and 68547 transitions. Second operand has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 0 states have call successors, (0), 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-10 00:05:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:01,822 INFO L93 Difference]: Finished difference Result 436694 states and 629132 transitions. [2024-11-10 00:05:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 00:05:01,823 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 0 states have call successors, (0), 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 154 [2024-11-10 00:05:01,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:02,489 INFO L225 Difference]: With dead ends: 436694 [2024-11-10 00:05:02,490 INFO L226 Difference]: Without dead ends: 389204 [2024-11-10 00:05:02,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-10 00:05:02,610 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 2326 mSDsluCounter, 2805 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 3165 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:02,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2326 Valid, 3165 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:05:02,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389204 states. [2024-11-10 00:05:06,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389204 to 95044. [2024-11-10 00:05:06,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95044 states, 95043 states have (on average 1.4376966215292026) internal successors, (136643), 95043 states have internal predecessors, (136643), 0 states have call successors, (0), 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-10 00:05:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95044 states to 95044 states and 136643 transitions. [2024-11-10 00:05:06,398 INFO L78 Accepts]: Start accepts. Automaton has 95044 states and 136643 transitions. Word has length 154 [2024-11-10 00:05:06,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:06,398 INFO L471 AbstractCegarLoop]: Abstraction has 95044 states and 136643 transitions. [2024-11-10 00:05:06,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 0 states have call successors, (0), 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-10 00:05:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 95044 states and 136643 transitions. [2024-11-10 00:05:06,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 00:05:06,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:06,416 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:05:06,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:05:06,416 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:06,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:06,417 INFO L85 PathProgramCache]: Analyzing trace with hash 758927487, now seen corresponding path program 1 times [2024-11-10 00:05:06,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:06,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789332835] [2024-11-10 00:05:06,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:06,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 00:05:06,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:06,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789332835] [2024-11-10 00:05:06,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789332835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:06,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:06,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 00:05:06,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7385984] [2024-11-10 00:05:06,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:06,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:05:06,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:06,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:05:06,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:05:06,748 INFO L87 Difference]: Start difference. First operand 95044 states and 136643 transitions. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 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-10 00:05:08,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:08,794 INFO L93 Difference]: Finished difference Result 484182 states and 697228 transitions. [2024-11-10 00:05:08,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 00:05:08,795 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 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 154 [2024-11-10 00:05:08,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:10,422 INFO L225 Difference]: With dead ends: 484182 [2024-11-10 00:05:10,422 INFO L226 Difference]: Without dead ends: 436692 [2024-11-10 00:05:10,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-10 00:05:10,531 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 2384 mSDsluCounter, 2749 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:10,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 3107 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:05:10,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436692 states. [2024-11-10 00:05:14,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436692 to 166468. [2024-11-10 00:05:14,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166468 states, 166467 states have (on average 1.4332870779193474) internal successors, (238595), 166467 states have internal predecessors, (238595), 0 states have call successors, (0), 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-10 00:05:15,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166468 states to 166468 states and 238595 transitions. [2024-11-10 00:05:15,201 INFO L78 Accepts]: Start accepts. Automaton has 166468 states and 238595 transitions. Word has length 154 [2024-11-10 00:05:15,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:15,201 INFO L471 AbstractCegarLoop]: Abstraction has 166468 states and 238595 transitions. [2024-11-10 00:05:15,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 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-10 00:05:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 166468 states and 238595 transitions. [2024-11-10 00:05:15,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 00:05:15,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:15,215 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:05:15,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:05:15,215 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:15,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:15,216 INFO L85 PathProgramCache]: Analyzing trace with hash 868085342, now seen corresponding path program 1 times [2024-11-10 00:05:15,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:15,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534739232] [2024-11-10 00:05:15,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:15,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-10 00:05:15,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:15,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534739232] [2024-11-10 00:05:15,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534739232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:15,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:15,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 00:05:15,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117020684] [2024-11-10 00:05:15,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:15,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:05:15,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:15,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:05:15,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:05:15,542 INFO L87 Difference]: Start difference. First operand 166468 states and 238595 transitions. Second operand has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 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-10 00:05:18,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:18,088 INFO L93 Difference]: Finished difference Result 531670 states and 765324 transitions. [2024-11-10 00:05:18,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 00:05:18,089 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 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 154 [2024-11-10 00:05:18,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:19,139 INFO L225 Difference]: With dead ends: 531670 [2024-11-10 00:05:19,140 INFO L226 Difference]: Without dead ends: 484180 [2024-11-10 00:05:19,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-10 00:05:19,316 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 2472 mSDsluCounter, 2546 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2472 SdHoareTripleChecker+Valid, 2901 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:19,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2472 Valid, 2901 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:05:19,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484180 states. [2024-11-10 00:05:25,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484180 to 213956. [2024-11-10 00:05:25,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213956 states, 213955 states have (on average 1.4334369376738099) internal successors, (306691), 213955 states have internal predecessors, (306691), 0 states have call successors, (0), 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-10 00:05:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213956 states to 213956 states and 306691 transitions. [2024-11-10 00:05:25,685 INFO L78 Accepts]: Start accepts. Automaton has 213956 states and 306691 transitions. Word has length 154 [2024-11-10 00:05:25,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:25,686 INFO L471 AbstractCegarLoop]: Abstraction has 213956 states and 306691 transitions. [2024-11-10 00:05:25,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 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-10 00:05:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 213956 states and 306691 transitions. [2024-11-10 00:05:25,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 00:05:25,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:25,702 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:05:25,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:05:25,702 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:25,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1373508705, now seen corresponding path program 1 times [2024-11-10 00:05:25,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:25,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121318164] [2024-11-10 00:05:25,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:25,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 00:05:26,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:26,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121318164] [2024-11-10 00:05:26,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121318164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:26,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:26,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 00:05:26,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423172519] [2024-11-10 00:05:26,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:26,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:05:26,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:26,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:05:26,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:05:26,007 INFO L87 Difference]: Start difference. First operand 213956 states and 306691 transitions. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 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-10 00:05:29,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:29,045 INFO L93 Difference]: Finished difference Result 579158 states and 833420 transitions. [2024-11-10 00:05:29,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 00:05:29,046 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 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 154 [2024-11-10 00:05:29,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:30,160 INFO L225 Difference]: With dead ends: 579158 [2024-11-10 00:05:30,160 INFO L226 Difference]: Without dead ends: 531668 [2024-11-10 00:05:30,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-10 00:05:30,350 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 2555 mSDsluCounter, 2498 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2555 SdHoareTripleChecker+Valid, 2851 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:30,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2555 Valid, 2851 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:05:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531668 states. [2024-11-10 00:05:36,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531668 to 261444. [2024-11-10 00:05:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261444 states, 261443 states have (on average 1.4335323569573482) internal successors, (374787), 261443 states have internal predecessors, (374787), 0 states have call successors, (0), 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-10 00:05:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261444 states to 261444 states and 374787 transitions. [2024-11-10 00:05:37,779 INFO L78 Accepts]: Start accepts. Automaton has 261444 states and 374787 transitions. Word has length 154 [2024-11-10 00:05:37,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:37,779 INFO L471 AbstractCegarLoop]: Abstraction has 261444 states and 374787 transitions. [2024-11-10 00:05:37,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 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-10 00:05:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 261444 states and 374787 transitions. [2024-11-10 00:05:37,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 00:05:37,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:37,801 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:05:37,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:05:37,801 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:37,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:37,802 INFO L85 PathProgramCache]: Analyzing trace with hash 112384126, now seen corresponding path program 1 times [2024-11-10 00:05:37,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:37,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099132711] [2024-11-10 00:05:37,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:37,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-10 00:05:38,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:38,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099132711] [2024-11-10 00:05:38,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099132711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:38,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:38,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 00:05:38,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318348547] [2024-11-10 00:05:38,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:38,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:05:38,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:38,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:05:38,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:05:38,143 INFO L87 Difference]: Start difference. First operand 261444 states and 374787 transitions. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)