./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-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-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-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 62ddbd8e479b9a9ff0259307914371bc7c12caf38dd9ff6b9d8872f71f8db1de --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:51:50,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:51:50,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:51:50,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:51:50,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:51:50,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:51:50,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:51:50,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:51:50,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:51:50,220 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:51:50,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:51:50,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:51:50,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:51:50,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:51:50,223 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:51:50,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:51:50,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:51:50,225 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:51:50,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:51:50,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:51:50,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:51:50,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:51:50,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:51:50,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:51:50,228 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:51:50,228 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:51:50,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:51:50,229 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:51:50,229 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:51:50,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:51:50,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:51:50,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:51:50,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:51:50,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:51:50,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:51:50,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:51:50,232 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:51:50,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:51:50,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:51:50,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:51:50,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:51:50,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:51:50,234 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 -> 62ddbd8e479b9a9ff0259307914371bc7c12caf38dd9ff6b9d8872f71f8db1de [2024-11-09 23:51:50,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:51:50,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:51:50,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:51:50,512 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:51:50,513 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:51:50,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-09 23:51:51,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:51:52,278 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:51:52,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-09 23:51:52,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10a6e5e66/34ba4e8540d74674a46b3e0caf0ad552/FLAG4148de255 [2024-11-09 23:51:52,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10a6e5e66/34ba4e8540d74674a46b3e0caf0ad552 [2024-11-09 23:51:52,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:51:52,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:51:52,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:51:52,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:51:52,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:51:52,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:51:52" (1/1) ... [2024-11-09 23:51:52,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b7327a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:52, skipping insertion in model container [2024-11-09 23:51:52,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:51:52" (1/1) ... [2024-11-09 23:51:52,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:51:52,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8125,8138] [2024-11-09 23:51:52,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14955,14968] [2024-11-09 23:51:52,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17042,17055] [2024-11-09 23:51:52,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18066,18079] [2024-11-09 23:51:52,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:51:52,905 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:51:52,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8125,8138] [2024-11-09 23:51:52,950 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14955,14968] [2024-11-09 23:51:52,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17042,17055] [2024-11-09 23:51:52,959 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18066,18079] [2024-11-09 23:51:53,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:51:53,053 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:51:53,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:53 WrapperNode [2024-11-09 23:51:53,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:51:53,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:51:53,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:51:53,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:51:53,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:53" (1/1) ... [2024-11-09 23:51:53,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:53" (1/1) ... [2024-11-09 23:51:53,169 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2617 [2024-11-09 23:51:53,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:51:53,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:51:53,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:51:53,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:51:53,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:53" (1/1) ... [2024-11-09 23:51:53,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:53" (1/1) ... [2024-11-09 23:51:53,197 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:53" (1/1) ... [2024-11-09 23:51:53,247 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 23:51:53,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:53" (1/1) ... [2024-11-09 23:51:53,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:53" (1/1) ... [2024-11-09 23:51:53,319 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:53" (1/1) ... [2024-11-09 23:51:53,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:53" (1/1) ... [2024-11-09 23:51:53,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:53" (1/1) ... [2024-11-09 23:51:53,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:53" (1/1) ... [2024-11-09 23:51:53,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:51:53,351 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:51:53,351 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:51:53,351 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:51:53,352 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:53" (1/1) ... [2024-11-09 23:51:53,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:51:53,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:51:53,384 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 23:51:53,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 23:51:53,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:51:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:51:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:51:53,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:51:53,638 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:51:53,640 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:51:55,240 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1489: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2024-11-09 23:51:55,240 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1489: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2024-11-09 23:51:55,241 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2018: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~20#1; [2024-11-09 23:51:55,241 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2018: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~20#1; [2024-11-09 23:51:55,241 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3736: havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~48#1; [2024-11-09 23:51:55,241 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3736: havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~48#1; [2024-11-09 23:51:55,241 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3340: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~41#1; [2024-11-09 23:51:55,242 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3340: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~41#1; [2024-11-09 23:51:55,242 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L235: havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-09 23:51:55,242 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1094: havoc main_~node2__m2~3#1; [2024-11-09 23:51:55,243 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc main_~node2____CPAchecker_TMP_0~1#1; [2024-11-09 23:51:55,243 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4134: havoc main_~node3____CPAchecker_TMP_1~12#1; [2024-11-09 23:51:55,243 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2879: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~34#1; [2024-11-09 23:51:55,243 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2879: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~34#1; [2024-11-09 23:51:55,243 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823: havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_1~1#1; [2024-11-09 23:51:55,244 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823: havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_1~1#1; [2024-11-09 23:51:55,244 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3541: havoc main_~node3__m3~14#1; [2024-11-09 23:51:55,244 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L503: havoc main_~node1____CPAchecker_TMP_0~1#1; [2024-11-09 23:51:55,244 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2750: havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~32#1; [2024-11-09 23:51:55,244 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2750: havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~32#1; [2024-11-09 23:51:55,244 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2354: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~25#1; [2024-11-09 23:51:55,244 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2354: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~25#1; [2024-11-09 23:51:55,244 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3148: havoc main_~node3____CPAchecker_TMP_1~8#1; [2024-11-09 23:51:55,244 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2555: havoc main_~node3__m3~10#1; [2024-11-09 23:51:55,244 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L640: havoc main_~node3____CPAchecker_TMP_1~0#1; [2024-11-09 23:51:55,244 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L971: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2024-11-09 23:51:55,244 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L971: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2024-11-09 23:51:55,245 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1434: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2024-11-09 23:51:55,245 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1434: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2024-11-09 23:51:55,245 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1963: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~19#1; [2024-11-09 23:51:55,245 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1963: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~19#1; [2024-11-09 23:51:55,245 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1699: havoc main_~node3____CPAchecker_TMP_1~2#1; [2024-11-09 23:51:55,245 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3681: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~47#1; [2024-11-09 23:51:55,246 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3681: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~47#1; [2024-11-09 23:51:55,246 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L312: havoc main_~node3__m3~1#1; [2024-11-09 23:51:55,247 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2096: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~21#1; [2024-11-09 23:51:55,247 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2096: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~21#1; [2024-11-09 23:51:55,247 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3814: havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~49#1; [2024-11-09 23:51:55,247 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3814: havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~49#1; [2024-11-09 23:51:55,247 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1833: havoc main_~node3____CPAchecker_TMP_0~3#1; [2024-11-09 23:51:55,247 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L446: havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-09 23:51:55,247 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L446: havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-09 23:51:55,247 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L446: havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-09 23:51:55,248 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3551: havoc main_~node3____CPAchecker_TMP_0~10#1; [2024-11-09 23:51:55,248 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1305: havoc main_~check__tmp~9#1; [2024-11-09 23:51:55,248 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3287: havoc main_~node2__m2~5#1;havoc main_~node1____CPAchecker_TMP_1~2#1; [2024-11-09 23:51:55,249 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3421: havoc main_~node3____CPAchecker_TMP_1~9#1; [2024-11-09 23:51:55,249 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241: havoc main_~node3__m3~5#1; [2024-11-09 23:51:55,249 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4214: havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~56#1; [2024-11-09 23:51:55,249 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4214: havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~56#1; [2024-11-09 23:51:55,250 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2695: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~31#1; [2024-11-09 23:51:55,250 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2695: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~31#1; [2024-11-09 23:51:55,250 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2828: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~33#1; [2024-11-09 23:51:55,250 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2828: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~33#1; [2024-11-09 23:51:55,250 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:51:55,250 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:51:55,250 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:51:55,250 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:51:55,251 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:51:55,251 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:51:55,251 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:51:55,251 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:51:55,251 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:51:55,251 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:51:55,251 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:51:55,251 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:51:55,251 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:51:55,251 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:51:55,251 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:51:55,252 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:51:55,252 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:51:55,252 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:51:55,252 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1111: havoc main_~node3__m3~4#1; [2024-11-09 23:51:55,252 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2565: havoc main_~node3____CPAchecker_TMP_0~6#1; [2024-11-09 23:51:55,252 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2301: havoc main_~node2__m2~4#1; [2024-11-09 23:51:55,252 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4019: havoc main_~node3__m3~16#1; [2024-11-09 23:51:55,252 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2435: havoc main_~node3____CPAchecker_TMP_1~5#1; [2024-11-09 23:51:55,252 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3228: havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~40#1; [2024-11-09 23:51:55,252 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3228: havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~40#1; [2024-11-09 23:51:55,252 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~18#1; [2024-11-09 23:51:55,252 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~18#1; [2024-11-09 23:51:55,253 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3626: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~46#1; [2024-11-09 23:51:55,253 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3626: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~46#1; [2024-11-09 23:51:55,253 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc main_~node3__m3~12#1; [2024-11-09 23:51:55,253 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1779: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2024-11-09 23:51:55,253 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1779: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2024-11-09 23:51:55,253 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L789: havoc main_~node1____CPAchecker_TMP_0~2#1; [2024-11-09 23:51:55,253 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2177: havoc main_~node3____CPAchecker_TMP_1~4#1; [2024-11-09 23:51:55,253 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4159: havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~55#1; [2024-11-09 23:51:55,253 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4159: havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~55#1; [2024-11-09 23:51:55,253 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3895: havoc main_~node3____CPAchecker_TMP_1~11#1; [2024-11-09 23:51:55,253 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2640: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~30#1; [2024-11-09 23:51:55,253 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2640: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~30#1; [2024-11-09 23:51:55,254 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1584: havoc main_~node3__m3~6#1; [2024-11-09 23:51:55,254 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4029: havoc main_~node3____CPAchecker_TMP_0~12#1; [2024-11-09 23:51:55,254 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L726: havoc main_~node2____CPAchecker_TMP_1~0#1; [2024-11-09 23:51:55,254 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3501: havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~44#1; [2024-11-09 23:51:55,254 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3501: havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~44#1; [2024-11-09 23:51:55,254 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L398: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-09 23:51:55,254 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L398: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-09 23:51:55,254 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L398: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-09 23:51:55,254 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L398: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-09 23:51:55,254 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~39#1; [2024-11-09 23:51:55,254 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~39#1; [2024-11-09 23:51:55,254 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2909: havoc main_~node3____CPAchecker_TMP_1~7#1; [2024-11-09 23:51:55,254 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L531: havoc main_~node1____CPAchecker_TMP_1~0#1; [2024-11-09 23:51:55,255 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3306: havoc main_~node3__m3~13#1;havoc main_~node2____CPAchecker_TMP_0~3#1; [2024-11-09 23:51:55,255 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1192: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2024-11-09 23:51:55,255 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3043: havoc main_~node3____CPAchecker_TMP_0~8#1; [2024-11-09 23:51:55,255 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2515: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~28#1; [2024-11-09 23:51:55,255 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2515: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~28#1; [2024-11-09 23:51:55,255 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1724: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1; [2024-11-09 23:51:55,257 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1724: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1; [2024-11-09 23:51:55,257 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L271: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:51:55,257 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L271: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:51:55,257 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1857: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~17#1; [2024-11-09 23:51:55,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1857: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~17#1; [2024-11-09 23:51:55,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3575: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~45#1; [2024-11-09 23:51:55,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3575: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~45#1; [2024-11-09 23:51:55,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2320: havoc main_~node3__m3~9#1;havoc main_~node2____CPAchecker_TMP_0~2#1; [2024-11-09 23:51:55,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L206: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-09 23:51:55,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4104: havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~54#1; [2024-11-09 23:51:55,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4104: havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~54#1; [2024-11-09 23:51:55,259 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1594: havoc main_~node3____CPAchecker_TMP_0~2#1; [2024-11-09 23:51:55,259 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1464: havoc main_~node3____CPAchecker_TMP_1~1#1; [2024-11-09 23:51:55,259 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3446: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~43#1; [2024-11-09 23:51:55,259 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3446: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~43#1; [2024-11-09 23:51:55,260 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2257: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~24#1; [2024-11-09 23:51:55,260 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2257: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~24#1; [2024-11-09 23:51:55,260 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3975: havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~52#1; [2024-11-09 23:51:55,260 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3975: havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~52#1; [2024-11-09 23:51:55,260 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2589: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~29#1; [2024-11-09 23:51:55,260 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2589: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~29#1; [2024-11-09 23:51:55,260 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3316: havoc main_~node3____CPAchecker_TMP_0~9#1; [2024-11-09 23:51:55,261 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3118: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~38#1; [2024-11-09 23:51:55,262 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3118: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~38#1; [2024-11-09 23:51:55,263 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2062: havoc main_~node3__m3~8#1; [2024-11-09 23:51:55,264 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L939: havoc main_~node3__m3~3#1; [2024-11-09 23:51:55,264 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3780: havoc main_~node3__m3~15#1;havoc main_~node2____CPAchecker_TMP_1~3#1; [2024-11-09 23:51:55,264 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3780: havoc main_~node3__m3~15#1;havoc main_~node2____CPAchecker_TMP_1~3#1; [2024-11-09 23:51:55,264 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2460: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~27#1; [2024-11-09 23:51:55,265 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2460: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~27#1; [2024-11-09 23:51:55,265 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2989: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~36#1; [2024-11-09 23:51:55,265 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2989: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~36#1; [2024-11-09 23:51:55,265 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1669: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2024-11-09 23:51:55,265 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1669: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2024-11-09 23:51:55,266 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L612: havoc main_~node3____CPAchecker_TMP_0~1#1; [2024-11-09 23:51:55,266 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2330: havoc main_~node3____CPAchecker_TMP_0~5#1; [2024-11-09 23:51:55,267 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2794: havoc main_~node3__m3~11#1;havoc main_~node2____CPAchecker_TMP_1~2#1; [2024-11-09 23:51:55,267 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2794: havoc main_~node3__m3~11#1;havoc main_~node2____CPAchecker_TMP_1~2#1; [2024-11-09 23:51:55,267 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1275: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2024-11-09 23:51:55,267 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1143: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2024-11-09 23:51:55,267 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1143: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2024-11-09 23:51:55,267 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3391: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~42#1; [2024-11-09 23:51:55,267 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3391: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~42#1; [2024-11-09 23:51:55,267 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2202: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~23#1; [2024-11-09 23:51:55,267 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2202: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~23#1; [2024-11-09 23:51:55,267 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1938: havoc main_~node3____CPAchecker_TMP_1~3#1; [2024-11-09 23:51:55,267 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3920: havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~51#1; [2024-11-09 23:51:55,267 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3920: havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~51#1; [2024-11-09 23:51:55,268 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3656: havoc main_~node3____CPAchecker_TMP_1~10#1; [2024-11-09 23:51:55,268 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4053: havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~53#1; [2024-11-09 23:51:55,268 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4053: havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~53#1; [2024-11-09 23:51:55,268 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L882: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-09 23:51:55,268 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L882: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-09 23:51:55,268 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2072: havoc main_~node3____CPAchecker_TMP_0~4#1; [2024-11-09 23:51:55,268 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L817: havoc main_~node1____CPAchecker_TMP_1~1#1; [2024-11-09 23:51:55,268 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3790: havoc main_~node3____CPAchecker_TMP_0~11#1; [2024-11-09 23:51:55,268 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1544: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2024-11-09 23:51:55,268 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1544: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2024-11-09 23:51:55,268 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L356: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-09 23:51:55,268 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L356: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-09 23:51:55,268 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2405: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~26#1; [2024-11-09 23:51:55,268 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2405: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~26#1; [2024-11-09 23:51:55,269 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-09 23:51:55,269 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2934: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~35#1; [2024-11-09 23:51:55,269 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2934: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~35#1; [2024-11-09 23:51:55,269 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2670: havoc main_~node3____CPAchecker_TMP_1~6#1; [2024-11-09 23:51:55,269 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3067: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~37#1; [2024-11-09 23:51:55,269 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3067: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~37#1; [2024-11-09 23:51:55,269 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2024-11-09 23:51:55,269 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2804: havoc main_~node3____CPAchecker_TMP_0~7#1; [2024-11-09 23:51:55,269 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L295: havoc main_~node2__m2~1#1; [2024-11-09 23:51:55,269 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1618: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~13#1; [2024-11-09 23:51:55,269 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1618: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~13#1; [2024-11-09 23:51:55,269 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2147: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~22#1; [2024-11-09 23:51:55,269 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2147: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~22#1; [2024-11-09 23:51:55,269 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3865: havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~50#1; [2024-11-09 23:51:55,270 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3865: havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~50#1; [2024-11-09 23:51:55,354 INFO L? ?]: Removed 426 outVars from TransFormulas that were not future-live. [2024-11-09 23:51:55,354 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:51:55,390 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:51:55,390 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:51:55,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:51:55 BoogieIcfgContainer [2024-11-09 23:51:55,390 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:51:55,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:51:55,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:51:55,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:51:55,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:51:52" (1/3) ... [2024-11-09 23:51:55,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682ee9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:51:55, skipping insertion in model container [2024-11-09 23:51:55,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:53" (2/3) ... [2024-11-09 23:51:55,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682ee9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:51:55, skipping insertion in model container [2024-11-09 23:51:55,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:51:55" (3/3) ... [2024-11-09 23:51:55,400 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-09 23:51:55,449 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:51:55,449 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 23:51:55,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:51:55,529 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;@5f194614, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:51:55,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 23:51:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 467 states, 462 states have (on average 1.829004329004329) internal successors, (845), 466 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 23:51:55,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:51:55,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:51:55,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:51:55,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:51:55,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1809478949, now seen corresponding path program 1 times [2024-11-09 23:51:55,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:51:55,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31611826] [2024-11-09 23:51:55,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:51:55,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:51:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:51:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:51:56,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:51:56,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31611826] [2024-11-09 23:51:56,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31611826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:51:56,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:51:56,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:51:56,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416972656] [2024-11-09 23:51:56,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:51:56,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:51:56,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:51:56,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:51:56,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:51:56,041 INFO L87 Difference]: Start difference. First operand has 467 states, 462 states have (on average 1.829004329004329) internal successors, (845), 466 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:56,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:51:56,198 INFO L93 Difference]: Finished difference Result 748 states and 1293 transitions. [2024-11-09 23:51:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:51:56,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-09 23:51:56,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:51:56,230 INFO L225 Difference]: With dead ends: 748 [2024-11-09 23:51:56,233 INFO L226 Difference]: Without dead ends: 583 [2024-11-09 23:51:56,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:51:56,242 INFO L432 NwaCegarLoop]: 872 mSDtfsCounter, 444 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:51:56,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1428 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:51:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-09 23:51:56,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 577. [2024-11-09 23:51:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 573 states have (on average 1.343804537521815) internal successors, (770), 576 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 770 transitions. [2024-11-09 23:51:56,319 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 770 transitions. Word has length 50 [2024-11-09 23:51:56,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:51:56,320 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 770 transitions. [2024-11-09 23:51:56,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 770 transitions. [2024-11-09 23:51:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 23:51:56,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:51:56,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:51:56,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:51:56,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:51:56,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:51:56,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1083449999, now seen corresponding path program 1 times [2024-11-09 23:51:56,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:51:56,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201523808] [2024-11-09 23:51:56,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:51:56,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:51:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:51:56,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:51:56,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:51:56,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201523808] [2024-11-09 23:51:56,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201523808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:51:56,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:51:56,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:51:56,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041364387] [2024-11-09 23:51:56,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:51:56,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:51:56,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:51:56,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:51:56,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:51:56,577 INFO L87 Difference]: Start difference. First operand 577 states and 770 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:56,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:51:56,984 INFO L93 Difference]: Finished difference Result 1171 states and 1619 transitions. [2024-11-09 23:51:56,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:51:56,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-09 23:51:56,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:51:56,988 INFO L225 Difference]: With dead ends: 1171 [2024-11-09 23:51:56,989 INFO L226 Difference]: Without dead ends: 710 [2024-11-09 23:51:56,991 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-09 23:51:56,994 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 1786 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1786 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:51:56,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1786 Valid, 409 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:51:56,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-09 23:51:57,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 704. [2024-11-09 23:51:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 700 states have (on average 1.3928571428571428) internal successors, (975), 703 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 975 transitions. [2024-11-09 23:51:57,021 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 975 transitions. Word has length 50 [2024-11-09 23:51:57,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:51:57,022 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 975 transitions. [2024-11-09 23:51:57,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 975 transitions. [2024-11-09 23:51:57,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 23:51:57,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:51:57,025 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:51:57,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:51:57,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:51:57,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:51:57,028 INFO L85 PathProgramCache]: Analyzing trace with hash -546183644, now seen corresponding path program 1 times [2024-11-09 23:51:57,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:51:57,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607825464] [2024-11-09 23:51:57,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:51:57,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:51:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:51:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:51:57,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:51:57,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607825464] [2024-11-09 23:51:57,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607825464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:51:57,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:51:57,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:51:57,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059766518] [2024-11-09 23:51:57,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:51:57,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:51:57,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:51:57,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:51:57,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:51:57,196 INFO L87 Difference]: Start difference. First operand 704 states and 975 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:51:57,561 INFO L93 Difference]: Finished difference Result 1606 states and 2278 transitions. [2024-11-09 23:51:57,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:51:57,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-09 23:51:57,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:51:57,567 INFO L225 Difference]: With dead ends: 1606 [2024-11-09 23:51:57,567 INFO L226 Difference]: Without dead ends: 1051 [2024-11-09 23:51:57,568 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-09 23:51:57,569 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 1585 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:51:57,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 381 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:51:57,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-11-09 23:51:57,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1044. [2024-11-09 23:51:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 1040 states have (on average 1.4086538461538463) internal successors, (1465), 1043 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1465 transitions. [2024-11-09 23:51:57,598 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1465 transitions. Word has length 51 [2024-11-09 23:51:57,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:51:57,598 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1465 transitions. [2024-11-09 23:51:57,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:57,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1465 transitions. [2024-11-09 23:51:57,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 23:51:57,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:51:57,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:51:57,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:51:57,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:51:57,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:51:57,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2108983563, now seen corresponding path program 1 times [2024-11-09 23:51:57,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:51:57,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553271426] [2024-11-09 23:51:57,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:51:57,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:51:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:51:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:51:57,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:51:57,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553271426] [2024-11-09 23:51:57,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553271426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:51:57,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:51:57,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:51:57,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108530527] [2024-11-09 23:51:57,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:51:57,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:51:57,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:51:57,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:51:57,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:51:57,742 INFO L87 Difference]: Start difference. First operand 1044 states and 1465 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:57,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:51:57,807 INFO L93 Difference]: Finished difference Result 2082 states and 2982 transitions. [2024-11-09 23:51:57,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:51:57,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-09 23:51:57,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:51:57,815 INFO L225 Difference]: With dead ends: 2082 [2024-11-09 23:51:57,815 INFO L226 Difference]: Without dead ends: 1419 [2024-11-09 23:51:57,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:51:57,819 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 266 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:51:57,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 796 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:51:57,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2024-11-09 23:51:57,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1408. [2024-11-09 23:51:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1404 states have (on average 1.4066951566951567) internal successors, (1975), 1407 states have internal predecessors, (1975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1975 transitions. [2024-11-09 23:51:57,851 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1975 transitions. Word has length 51 [2024-11-09 23:51:57,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:51:57,852 INFO L471 AbstractCegarLoop]: Abstraction has 1408 states and 1975 transitions. [2024-11-09 23:51:57,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1975 transitions. [2024-11-09 23:51:57,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 23:51:57,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:51:57,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:51:57,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:51:57,855 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:51:57,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:51:57,855 INFO L85 PathProgramCache]: Analyzing trace with hash -342334421, now seen corresponding path program 1 times [2024-11-09 23:51:57,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:51:57,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363745775] [2024-11-09 23:51:57,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:51:57,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:51:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:51:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:51:57,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:51:57,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363745775] [2024-11-09 23:51:57,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363745775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:51:57,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:51:57,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:51:57,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043893360] [2024-11-09 23:51:57,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:51:57,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:51:57,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:51:57,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:51:57,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:51:57,979 INFO L87 Difference]: Start difference. First operand 1408 states and 1975 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:58,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:51:58,044 INFO L93 Difference]: Finished difference Result 2876 states and 4053 transitions. [2024-11-09 23:51:58,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:51:58,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-09 23:51:58,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:51:58,051 INFO L225 Difference]: With dead ends: 2876 [2024-11-09 23:51:58,051 INFO L226 Difference]: Without dead ends: 1836 [2024-11-09 23:51:58,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:51:58,054 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 330 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:51:58,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 864 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:51:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2024-11-09 23:51:58,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1818. [2024-11-09 23:51:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1814 states have (on average 1.3699007717750826) internal successors, (2485), 1817 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:58,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2485 transitions. [2024-11-09 23:51:58,097 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2485 transitions. Word has length 51 [2024-11-09 23:51:58,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:51:58,098 INFO L471 AbstractCegarLoop]: Abstraction has 1818 states and 2485 transitions. [2024-11-09 23:51:58,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:58,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2485 transitions. [2024-11-09 23:51:58,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 23:51:58,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:51:58,100 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] [2024-11-09 23:51:58,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:51:58,100 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:51:58,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:51:58,101 INFO L85 PathProgramCache]: Analyzing trace with hash -227915695, now seen corresponding path program 1 times [2024-11-09 23:51:58,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:51:58,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403681228] [2024-11-09 23:51:58,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:51:58,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:51:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:51:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:51:58,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:51:58,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403681228] [2024-11-09 23:51:58,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403681228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:51:58,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:51:58,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:51:58,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097512342] [2024-11-09 23:51:58,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:51:58,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:51:58,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:51:58,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:51:58,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:51:58,247 INFO L87 Difference]: Start difference. First operand 1818 states and 2485 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:51:58,516 INFO L93 Difference]: Finished difference Result 4097 states and 5660 transitions. [2024-11-09 23:51:58,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:51:58,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-09 23:51:58,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:51:58,526 INFO L225 Difference]: With dead ends: 4097 [2024-11-09 23:51:58,526 INFO L226 Difference]: Without dead ends: 2432 [2024-11-09 23:51:58,530 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-09 23:51:58,530 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 1473 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:51:58,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 366 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:51:58,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2024-11-09 23:51:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2417. [2024-11-09 23:51:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2417 states, 2413 states have (on average 1.3746373808537091) internal successors, (3317), 2416 states have internal predecessors, (3317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 3317 transitions. [2024-11-09 23:51:58,619 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 3317 transitions. Word has length 52 [2024-11-09 23:51:58,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:51:58,619 INFO L471 AbstractCegarLoop]: Abstraction has 2417 states and 3317 transitions. [2024-11-09 23:51:58,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 3317 transitions. [2024-11-09 23:51:58,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 23:51:58,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:51:58,621 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] [2024-11-09 23:51:58,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:51:58,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:51:58,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:51:58,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1819035285, now seen corresponding path program 1 times [2024-11-09 23:51:58,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:51:58,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074237575] [2024-11-09 23:51:58,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:51:58,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:51:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:51:58,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:51:58,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:51:58,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074237575] [2024-11-09 23:51:58,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074237575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:51:58,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:51:58,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:51:58,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116751535] [2024-11-09 23:51:58,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:51:58,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:51:58,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:51:58,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:51:58,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:51:58,824 INFO L87 Difference]: Start difference. First operand 2417 states and 3317 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:59,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:51:59,281 INFO L93 Difference]: Finished difference Result 6066 states and 8438 transitions. [2024-11-09 23:51:59,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:51:59,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-09 23:51:59,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:51:59,298 INFO L225 Difference]: With dead ends: 6066 [2024-11-09 23:51:59,299 INFO L226 Difference]: Without dead ends: 5044 [2024-11-09 23:51:59,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:51:59,303 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 2007 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:51:59,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 657 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:51:59,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5044 states. [2024-11-09 23:51:59,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5044 to 2451. [2024-11-09 23:51:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2451 states, 2447 states have (on average 1.3735185941969759) internal successors, (3361), 2450 states have internal predecessors, (3361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:59,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 3361 transitions. [2024-11-09 23:51:59,379 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 3361 transitions. Word has length 53 [2024-11-09 23:51:59,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:51:59,379 INFO L471 AbstractCegarLoop]: Abstraction has 2451 states and 3361 transitions. [2024-11-09 23:51:59,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:59,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 3361 transitions. [2024-11-09 23:51:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 23:51:59,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:51:59,381 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] [2024-11-09 23:51:59,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:51:59,381 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:51:59,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:51:59,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1870328112, now seen corresponding path program 1 times [2024-11-09 23:51:59,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:51:59,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532234297] [2024-11-09 23:51:59,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:51:59,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:51:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:51:59,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:51:59,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:51:59,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532234297] [2024-11-09 23:51:59,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532234297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:51:59,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:51:59,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:51:59,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272339027] [2024-11-09 23:51:59,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:51:59,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:51:59,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:51:59,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:51:59,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:51:59,575 INFO L87 Difference]: Start difference. First operand 2451 states and 3361 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:51:59,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:51:59,973 INFO L93 Difference]: Finished difference Result 4826 states and 6698 transitions. [2024-11-09 23:51:59,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:51:59,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-09 23:51:59,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:51:59,985 INFO L225 Difference]: With dead ends: 4826 [2024-11-09 23:51:59,985 INFO L226 Difference]: Without dead ends: 3724 [2024-11-09 23:51:59,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:51:59,989 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 1752 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:51:59,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 606 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:51:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2024-11-09 23:52:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 2465. [2024-11-09 23:52:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2465 states, 2461 states have (on average 1.3730190979276717) internal successors, (3379), 2464 states have internal predecessors, (3379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:00,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3379 transitions. [2024-11-09 23:52:00,049 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3379 transitions. Word has length 53 [2024-11-09 23:52:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:00,049 INFO L471 AbstractCegarLoop]: Abstraction has 2465 states and 3379 transitions. [2024-11-09 23:52:00,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:00,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3379 transitions. [2024-11-09 23:52:00,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 23:52:00,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:00,052 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] [2024-11-09 23:52:00,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:52:00,052 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:00,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:00,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1141577825, now seen corresponding path program 1 times [2024-11-09 23:52:00,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:00,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284692802] [2024-11-09 23:52:00,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:00,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:00,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:00,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284692802] [2024-11-09 23:52:00,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284692802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:00,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:00,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:52:00,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898505508] [2024-11-09 23:52:00,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:00,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:52:00,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:00,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:52:00,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:52:00,171 INFO L87 Difference]: Start difference. First operand 2465 states and 3379 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:00,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:00,635 INFO L93 Difference]: Finished difference Result 5282 states and 7353 transitions. [2024-11-09 23:52:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:52:00,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-09 23:52:00,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:00,649 INFO L225 Difference]: With dead ends: 5282 [2024-11-09 23:52:00,649 INFO L226 Difference]: Without dead ends: 4383 [2024-11-09 23:52:00,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:52:00,652 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 1880 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1880 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:00,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1880 Valid, 642 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:52:00,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2024-11-09 23:52:00,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 2487. [2024-11-09 23:52:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2487 states, 2483 states have (on average 1.373338703181635) internal successors, (3410), 2486 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3410 transitions. [2024-11-09 23:52:00,711 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3410 transitions. Word has length 53 [2024-11-09 23:52:00,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:00,712 INFO L471 AbstractCegarLoop]: Abstraction has 2487 states and 3410 transitions. [2024-11-09 23:52:00,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3410 transitions. [2024-11-09 23:52:00,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 23:52:00,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:00,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:52:00,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:52:00,715 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:00,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:00,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1352199114, now seen corresponding path program 1 times [2024-11-09 23:52:00,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:00,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73406111] [2024-11-09 23:52:00,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:00,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:01,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:01,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73406111] [2024-11-09 23:52:01,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73406111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:01,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:01,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:52:01,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072373427] [2024-11-09 23:52:01,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:01,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:52:01,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:01,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:52:01,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:52:01,028 INFO L87 Difference]: Start difference. First operand 2487 states and 3410 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:01,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:01,631 INFO L93 Difference]: Finished difference Result 5078 states and 7083 transitions. [2024-11-09 23:52:01,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:52:01,632 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-09 23:52:01,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:01,643 INFO L225 Difference]: With dead ends: 5078 [2024-11-09 23:52:01,643 INFO L226 Difference]: Without dead ends: 3435 [2024-11-09 23:52:01,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:52:01,647 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 1701 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:01,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 1007 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 23:52:01,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2024-11-09 23:52:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 2397. [2024-11-09 23:52:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2397 states, 2393 states have (on average 1.3715002089427497) internal successors, (3282), 2396 states have internal predecessors, (3282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 3282 transitions. [2024-11-09 23:52:01,706 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 3282 transitions. Word has length 54 [2024-11-09 23:52:01,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:01,706 INFO L471 AbstractCegarLoop]: Abstraction has 2397 states and 3282 transitions. [2024-11-09 23:52:01,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 3282 transitions. [2024-11-09 23:52:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 23:52:01,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:01,710 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:52:01,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:52:01,710 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:01,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:01,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2078228064, now seen corresponding path program 1 times [2024-11-09 23:52:01,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:01,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010363323] [2024-11-09 23:52:01,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:01,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:02,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:02,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010363323] [2024-11-09 23:52:02,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010363323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:02,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:02,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:52:02,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148322275] [2024-11-09 23:52:02,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:02,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:52:02,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:02,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:52:02,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:52:02,014 INFO L87 Difference]: Start difference. First operand 2397 states and 3282 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:02,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:02,726 INFO L93 Difference]: Finished difference Result 5186 states and 7201 transitions. [2024-11-09 23:52:02,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:52:02,726 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-09 23:52:02,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:02,738 INFO L225 Difference]: With dead ends: 5186 [2024-11-09 23:52:02,738 INFO L226 Difference]: Without dead ends: 3703 [2024-11-09 23:52:02,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:52:02,741 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 1796 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1796 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:02,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1796 Valid, 1336 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 23:52:02,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3703 states. [2024-11-09 23:52:02,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3703 to 2368. [2024-11-09 23:52:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2364 states have (on average 1.3709813874788495) internal successors, (3241), 2367 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3241 transitions. [2024-11-09 23:52:02,789 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3241 transitions. Word has length 54 [2024-11-09 23:52:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:02,789 INFO L471 AbstractCegarLoop]: Abstraction has 2368 states and 3241 transitions. [2024-11-09 23:52:02,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3241 transitions. [2024-11-09 23:52:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 23:52:02,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:02,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:52:02,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:52:02,792 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:02,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:02,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1099118870, now seen corresponding path program 1 times [2024-11-09 23:52:02,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:02,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111167533] [2024-11-09 23:52:02,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:02,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:03,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:03,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:03,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111167533] [2024-11-09 23:52:03,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111167533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:03,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:03,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:52:03,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546145934] [2024-11-09 23:52:03,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:03,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:52:03,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:03,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:52:03,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:52:03,096 INFO L87 Difference]: Start difference. First operand 2368 states and 3241 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:03,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:03,758 INFO L93 Difference]: Finished difference Result 3530 states and 4851 transitions. [2024-11-09 23:52:03,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:52:03,759 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-09 23:52:03,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:03,765 INFO L225 Difference]: With dead ends: 3530 [2024-11-09 23:52:03,765 INFO L226 Difference]: Without dead ends: 3525 [2024-11-09 23:52:03,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:52:03,767 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 1778 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1778 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:03,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1778 Valid, 1340 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 23:52:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2024-11-09 23:52:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 2368. [2024-11-09 23:52:03,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2364 states have (on average 1.370135363790186) internal successors, (3239), 2367 states have internal predecessors, (3239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3239 transitions. [2024-11-09 23:52:03,807 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3239 transitions. Word has length 54 [2024-11-09 23:52:03,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:03,807 INFO L471 AbstractCegarLoop]: Abstraction has 2368 states and 3239 transitions. [2024-11-09 23:52:03,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:03,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3239 transitions. [2024-11-09 23:52:03,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 23:52:03,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:03,809 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] [2024-11-09 23:52:03,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:52:03,810 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:03,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:03,810 INFO L85 PathProgramCache]: Analyzing trace with hash 882917103, now seen corresponding path program 1 times [2024-11-09 23:52:03,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:03,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159180989] [2024-11-09 23:52:03,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:03,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:03,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:03,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:03,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159180989] [2024-11-09 23:52:03,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159180989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:03,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:03,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:52:03,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885872795] [2024-11-09 23:52:03,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:03,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:52:03,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:03,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:52:03,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:03,876 INFO L87 Difference]: Start difference. First operand 2368 states and 3239 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:03,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:03,908 INFO L93 Difference]: Finished difference Result 3515 states and 4841 transitions. [2024-11-09 23:52:03,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:52:03,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-09 23:52:03,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:03,913 INFO L225 Difference]: With dead ends: 3515 [2024-11-09 23:52:03,913 INFO L226 Difference]: Without dead ends: 2359 [2024-11-09 23:52:03,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:03,915 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 266 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:03,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 831 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:52:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2024-11-09 23:52:03,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2353. [2024-11-09 23:52:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2353 states, 2349 states have (on average 1.3516389953171561) internal successors, (3175), 2352 states have internal predecessors, (3175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:03,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 3175 transitions. [2024-11-09 23:52:03,947 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 3175 transitions. Word has length 55 [2024-11-09 23:52:03,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:03,948 INFO L471 AbstractCegarLoop]: Abstraction has 2353 states and 3175 transitions. [2024-11-09 23:52:03,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:03,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 3175 transitions. [2024-11-09 23:52:03,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 23:52:03,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:03,950 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] [2024-11-09 23:52:03,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:52:03,951 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:03,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:03,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1710107370, now seen corresponding path program 1 times [2024-11-09 23:52:03,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:03,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654396519] [2024-11-09 23:52:03,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:03,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:04,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:04,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654396519] [2024-11-09 23:52:04,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654396519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:04,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:04,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:52:04,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65698616] [2024-11-09 23:52:04,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:04,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:52:04,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:04,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:52:04,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:04,009 INFO L87 Difference]: Start difference. First operand 2353 states and 3175 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:04,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:04,039 INFO L93 Difference]: Finished difference Result 3409 states and 4640 transitions. [2024-11-09 23:52:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:52:04,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-09 23:52:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:04,044 INFO L225 Difference]: With dead ends: 3409 [2024-11-09 23:52:04,044 INFO L226 Difference]: Without dead ends: 2359 [2024-11-09 23:52:04,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:04,046 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 247 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:04,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 825 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:52:04,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2024-11-09 23:52:04,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2353. [2024-11-09 23:52:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2353 states, 2349 states have (on average 1.3397190293742018) internal successors, (3147), 2352 states have internal predecessors, (3147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 3147 transitions. [2024-11-09 23:52:04,076 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 3147 transitions. Word has length 55 [2024-11-09 23:52:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:04,076 INFO L471 AbstractCegarLoop]: Abstraction has 2353 states and 3147 transitions. [2024-11-09 23:52:04,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:04,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 3147 transitions. [2024-11-09 23:52:04,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 23:52:04,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:04,079 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] [2024-11-09 23:52:04,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:52:04,079 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:04,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:04,079 INFO L85 PathProgramCache]: Analyzing trace with hash 327749359, now seen corresponding path program 1 times [2024-11-09 23:52:04,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:04,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105467563] [2024-11-09 23:52:04,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:04,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:04,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:04,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:04,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105467563] [2024-11-09 23:52:04,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105467563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:04,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:04,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:52:04,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013857964] [2024-11-09 23:52:04,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:04,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:52:04,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:04,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:52:04,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:04,138 INFO L87 Difference]: Start difference. First operand 2353 states and 3147 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:04,179 INFO L93 Difference]: Finished difference Result 3340 states and 4505 transitions. [2024-11-09 23:52:04,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:52:04,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-09 23:52:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:04,183 INFO L225 Difference]: With dead ends: 3340 [2024-11-09 23:52:04,184 INFO L226 Difference]: Without dead ends: 2360 [2024-11-09 23:52:04,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:04,185 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 231 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:04,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 819 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:52:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2024-11-09 23:52:04,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2353. [2024-11-09 23:52:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2353 states, 2349 states have (on average 1.326947637292465) internal successors, (3117), 2352 states have internal predecessors, (3117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 3117 transitions. [2024-11-09 23:52:04,214 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 3117 transitions. Word has length 55 [2024-11-09 23:52:04,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:04,214 INFO L471 AbstractCegarLoop]: Abstraction has 2353 states and 3117 transitions. [2024-11-09 23:52:04,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:04,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 3117 transitions. [2024-11-09 23:52:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 23:52:04,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:04,216 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:52:04,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:52:04,217 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:04,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:04,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1551160281, now seen corresponding path program 1 times [2024-11-09 23:52:04,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:04,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438227769] [2024-11-09 23:52:04,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:04,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:04,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:04,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438227769] [2024-11-09 23:52:04,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438227769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:04,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:04,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:52:04,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458609169] [2024-11-09 23:52:04,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:04,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:52:04,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:04,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:52:04,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:04,285 INFO L87 Difference]: Start difference. First operand 2353 states and 3117 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:04,344 INFO L93 Difference]: Finished difference Result 4231 states and 5670 transitions. [2024-11-09 23:52:04,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:52:04,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-09 23:52:04,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:04,348 INFO L225 Difference]: With dead ends: 4231 [2024-11-09 23:52:04,348 INFO L226 Difference]: Without dead ends: 2908 [2024-11-09 23:52:04,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:04,350 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 355 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:04,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 557 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:52:04,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2024-11-09 23:52:04,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2171. [2024-11-09 23:52:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2171 states, 2167 states have (on average 1.3294877711121367) internal successors, (2881), 2170 states have internal predecessors, (2881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 2881 transitions. [2024-11-09 23:52:04,376 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 2881 transitions. Word has length 56 [2024-11-09 23:52:04,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:04,376 INFO L471 AbstractCegarLoop]: Abstraction has 2171 states and 2881 transitions. [2024-11-09 23:52:04,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:04,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2881 transitions. [2024-11-09 23:52:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 23:52:04,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:04,378 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:52:04,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:52:04,379 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:04,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:04,379 INFO L85 PathProgramCache]: Analyzing trace with hash -401970833, now seen corresponding path program 1 times [2024-11-09 23:52:04,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:04,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744305382] [2024-11-09 23:52:04,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:04,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:05,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:05,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744305382] [2024-11-09 23:52:05,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744305382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:05,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:05,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 23:52:05,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543365325] [2024-11-09 23:52:05,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:05,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:52:05,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:05,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:52:05,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:52:05,051 INFO L87 Difference]: Start difference. First operand 2171 states and 2881 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:06,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:06,058 INFO L93 Difference]: Finished difference Result 5170 states and 6971 transitions. [2024-11-09 23:52:06,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 23:52:06,059 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-09 23:52:06,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:06,068 INFO L225 Difference]: With dead ends: 5170 [2024-11-09 23:52:06,068 INFO L226 Difference]: Without dead ends: 4941 [2024-11-09 23:52:06,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2024-11-09 23:52:06,071 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 3270 mSDsluCounter, 2313 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3270 SdHoareTripleChecker+Valid, 2698 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:06,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3270 Valid, 2698 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 23:52:06,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4941 states. [2024-11-09 23:52:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4941 to 2146. [2024-11-09 23:52:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 2143 states have (on average 1.33037797480168) internal successors, (2851), 2145 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:06,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2851 transitions. [2024-11-09 23:52:06,114 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2851 transitions. Word has length 57 [2024-11-09 23:52:06,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:06,115 INFO L471 AbstractCegarLoop]: Abstraction has 2146 states and 2851 transitions. [2024-11-09 23:52:06,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:06,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2851 transitions. [2024-11-09 23:52:06,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 23:52:06,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:06,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:52:06,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:52:06,118 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:06,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:06,118 INFO L85 PathProgramCache]: Analyzing trace with hash -567222550, now seen corresponding path program 1 times [2024-11-09 23:52:06,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:06,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758505458] [2024-11-09 23:52:06,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:06,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:06,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:06,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:06,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758505458] [2024-11-09 23:52:06,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758505458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:06,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:06,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 23:52:06,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964302465] [2024-11-09 23:52:06,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:06,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:52:06,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:06,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:52:06,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:52:06,674 INFO L87 Difference]: Start difference. First operand 2146 states and 2851 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:07,745 INFO L93 Difference]: Finished difference Result 5098 states and 6891 transitions. [2024-11-09 23:52:07,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 23:52:07,745 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-09 23:52:07,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:07,753 INFO L225 Difference]: With dead ends: 5098 [2024-11-09 23:52:07,753 INFO L226 Difference]: Without dead ends: 5094 [2024-11-09 23:52:07,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2024-11-09 23:52:07,757 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 2349 mSDsluCounter, 2621 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2349 SdHoareTripleChecker+Valid, 2944 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:07,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2349 Valid, 2944 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 23:52:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5094 states. [2024-11-09 23:52:07,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5094 to 2146. [2024-11-09 23:52:07,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 2143 states have (on average 1.3299113392440505) internal successors, (2850), 2145 states have internal predecessors, (2850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2850 transitions. [2024-11-09 23:52:07,795 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2850 transitions. Word has length 57 [2024-11-09 23:52:07,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:07,796 INFO L471 AbstractCegarLoop]: Abstraction has 2146 states and 2850 transitions. [2024-11-09 23:52:07,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:07,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2850 transitions. [2024-11-09 23:52:07,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 23:52:07,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:07,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:52:07,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 23:52:07,798 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:07,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:07,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1648786535, now seen corresponding path program 1 times [2024-11-09 23:52:07,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:07,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618919947] [2024-11-09 23:52:07,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:07,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:08,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:08,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:08,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618919947] [2024-11-09 23:52:08,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618919947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:08,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:08,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 23:52:08,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398786765] [2024-11-09 23:52:08,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:08,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 23:52:08,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:08,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 23:52:08,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:52:08,285 INFO L87 Difference]: Start difference. First operand 2146 states and 2850 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:08,971 INFO L93 Difference]: Finished difference Result 4404 states and 5914 transitions. [2024-11-09 23:52:08,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:52:08,972 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-09 23:52:08,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:08,978 INFO L225 Difference]: With dead ends: 4404 [2024-11-09 23:52:08,978 INFO L226 Difference]: Without dead ends: 4161 [2024-11-09 23:52:08,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2024-11-09 23:52:08,980 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 2594 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2594 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:08,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2594 Valid, 1622 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:52:08,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4161 states. [2024-11-09 23:52:09,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4161 to 2088. [2024-11-09 23:52:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2086 states have (on average 1.332214765100671) internal successors, (2779), 2087 states have internal predecessors, (2779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2779 transitions. [2024-11-09 23:52:09,016 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2779 transitions. Word has length 57 [2024-11-09 23:52:09,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:09,017 INFO L471 AbstractCegarLoop]: Abstraction has 2088 states and 2779 transitions. [2024-11-09 23:52:09,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:09,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2779 transitions. [2024-11-09 23:52:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 23:52:09,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:09,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:52:09,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 23:52:09,019 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:09,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:09,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1418748958, now seen corresponding path program 1 times [2024-11-09 23:52:09,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:09,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853984241] [2024-11-09 23:52:09,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:09,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:09,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:09,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853984241] [2024-11-09 23:52:09,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853984241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:09,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:09,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:52:09,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900382263] [2024-11-09 23:52:09,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:09,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:52:09,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:09,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:52:09,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:09,103 INFO L87 Difference]: Start difference. First operand 2088 states and 2779 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:09,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:09,161 INFO L93 Difference]: Finished difference Result 3835 states and 5154 transitions. [2024-11-09 23:52:09,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:52:09,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-09 23:52:09,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:09,165 INFO L225 Difference]: With dead ends: 3835 [2024-11-09 23:52:09,165 INFO L226 Difference]: Without dead ends: 2530 [2024-11-09 23:52:09,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:09,168 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 253 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:09,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 406 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:52:09,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2024-11-09 23:52:09,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 1961. [2024-11-09 23:52:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1960 states have (on average 1.3362244897959183) internal successors, (2619), 1960 states have internal predecessors, (2619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2619 transitions. [2024-11-09 23:52:09,191 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2619 transitions. Word has length 57 [2024-11-09 23:52:09,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:09,191 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 2619 transitions. [2024-11-09 23:52:09,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2619 transitions. [2024-11-09 23:52:09,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 23:52:09,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:09,194 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] [2024-11-09 23:52:09,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 23:52:09,194 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:09,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:09,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1259563301, now seen corresponding path program 1 times [2024-11-09 23:52:09,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:09,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089668377] [2024-11-09 23:52:09,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:09,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:09,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:09,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089668377] [2024-11-09 23:52:09,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089668377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:09,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:09,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:52:09,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944930158] [2024-11-09 23:52:09,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:09,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:52:09,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:09,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:52:09,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:52:09,277 INFO L87 Difference]: Start difference. First operand 1961 states and 2619 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:09,347 INFO L93 Difference]: Finished difference Result 4561 states and 6226 transitions. [2024-11-09 23:52:09,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:52:09,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-09 23:52:09,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:09,354 INFO L225 Difference]: With dead ends: 4561 [2024-11-09 23:52:09,354 INFO L226 Difference]: Without dead ends: 3362 [2024-11-09 23:52:09,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-09 23:52:09,356 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 1108 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:09,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 668 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:52:09,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2024-11-09 23:52:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 2954. [2024-11-09 23:52:09,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2954 states, 2953 states have (on average 1.333897731120894) internal successors, (3939), 2953 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3939 transitions. [2024-11-09 23:52:09,393 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3939 transitions. Word has length 67 [2024-11-09 23:52:09,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:09,393 INFO L471 AbstractCegarLoop]: Abstraction has 2954 states and 3939 transitions. [2024-11-09 23:52:09,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:09,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3939 transitions. [2024-11-09 23:52:09,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 23:52:09,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:09,397 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] [2024-11-09 23:52:09,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 23:52:09,398 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:09,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:09,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1687197243, now seen corresponding path program 1 times [2024-11-09 23:52:09,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:09,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15458744] [2024-11-09 23:52:09,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:09,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:09,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:09,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15458744] [2024-11-09 23:52:09,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15458744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:09,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:09,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:52:09,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476562581] [2024-11-09 23:52:09,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:09,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:52:09,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:09,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:52:09,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:52:09,512 INFO L87 Difference]: Start difference. First operand 2954 states and 3939 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:09,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:09,583 INFO L93 Difference]: Finished difference Result 2960 states and 3942 transitions. [2024-11-09 23:52:09,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:52:09,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-09 23:52:09,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:09,587 INFO L225 Difference]: With dead ends: 2960 [2024-11-09 23:52:09,587 INFO L226 Difference]: Without dead ends: 2465 [2024-11-09 23:52:09,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:52:09,588 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 705 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:09,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 770 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:52:09,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2024-11-09 23:52:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2461. [2024-11-09 23:52:09,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2461 states, 2460 states have (on average 1.3353658536585367) internal successors, (3285), 2460 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 3285 transitions. [2024-11-09 23:52:09,614 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 3285 transitions. Word has length 69 [2024-11-09 23:52:09,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:09,614 INFO L471 AbstractCegarLoop]: Abstraction has 2461 states and 3285 transitions. [2024-11-09 23:52:09,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3285 transitions. [2024-11-09 23:52:09,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 23:52:09,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:09,618 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] [2024-11-09 23:52:09,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 23:52:09,618 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:09,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:09,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2021441326, now seen corresponding path program 1 times [2024-11-09 23:52:09,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:09,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039570521] [2024-11-09 23:52:09,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:09,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:09,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:09,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039570521] [2024-11-09 23:52:09,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039570521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:09,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:09,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:52:09,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622824845] [2024-11-09 23:52:09,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:09,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:52:09,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:09,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:52:09,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:09,731 INFO L87 Difference]: Start difference. First operand 2461 states and 3285 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:09,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:09,804 INFO L93 Difference]: Finished difference Result 5799 states and 7851 transitions. [2024-11-09 23:52:09,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:52:09,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-11-09 23:52:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:09,811 INFO L225 Difference]: With dead ends: 5799 [2024-11-09 23:52:09,811 INFO L226 Difference]: Without dead ends: 4051 [2024-11-09 23:52:09,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:09,815 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 128 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:09,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 573 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:52:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4051 states. [2024-11-09 23:52:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4051 to 3801. [2024-11-09 23:52:09,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3801 states, 3800 states have (on average 1.3413157894736842) internal successors, (5097), 3800 states have internal predecessors, (5097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3801 states to 3801 states and 5097 transitions. [2024-11-09 23:52:09,873 INFO L78 Accepts]: Start accepts. Automaton has 3801 states and 5097 transitions. Word has length 70 [2024-11-09 23:52:09,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:09,874 INFO L471 AbstractCegarLoop]: Abstraction has 3801 states and 5097 transitions. [2024-11-09 23:52:09,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3801 states and 5097 transitions. [2024-11-09 23:52:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 23:52:09,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:09,878 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] [2024-11-09 23:52:09,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 23:52:09,878 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:09,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:09,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1864871664, now seen corresponding path program 1 times [2024-11-09 23:52:09,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:09,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36923212] [2024-11-09 23:52:09,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:09,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:10,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:10,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:10,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36923212] [2024-11-09 23:52:10,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36923212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:10,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:10,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:52:10,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087245443] [2024-11-09 23:52:10,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:10,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:52:10,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:10,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:52:10,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:10,003 INFO L87 Difference]: Start difference. First operand 3801 states and 5097 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:10,055 INFO L93 Difference]: Finished difference Result 9661 states and 13055 transitions. [2024-11-09 23:52:10,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:52:10,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-09 23:52:10,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:10,065 INFO L225 Difference]: With dead ends: 9661 [2024-11-09 23:52:10,066 INFO L226 Difference]: Without dead ends: 6573 [2024-11-09 23:52:10,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:10,071 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 115 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:10,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 557 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:52:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6573 states. [2024-11-09 23:52:10,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6573 to 6155. [2024-11-09 23:52:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6155 states, 6154 states have (on average 1.3414039649008775) internal successors, (8255), 6154 states have internal predecessors, (8255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6155 states to 6155 states and 8255 transitions. [2024-11-09 23:52:10,146 INFO L78 Accepts]: Start accepts. Automaton has 6155 states and 8255 transitions. Word has length 72 [2024-11-09 23:52:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:10,147 INFO L471 AbstractCegarLoop]: Abstraction has 6155 states and 8255 transitions. [2024-11-09 23:52:10,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 6155 states and 8255 transitions. [2024-11-09 23:52:10,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 23:52:10,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:10,150 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] [2024-11-09 23:52:10,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 23:52:10,150 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:10,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:10,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1994212786, now seen corresponding path program 1 times [2024-11-09 23:52:10,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:10,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817496920] [2024-11-09 23:52:10,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:10,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:10,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:10,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817496920] [2024-11-09 23:52:10,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817496920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:10,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:10,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:52:10,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935535248] [2024-11-09 23:52:10,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:10,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:52:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:10,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:52:10,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:10,209 INFO L87 Difference]: Start difference. First operand 6155 states and 8255 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:10,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:10,271 INFO L93 Difference]: Finished difference Result 16439 states and 22067 transitions. [2024-11-09 23:52:10,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:52:10,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-09 23:52:10,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:10,287 INFO L225 Difference]: With dead ends: 16439 [2024-11-09 23:52:10,288 INFO L226 Difference]: Without dead ends: 10835 [2024-11-09 23:52:10,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:10,297 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 216 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:10,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 423 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:52:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10835 states. [2024-11-09 23:52:10,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10835 to 10681. [2024-11-09 23:52:10,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10681 states, 10680 states have (on average 1.3118913857677903) internal successors, (14011), 10680 states have internal predecessors, (14011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10681 states to 10681 states and 14011 transitions. [2024-11-09 23:52:10,416 INFO L78 Accepts]: Start accepts. Automaton has 10681 states and 14011 transitions. Word has length 73 [2024-11-09 23:52:10,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:10,416 INFO L471 AbstractCegarLoop]: Abstraction has 10681 states and 14011 transitions. [2024-11-09 23:52:10,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 10681 states and 14011 transitions. [2024-11-09 23:52:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 23:52:10,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:10,420 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] [2024-11-09 23:52:10,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 23:52:10,421 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:10,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:10,421 INFO L85 PathProgramCache]: Analyzing trace with hash 495316176, now seen corresponding path program 1 times [2024-11-09 23:52:10,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:10,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605289597] [2024-11-09 23:52:10,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:10,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:10,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:10,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605289597] [2024-11-09 23:52:10,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605289597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:10,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:10,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:52:10,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972874309] [2024-11-09 23:52:10,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:10,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:52:10,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:10,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:52:10,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:10,550 INFO L87 Difference]: Start difference. First operand 10681 states and 14011 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:10,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:10,626 INFO L93 Difference]: Finished difference Result 26725 states and 35209 transitions. [2024-11-09 23:52:10,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:52:10,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-09 23:52:10,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:10,651 INFO L225 Difference]: With dead ends: 26725 [2024-11-09 23:52:10,652 INFO L226 Difference]: Without dead ends: 16595 [2024-11-09 23:52:10,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:10,666 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 122 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:10,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 566 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:52:10,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16595 states. [2024-11-09 23:52:10,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16595 to 14929. [2024-11-09 23:52:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14929 states, 14928 states have (on average 1.304863344051447) internal successors, (19479), 14928 states have internal predecessors, (19479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14929 states to 14929 states and 19479 transitions. [2024-11-09 23:52:10,849 INFO L78 Accepts]: Start accepts. Automaton has 14929 states and 19479 transitions. Word has length 73 [2024-11-09 23:52:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:10,849 INFO L471 AbstractCegarLoop]: Abstraction has 14929 states and 19479 transitions. [2024-11-09 23:52:10,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 14929 states and 19479 transitions. [2024-11-09 23:52:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 23:52:10,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:10,852 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] [2024-11-09 23:52:10,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 23:52:10,852 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:10,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:10,852 INFO L85 PathProgramCache]: Analyzing trace with hash 329497778, now seen corresponding path program 1 times [2024-11-09 23:52:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:10,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944997205] [2024-11-09 23:52:10,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:10,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:11,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:11,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944997205] [2024-11-09 23:52:11,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944997205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:11,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:11,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:52:11,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866265952] [2024-11-09 23:52:11,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:11,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:52:11,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:11,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:52:11,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:52:11,190 INFO L87 Difference]: Start difference. First operand 14929 states and 19479 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:11,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:11,251 INFO L93 Difference]: Finished difference Result 15767 states and 20544 transitions. [2024-11-09 23:52:11,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:52:11,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-09 23:52:11,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:11,273 INFO L225 Difference]: With dead ends: 15767 [2024-11-09 23:52:11,273 INFO L226 Difference]: Without dead ends: 15765 [2024-11-09 23:52:11,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:52:11,279 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 0 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:11,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1325 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:52:11,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15765 states. [2024-11-09 23:52:11,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15765 to 15765. [2024-11-09 23:52:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15765 states, 15764 states have (on average 1.2742324283176858) internal successors, (20087), 15764 states have internal predecessors, (20087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15765 states to 15765 states and 20087 transitions. [2024-11-09 23:52:11,447 INFO L78 Accepts]: Start accepts. Automaton has 15765 states and 20087 transitions. Word has length 74 [2024-11-09 23:52:11,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:11,448 INFO L471 AbstractCegarLoop]: Abstraction has 15765 states and 20087 transitions. [2024-11-09 23:52:11,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 15765 states and 20087 transitions. [2024-11-09 23:52:11,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 23:52:11,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:11,450 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] [2024-11-09 23:52:11,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 23:52:11,451 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:11,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:11,451 INFO L85 PathProgramCache]: Analyzing trace with hash -39920459, now seen corresponding path program 1 times [2024-11-09 23:52:11,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:11,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249897684] [2024-11-09 23:52:11,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:11,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:11,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:11,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249897684] [2024-11-09 23:52:11,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249897684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:11,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:11,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:52:11,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884587623] [2024-11-09 23:52:11,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:11,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:52:11,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:11,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:52:11,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:52:11,554 INFO L87 Difference]: Start difference. First operand 15765 states and 20087 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:11,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:11,660 INFO L93 Difference]: Finished difference Result 23067 states and 29519 transitions. [2024-11-09 23:52:11,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:52:11,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-09 23:52:11,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:11,687 INFO L225 Difference]: With dead ends: 23067 [2024-11-09 23:52:11,688 INFO L226 Difference]: Without dead ends: 19183 [2024-11-09 23:52:11,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:52:11,697 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 657 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:11,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 821 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:52:11,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19183 states. [2024-11-09 23:52:11,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19183 to 17863. [2024-11-09 23:52:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17863 states, 17862 states have (on average 1.270126525585041) internal successors, (22687), 17862 states have internal predecessors, (22687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17863 states to 17863 states and 22687 transitions. [2024-11-09 23:52:11,965 INFO L78 Accepts]: Start accepts. Automaton has 17863 states and 22687 transitions. Word has length 75 [2024-11-09 23:52:11,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:11,965 INFO L471 AbstractCegarLoop]: Abstraction has 17863 states and 22687 transitions. [2024-11-09 23:52:11,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 17863 states and 22687 transitions. [2024-11-09 23:52:11,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 23:52:11,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:11,973 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:52:11,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 23:52:11,974 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:11,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:11,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1057997804, now seen corresponding path program 1 times [2024-11-09 23:52:11,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:11,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206695564] [2024-11-09 23:52:11,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:11,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:12,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:12,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206695564] [2024-11-09 23:52:12,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206695564] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:52:12,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237226309] [2024-11-09 23:52:12,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:12,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:52:12,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:52:12,368 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:52:12,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:52:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:12,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:52:12,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:52:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:12,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:52:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:13,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237226309] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:52:13,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:52:13,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 19 [2024-11-09 23:52:13,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039615689] [2024-11-09 23:52:13,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:52:13,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 23:52:13,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:13,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 23:52:13,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:52:13,167 INFO L87 Difference]: Start difference. First operand 17863 states and 22687 transitions. Second operand has 19 states, 19 states have (on average 14.421052631578947) internal successors, (274), 19 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:16,023 INFO L93 Difference]: Finished difference Result 88656 states and 112094 transitions. [2024-11-09 23:52:16,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-09 23:52:16,024 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 14.421052631578947) internal successors, (274), 19 states have internal predecessors, (274), 0 states have call successors, (0), 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 96 [2024-11-09 23:52:16,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:16,113 INFO L225 Difference]: With dead ends: 88656 [2024-11-09 23:52:16,113 INFO L226 Difference]: Without dead ends: 71344 [2024-11-09 23:52:16,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=969, Invalid=4287, Unknown=0, NotChecked=0, Total=5256 [2024-11-09 23:52:16,132 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 4095 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4095 SdHoareTripleChecker+Valid, 2452 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:16,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4095 Valid, 2452 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2255 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 23:52:16,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71344 states. [2024-11-09 23:52:16,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71344 to 45905. [2024-11-09 23:52:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45905 states, 45904 states have (on average 1.2675583827117463) internal successors, (58186), 45904 states have internal predecessors, (58186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45905 states to 45905 states and 58186 transitions. [2024-11-09 23:52:16,823 INFO L78 Accepts]: Start accepts. Automaton has 45905 states and 58186 transitions. Word has length 96 [2024-11-09 23:52:16,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:16,823 INFO L471 AbstractCegarLoop]: Abstraction has 45905 states and 58186 transitions. [2024-11-09 23:52:16,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 14.421052631578947) internal successors, (274), 19 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:16,824 INFO L276 IsEmpty]: Start isEmpty. Operand 45905 states and 58186 transitions. [2024-11-09 23:52:16,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 23:52:16,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:16,842 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:52:16,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 23:52:17,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 23:52:17,044 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:17,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:17,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2032143706, now seen corresponding path program 1 times [2024-11-09 23:52:17,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:17,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162285472] [2024-11-09 23:52:17,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:17,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:17,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:17,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162285472] [2024-11-09 23:52:17,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162285472] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:52:17,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392716008] [2024-11-09 23:52:17,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:17,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:52:17,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:52:17,152 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:52:17,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 23:52:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:17,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:52:17,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:52:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:17,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:52:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:17,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392716008] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:52:17,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:52:17,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-11-09 23:52:17,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603601069] [2024-11-09 23:52:17,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:52:17,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 23:52:17,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:17,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 23:52:17,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:52:17,890 INFO L87 Difference]: Start difference. First operand 45905 states and 58186 transitions. Second operand has 14 states, 14 states have (on average 18.357142857142858) internal successors, (257), 14 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:18,838 INFO L93 Difference]: Finished difference Result 103619 states and 131225 transitions. [2024-11-09 23:52:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:52:18,839 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.357142857142858) internal successors, (257), 14 states have internal predecessors, (257), 0 states have call successors, (0), 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 97 [2024-11-09 23:52:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:18,944 INFO L225 Difference]: With dead ends: 103619 [2024-11-09 23:52:18,944 INFO L226 Difference]: Without dead ends: 58233 [2024-11-09 23:52:18,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:52:18,989 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1903 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1903 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:18,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1903 Valid, 993 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 23:52:19,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58233 states. [2024-11-09 23:52:19,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58233 to 48443. [2024-11-09 23:52:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48443 states, 48442 states have (on average 1.2486891540398828) internal successors, (60489), 48442 states have internal predecessors, (60489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48443 states to 48443 states and 60489 transitions. [2024-11-09 23:52:19,657 INFO L78 Accepts]: Start accepts. Automaton has 48443 states and 60489 transitions. Word has length 97 [2024-11-09 23:52:19,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:19,658 INFO L471 AbstractCegarLoop]: Abstraction has 48443 states and 60489 transitions. [2024-11-09 23:52:19,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.357142857142858) internal successors, (257), 14 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand 48443 states and 60489 transitions. [2024-11-09 23:52:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 23:52:19,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:19,669 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:52:19,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 23:52:19,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:52:19,871 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:19,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:19,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1391809837, now seen corresponding path program 1 times [2024-11-09 23:52:19,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:19,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010798959] [2024-11-09 23:52:19,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:19,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:19,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:19,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010798959] [2024-11-09 23:52:19,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010798959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:19,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:19,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:52:19,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792965510] [2024-11-09 23:52:19,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:19,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:52:19,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:19,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:52:19,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:52:19,961 INFO L87 Difference]: Start difference. First operand 48443 states and 60489 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:20,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:20,500 INFO L93 Difference]: Finished difference Result 97512 states and 121717 transitions. [2024-11-09 23:52:20,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:52:20,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-11-09 23:52:20,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:20,568 INFO L225 Difference]: With dead ends: 97512 [2024-11-09 23:52:20,568 INFO L226 Difference]: Without dead ends: 49668 [2024-11-09 23:52:20,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:52:20,606 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 481 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:20,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 477 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:52:20,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49668 states. [2024-11-09 23:52:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49668 to 46946. [2024-11-09 23:52:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46946 states, 46945 states have (on average 1.230482479497284) internal successors, (57765), 46945 states have internal predecessors, (57765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46946 states to 46946 states and 57765 transitions. [2024-11-09 23:52:21,291 INFO L78 Accepts]: Start accepts. Automaton has 46946 states and 57765 transitions. Word has length 97 [2024-11-09 23:52:21,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:21,292 INFO L471 AbstractCegarLoop]: Abstraction has 46946 states and 57765 transitions. [2024-11-09 23:52:21,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:21,292 INFO L276 IsEmpty]: Start isEmpty. Operand 46946 states and 57765 transitions. [2024-11-09 23:52:21,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 23:52:21,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:21,307 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:52:21,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 23:52:21,308 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:21,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:21,308 INFO L85 PathProgramCache]: Analyzing trace with hash -83031351, now seen corresponding path program 1 times [2024-11-09 23:52:21,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:21,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903663235] [2024-11-09 23:52:21,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:21,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:21,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:21,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903663235] [2024-11-09 23:52:21,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903663235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:21,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:21,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:52:21,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577919443] [2024-11-09 23:52:21,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:21,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:52:21,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:21,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:52:21,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:21,611 INFO L87 Difference]: Start difference. First operand 46946 states and 57765 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:21,778 INFO L93 Difference]: Finished difference Result 87073 states and 107121 transitions. [2024-11-09 23:52:21,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:52:21,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-11-09 23:52:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:21,844 INFO L225 Difference]: With dead ends: 87073 [2024-11-09 23:52:21,844 INFO L226 Difference]: Without dead ends: 63645 [2024-11-09 23:52:22,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:22,030 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 109 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:22,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 597 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:52:22,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63645 states. [2024-11-09 23:52:22,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63645 to 46904. [2024-11-09 23:52:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46904 states, 46903 states have (on average 1.2225230795471504) internal successors, (57340), 46903 states have internal predecessors, (57340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46904 states to 46904 states and 57340 transitions. [2024-11-09 23:52:22,603 INFO L78 Accepts]: Start accepts. Automaton has 46904 states and 57340 transitions. Word has length 101 [2024-11-09 23:52:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:22,603 INFO L471 AbstractCegarLoop]: Abstraction has 46904 states and 57340 transitions. [2024-11-09 23:52:22,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand 46904 states and 57340 transitions. [2024-11-09 23:52:22,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 23:52:22,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:22,615 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:52:22,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 23:52:22,615 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:22,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:22,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1227260196, now seen corresponding path program 1 times [2024-11-09 23:52:22,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:22,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329344996] [2024-11-09 23:52:22,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:22,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 23:52:22,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:22,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329344996] [2024-11-09 23:52:22,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329344996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:22,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:22,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:52:22,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683462259] [2024-11-09 23:52:22,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:22,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:52:22,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:22,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:52:22,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:52:22,785 INFO L87 Difference]: Start difference. First operand 46904 states and 57340 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:23,130 INFO L93 Difference]: Finished difference Result 69220 states and 85101 transitions. [2024-11-09 23:52:23,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:52:23,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 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 101 [2024-11-09 23:52:23,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:23,183 INFO L225 Difference]: With dead ends: 69220 [2024-11-09 23:52:23,183 INFO L226 Difference]: Without dead ends: 55029 [2024-11-09 23:52:23,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:52:23,200 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 590 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:23,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 770 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:52:23,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55029 states. [2024-11-09 23:52:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55029 to 53684. [2024-11-09 23:52:23,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53684 states, 53683 states have (on average 1.217219603971462) internal successors, (65344), 53683 states have internal predecessors, (65344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53684 states to 53684 states and 65344 transitions. [2024-11-09 23:52:23,754 INFO L78 Accepts]: Start accepts. Automaton has 53684 states and 65344 transitions. Word has length 101 [2024-11-09 23:52:23,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:23,755 INFO L471 AbstractCegarLoop]: Abstraction has 53684 states and 65344 transitions. [2024-11-09 23:52:23,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 53684 states and 65344 transitions. [2024-11-09 23:52:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 23:52:23,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:23,763 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:52:23,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 23:52:23,763 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:23,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:23,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1030707366, now seen corresponding path program 1 times [2024-11-09 23:52:23,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:23,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085554006] [2024-11-09 23:52:23,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:23,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:23,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:23,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085554006] [2024-11-09 23:52:23,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085554006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:23,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:23,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:52:23,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201305837] [2024-11-09 23:52:23,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:23,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:52:23,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:23,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:52:23,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:52:23,878 INFO L87 Difference]: Start difference. First operand 53684 states and 65344 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:24,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:24,297 INFO L93 Difference]: Finished difference Result 65634 states and 80216 transitions. [2024-11-09 23:52:24,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:52:24,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-11-09 23:52:24,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:24,380 INFO L225 Difference]: With dead ends: 65634 [2024-11-09 23:52:24,381 INFO L226 Difference]: Without dead ends: 59542 [2024-11-09 23:52:24,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:52:24,402 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 589 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:24,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 780 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:52:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59542 states. [2024-11-09 23:52:24,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59542 to 58197. [2024-11-09 23:52:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58197 states, 58196 states have (on average 1.2159083098494743) internal successors, (70761), 58196 states have internal predecessors, (70761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:25,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58197 states to 58197 states and 70761 transitions. [2024-11-09 23:52:25,125 INFO L78 Accepts]: Start accepts. Automaton has 58197 states and 70761 transitions. Word has length 101 [2024-11-09 23:52:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:25,126 INFO L471 AbstractCegarLoop]: Abstraction has 58197 states and 70761 transitions. [2024-11-09 23:52:25,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 58197 states and 70761 transitions. [2024-11-09 23:52:25,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 23:52:25,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:25,137 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:52:25,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 23:52:25,138 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:25,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:25,138 INFO L85 PathProgramCache]: Analyzing trace with hash 201320464, now seen corresponding path program 1 times [2024-11-09 23:52:25,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:25,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036142240] [2024-11-09 23:52:25,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:25,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:25,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 23:52:25,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:25,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036142240] [2024-11-09 23:52:25,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036142240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:25,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:25,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:52:25,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512034229] [2024-11-09 23:52:25,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:25,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:52:25,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:25,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:52:25,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:52:25,302 INFO L87 Difference]: Start difference. First operand 58197 states and 70761 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:25,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:25,818 INFO L93 Difference]: Finished difference Result 84663 states and 102375 transitions. [2024-11-09 23:52:25,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:52:25,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 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-09 23:52:25,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:25,908 INFO L225 Difference]: With dead ends: 84663 [2024-11-09 23:52:25,908 INFO L226 Difference]: Without dead ends: 74335 [2024-11-09 23:52:25,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:52:25,937 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1145 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:25,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 523 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:52:25,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74335 states. [2024-11-09 23:52:26,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74335 to 58242. [2024-11-09 23:52:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58242 states, 58241 states have (on average 1.2158616781992067) internal successors, (70813), 58241 states have internal predecessors, (70813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58242 states to 58242 states and 70813 transitions. [2024-11-09 23:52:26,818 INFO L78 Accepts]: Start accepts. Automaton has 58242 states and 70813 transitions. Word has length 105 [2024-11-09 23:52:26,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:26,818 INFO L471 AbstractCegarLoop]: Abstraction has 58242 states and 70813 transitions. [2024-11-09 23:52:26,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 58242 states and 70813 transitions. [2024-11-09 23:52:27,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 23:52:27,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:27,101 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:52:27,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 23:52:27,102 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:27,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:27,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1464439694, now seen corresponding path program 1 times [2024-11-09 23:52:27,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:27,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936453563] [2024-11-09 23:52:27,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:27,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:27,173 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 23:52:27,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:27,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936453563] [2024-11-09 23:52:27,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936453563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:27,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:27,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:52:27,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528387157] [2024-11-09 23:52:27,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:27,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:52:27,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:27,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:52:27,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:27,176 INFO L87 Difference]: Start difference. First operand 58242 states and 70813 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-09 23:52:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:27,435 INFO L93 Difference]: Finished difference Result 108824 states and 132419 transitions. [2024-11-09 23:52:27,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:52:27,436 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 107 [2024-11-09 23:52:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:27,501 INFO L225 Difference]: With dead ends: 108824 [2024-11-09 23:52:27,502 INFO L226 Difference]: Without dead ends: 51226 [2024-11-09 23:52:27,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:27,537 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 189 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:27,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 246 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:52:27,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51226 states. [2024-11-09 23:52:28,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51226 to 50181. [2024-11-09 23:52:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50181 states, 50180 states have (on average 1.1991430848943803) internal successors, (60173), 50180 states have internal predecessors, (60173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50181 states to 50181 states and 60173 transitions. [2024-11-09 23:52:28,219 INFO L78 Accepts]: Start accepts. Automaton has 50181 states and 60173 transitions. Word has length 107 [2024-11-09 23:52:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:28,219 INFO L471 AbstractCegarLoop]: Abstraction has 50181 states and 60173 transitions. [2024-11-09 23:52:28,219 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-09 23:52:28,219 INFO L276 IsEmpty]: Start isEmpty. Operand 50181 states and 60173 transitions. [2024-11-09 23:52:28,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 23:52:28,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:28,227 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:52:28,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-09 23:52:28,227 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:28,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:28,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1033481910, now seen corresponding path program 1 times [2024-11-09 23:52:28,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:28,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712867143] [2024-11-09 23:52:28,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:28,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:28,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:28,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712867143] [2024-11-09 23:52:28,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712867143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:52:28,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068646546] [2024-11-09 23:52:28,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:28,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:52:28,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:52:28,334 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:52:28,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 23:52:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:28,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:52:28,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:52:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:28,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:52:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:28,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068646546] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:52:28,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:52:28,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-11-09 23:52:28,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362796332] [2024-11-09 23:52:28,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:52:28,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 23:52:28,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:28,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 23:52:28,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:52:28,996 INFO L87 Difference]: Start difference. First operand 50181 states and 60173 transitions. Second operand has 14 states, 14 states have (on average 20.928571428571427) internal successors, (293), 14 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:29,524 INFO L93 Difference]: Finished difference Result 112424 states and 134515 transitions. [2024-11-09 23:52:29,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:52:29,525 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.928571428571427) internal successors, (293), 14 states have internal predecessors, (293), 0 states have call successors, (0), 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-09 23:52:29,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:29,974 INFO L225 Difference]: With dead ends: 112424 [2024-11-09 23:52:29,975 INFO L226 Difference]: Without dead ends: 62893 [2024-11-09 23:52:30,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:52:30,007 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1129 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:30,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 1001 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:52:30,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62893 states. [2024-11-09 23:52:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62893 to 54993. [2024-11-09 23:52:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54993 states, 54992 states have (on average 1.1967922606924644) internal successors, (65814), 54992 states have internal predecessors, (65814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:30,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54993 states to 54993 states and 65814 transitions. [2024-11-09 23:52:30,706 INFO L78 Accepts]: Start accepts. Automaton has 54993 states and 65814 transitions. Word has length 107 [2024-11-09 23:52:30,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:30,707 INFO L471 AbstractCegarLoop]: Abstraction has 54993 states and 65814 transitions. [2024-11-09 23:52:30,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.928571428571427) internal successors, (293), 14 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:30,707 INFO L276 IsEmpty]: Start isEmpty. Operand 54993 states and 65814 transitions. [2024-11-09 23:52:30,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 23:52:30,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:30,722 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:52:30,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 23:52:30,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:52:30,923 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:30,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:30,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2113419863, now seen corresponding path program 1 times [2024-11-09 23:52:30,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:30,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645635018] [2024-11-09 23:52:30,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:30,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 23:52:31,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:31,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645635018] [2024-11-09 23:52:31,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645635018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:31,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:31,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:52:31,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304413163] [2024-11-09 23:52:31,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:31,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:52:31,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:31,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:52:31,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:52:31,273 INFO L87 Difference]: Start difference. First operand 54993 states and 65814 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 8 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-09 23:52:32,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:32,034 INFO L93 Difference]: Finished difference Result 91515 states and 109370 transitions. [2024-11-09 23:52:32,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:52:32,034 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 8 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 108 [2024-11-09 23:52:32,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:32,094 INFO L225 Difference]: With dead ends: 91515 [2024-11-09 23:52:32,094 INFO L226 Difference]: Without dead ends: 55032 [2024-11-09 23:52:32,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:52:32,123 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1066 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:32,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 690 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 23:52:32,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55032 states. [2024-11-09 23:52:32,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55032 to 54939. [2024-11-09 23:52:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54939 states, 54938 states have (on average 1.1968218719283557) internal successors, (65751), 54938 states have internal predecessors, (65751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:32,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54939 states to 54939 states and 65751 transitions. [2024-11-09 23:52:32,628 INFO L78 Accepts]: Start accepts. Automaton has 54939 states and 65751 transitions. Word has length 108 [2024-11-09 23:52:32,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:32,628 INFO L471 AbstractCegarLoop]: Abstraction has 54939 states and 65751 transitions. [2024-11-09 23:52:32,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 8 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-09 23:52:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand 54939 states and 65751 transitions. [2024-11-09 23:52:32,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 23:52:32,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:32,644 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:52:32,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-09 23:52:32,645 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:32,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:32,645 INFO L85 PathProgramCache]: Analyzing trace with hash -304924421, now seen corresponding path program 1 times [2024-11-09 23:52:32,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:32,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938444939] [2024-11-09 23:52:32,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:32,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 23:52:33,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:33,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938444939] [2024-11-09 23:52:33,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938444939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:33,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:33,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:52:33,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433726525] [2024-11-09 23:52:33,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:33,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:52:33,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:33,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:52:33,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:33,046 INFO L87 Difference]: Start difference. First operand 54939 states and 65751 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-09 23:52:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:33,240 INFO L93 Difference]: Finished difference Result 69888 states and 83725 transitions. [2024-11-09 23:52:33,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:52:33,240 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 108 [2024-11-09 23:52:33,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:33,315 INFO L225 Difference]: With dead ends: 69888 [2024-11-09 23:52:33,316 INFO L226 Difference]: Without dead ends: 51683 [2024-11-09 23:52:33,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:33,340 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 195 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:33,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 345 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:52:33,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51683 states. [2024-11-09 23:52:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51683 to 51639. [2024-11-09 23:52:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51639 states, 51638 states have (on average 1.1933653510980287) internal successors, (61623), 51638 states have internal predecessors, (61623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:33,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51639 states to 51639 states and 61623 transitions. [2024-11-09 23:52:33,793 INFO L78 Accepts]: Start accepts. Automaton has 51639 states and 61623 transitions. Word has length 108 [2024-11-09 23:52:33,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:33,793 INFO L471 AbstractCegarLoop]: Abstraction has 51639 states and 61623 transitions. [2024-11-09 23:52:33,793 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-09 23:52:33,793 INFO L276 IsEmpty]: Start isEmpty. Operand 51639 states and 61623 transitions. [2024-11-09 23:52:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 23:52:33,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:33,800 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:52:33,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-09 23:52:33,800 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:33,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:33,800 INFO L85 PathProgramCache]: Analyzing trace with hash -641975817, now seen corresponding path program 1 times [2024-11-09 23:52:33,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:33,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475043124] [2024-11-09 23:52:33,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:33,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:33,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:33,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475043124] [2024-11-09 23:52:33,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475043124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:52:33,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:52:33,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:52:33,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131416252] [2024-11-09 23:52:33,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:52:33,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:52:33,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:33,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:52:33,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:33,890 INFO L87 Difference]: Start difference. First operand 51639 states and 61623 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 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-09 23:52:34,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:52:34,247 INFO L93 Difference]: Finished difference Result 101189 states and 120837 transitions. [2024-11-09 23:52:34,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:52:34,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 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-09 23:52:34,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:52:34,316 INFO L225 Difference]: With dead ends: 101189 [2024-11-09 23:52:34,317 INFO L226 Difference]: Without dead ends: 50025 [2024-11-09 23:52:34,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:52:34,354 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 106 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:52:34,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 396 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:52:34,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50025 states. [2024-11-09 23:52:34,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50025 to 48943. [2024-11-09 23:52:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48943 states, 48942 states have (on average 1.1677904458338442) internal successors, (57154), 48942 states have internal predecessors, (57154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:52:34,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48943 states to 48943 states and 57154 transitions. [2024-11-09 23:52:34,784 INFO L78 Accepts]: Start accepts. Automaton has 48943 states and 57154 transitions. Word has length 109 [2024-11-09 23:52:34,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:52:34,784 INFO L471 AbstractCegarLoop]: Abstraction has 48943 states and 57154 transitions. [2024-11-09 23:52:34,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 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-09 23:52:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 48943 states and 57154 transitions. [2024-11-09 23:52:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 23:52:34,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:52:34,789 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:52:34,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-09 23:52:34,789 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 23:52:34,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:52:34,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1202751873, now seen corresponding path program 1 times [2024-11-09 23:52:34,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:52:34,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53132321] [2024-11-09 23:52:34,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:34,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:52:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:35,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:52:35,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53132321] [2024-11-09 23:52:35,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53132321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:52:35,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990008738] [2024-11-09 23:52:35,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:52:35,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:52:35,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:52:35,669 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:52:35,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 23:52:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:52:35,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 23:52:35,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:52:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:38,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:52:39,277 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:52:39,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990008738] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:52:39,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:52:39,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 14] total 39 [2024-11-09 23:52:39,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698041359] [2024-11-09 23:52:39,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:52:39,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 23:52:39,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:52:39,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 23:52:39,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1344, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 23:52:39,281 INFO L87 Difference]: Start difference. First operand 48943 states and 57154 transitions. Second operand has 39 states, 39 states have (on average 7.717948717948718) internal successors, (301), 39 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)