./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b86eed5380d57cac13df908fa4bd28a3c3af485a2a70f27e08920aaaec0ccb21 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:01:34,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:01:35,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:01:35,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:01:35,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:01:35,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:01:35,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:01:35,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:01:35,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:01:35,053 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:01:35,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:01:35,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:01:35,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:01:35,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:01:35,058 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:01:35,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:01:35,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:01:35,059 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:01:35,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:01:35,060 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:01:35,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:01:35,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:01:35,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:01:35,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:01:35,063 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:01:35,063 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:01:35,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:01:35,064 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:01:35,064 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:01:35,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:01:35,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:01:35,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:01:35,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:01:35,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:01:35,066 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:01:35,066 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:01:35,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:01:35,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:01:35,067 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:01:35,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:01:35,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:01:35,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:01:35,069 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 -> b86eed5380d57cac13df908fa4bd28a3c3af485a2a70f27e08920aaaec0ccb21 [2024-11-10 00:01:35,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:01:35,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:01:35,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:01:35,401 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:01:35,402 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:01:35,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2024-11-10 00:01:37,042 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:01:37,300 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:01:37,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2024-11-10 00:01:37,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d20b714c/8b10aadffea447bca4b54753e7db405e/FLAG6f96e9e92 [2024-11-10 00:01:37,330 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d20b714c/8b10aadffea447bca4b54753e7db405e [2024-11-10 00:01:37,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:01:37,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:01:37,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:01:37,338 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:01:37,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:01:37,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:01:37" (1/1) ... [2024-11-10 00:01:37,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ad16cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:37, skipping insertion in model container [2024-11-10 00:01:37,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:01:37" (1/1) ... [2024-11-10 00:01:37,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:01:37,638 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.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c[6696,6709] [2024-11-10 00:01:37,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:01:37,707 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:01:37,755 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.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c[6696,6709] [2024-11-10 00:01:37,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:01:37,799 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:01:37,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:37 WrapperNode [2024-11-10 00:01:37,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:01:37,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:01:37,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:01:37,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:01:37,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:37" (1/1) ... [2024-11-10 00:01:37,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:37" (1/1) ... [2024-11-10 00:01:37,859 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 542 [2024-11-10 00:01:37,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:01:37,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:01:37,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:01:37,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:01:37,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:37" (1/1) ... [2024-11-10 00:01:37,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:37" (1/1) ... [2024-11-10 00:01:37,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:37" (1/1) ... [2024-11-10 00:01:37,903 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 00:01:37,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:37" (1/1) ... [2024-11-10 00:01:37,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:37" (1/1) ... [2024-11-10 00:01:37,917 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:37" (1/1) ... [2024-11-10 00:01:37,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:37" (1/1) ... [2024-11-10 00:01:37,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:37" (1/1) ... [2024-11-10 00:01:37,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:37" (1/1) ... [2024-11-10 00:01:37,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:01:37,936 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:01:37,936 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:01:37,936 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:01:37,938 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:37" (1/1) ... [2024-11-10 00:01:37,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:01:37,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:01:37,982 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:01:37,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:01:38,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:01:38,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:01:38,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:01:38,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:01:38,215 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:01:38,217 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:01:38,781 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L630: havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-10 00:01:38,782 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L449: havoc main_~node5____CPAchecker_TMP_0~0#1; [2024-11-10 00:01:38,782 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L584: havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-10 00:01:38,782 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L404: havoc main_~node6____CPAchecker_TMP_0~0#1; [2024-11-10 00:01:38,782 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L291: havoc main_~node6__m6~0#1;havoc main_~node5__m5~0#1; [2024-11-10 00:01:38,783 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L291: havoc main_~node6__m6~0#1;havoc main_~node5__m5~0#1; [2024-11-10 00:01:38,783 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L291: havoc main_~node6__m6~0#1;havoc main_~node5__m5~0#1; [2024-11-10 00:01:38,783 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L539: havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-10 00:01:38,783 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc main_~init__tmp~0#1; [2024-11-10 00:01:38,783 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc main_~node4__m4~0#1;havoc main_~node3__m3~0#1; [2024-11-10 00:01:38,783 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc main_~node4__m4~0#1;havoc main_~node3__m3~0#1; [2024-11-10 00:01:38,784 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc main_~node4__m4~0#1;havoc main_~node3__m3~0#1; [2024-11-10 00:01:38,784 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L344: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:01:38,784 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L344: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:01:38,785 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L344: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:01:38,786 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L344: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:01:38,786 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L344: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:01:38,787 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L494: havoc main_~node4____CPAchecker_TMP_0~0#1; [2024-11-10 00:01:38,787 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L231: havoc main_~node2__m2~0#1;havoc main_~node1__m1~0#1; [2024-11-10 00:01:38,787 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L231: havoc main_~node2__m2~0#1;havoc main_~node1__m1~0#1; [2024-11-10 00:01:38,787 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L231: havoc main_~node2__m2~0#1;havoc main_~node1__m1~0#1; [2024-11-10 00:01:38,824 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-10 00:01:38,827 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:01:38,851 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:01:38,854 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:01:38,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:01:38 BoogieIcfgContainer [2024-11-10 00:01:38,854 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:01:38,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:01:38,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:01:38,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:01:38,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:01:37" (1/3) ... [2024-11-10 00:01:38,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c99bc3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:01:38, skipping insertion in model container [2024-11-10 00:01:38,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:37" (2/3) ... [2024-11-10 00:01:38,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c99bc3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:01:38, skipping insertion in model container [2024-11-10 00:01:38,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:01:38" (3/3) ... [2024-11-10 00:01:38,867 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2024-11-10 00:01:38,889 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:01:38,890 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 00:01:38,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:01:38,974 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;@60f5d1f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:01:38,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 00:01:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 119 states have (on average 1.7142857142857142) internal successors, (204), 120 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:38,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 00:01:38,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:38,995 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-10 00:01:38,996 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:39,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:39,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1623482059, now seen corresponding path program 1 times [2024-11-10 00:01:39,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:39,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690263001] [2024-11-10 00:01:39,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:39,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:01:39,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:39,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690263001] [2024-11-10 00:01:39,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690263001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:39,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:39,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:39,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045309656] [2024-11-10 00:01:39,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:39,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:39,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:39,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:39,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:39,663 INFO L87 Difference]: Start difference. First operand has 121 states, 119 states have (on average 1.7142857142857142) internal successors, (204), 120 states have internal predecessors, (204), 0 states have call successors, (0), 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 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-10 00:01:39,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:39,755 INFO L93 Difference]: Finished difference Result 267 states and 429 transitions. [2024-11-10 00:01:39,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:39,759 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-10 00:01:39,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:39,773 INFO L225 Difference]: With dead ends: 267 [2024-11-10 00:01:39,774 INFO L226 Difference]: Without dead ends: 183 [2024-11-10 00:01:39,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:39,784 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 143 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:39,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 418 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:01:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-10 00:01:39,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2024-11-10 00:01:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.4333333333333333) internal successors, (258), 180 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 258 transitions. [2024-11-10 00:01:39,845 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 258 transitions. Word has length 73 [2024-11-10 00:01:39,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:39,846 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 258 transitions. [2024-11-10 00:01:39,846 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-10 00:01:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 258 transitions. [2024-11-10 00:01:39,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 00:01:39,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:39,849 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-10 00:01:39,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:01:39,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:39,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:39,851 INFO L85 PathProgramCache]: Analyzing trace with hash 740852773, now seen corresponding path program 1 times [2024-11-10 00:01:39,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:39,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941308762] [2024-11-10 00:01:39,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:39,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:01:40,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:40,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941308762] [2024-11-10 00:01:40,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941308762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:40,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:40,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:40,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858151852] [2024-11-10 00:01:40,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:40,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:40,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:40,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:40,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:40,029 INFO L87 Difference]: Start difference. First operand 181 states and 258 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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-10 00:01:40,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:40,070 INFO L93 Difference]: Finished difference Result 441 states and 662 transitions. [2024-11-10 00:01:40,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:40,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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-10 00:01:40,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:40,074 INFO L225 Difference]: With dead ends: 441 [2024-11-10 00:01:40,074 INFO L226 Difference]: Without dead ends: 303 [2024-11-10 00:01:40,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:40,077 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 99 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:40,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 361 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:01:40,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-10 00:01:40,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2024-11-10 00:01:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.48) internal successors, (444), 300 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 444 transitions. [2024-11-10 00:01:40,101 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 444 transitions. Word has length 74 [2024-11-10 00:01:40,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:40,102 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 444 transitions. [2024-11-10 00:01:40,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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-10 00:01:40,106 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 444 transitions. [2024-11-10 00:01:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 00:01:40,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:40,108 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-10 00:01:40,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:01:40,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:40,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:40,111 INFO L85 PathProgramCache]: Analyzing trace with hash -818058269, now seen corresponding path program 1 times [2024-11-10 00:01:40,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:40,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325138024] [2024-11-10 00:01:40,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:40,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:40,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:01:40,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:40,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325138024] [2024-11-10 00:01:40,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325138024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:40,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:40,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:40,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162660815] [2024-11-10 00:01:40,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:40,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:40,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:40,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:40,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:40,275 INFO L87 Difference]: Start difference. First operand 301 states and 444 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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-10 00:01:40,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:40,317 INFO L93 Difference]: Finished difference Result 785 states and 1194 transitions. [2024-11-10 00:01:40,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:40,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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-10 00:01:40,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:40,320 INFO L225 Difference]: With dead ends: 785 [2024-11-10 00:01:40,321 INFO L226 Difference]: Without dead ends: 527 [2024-11-10 00:01:40,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:40,324 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 94 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:40,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 357 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:01:40,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-10 00:01:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 525. [2024-11-10 00:01:40,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 524 states have (on average 1.5038167938931297) internal successors, (788), 524 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 788 transitions. [2024-11-10 00:01:40,366 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 788 transitions. Word has length 75 [2024-11-10 00:01:40,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:40,367 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 788 transitions. [2024-11-10 00:01:40,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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-10 00:01:40,367 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 788 transitions. [2024-11-10 00:01:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 00:01:40,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:40,369 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:40,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:01:40,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:40,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:40,370 INFO L85 PathProgramCache]: Analyzing trace with hash -774897104, now seen corresponding path program 1 times [2024-11-10 00:01:40,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:40,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436520404] [2024-11-10 00:01:40,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:40,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:40,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:01:40,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:40,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436520404] [2024-11-10 00:01:40,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436520404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:40,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:40,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:40,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250811212] [2024-11-10 00:01:40,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:40,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:40,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:40,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:40,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:40,509 INFO L87 Difference]: Start difference. First operand 525 states and 788 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:40,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:40,546 INFO L93 Difference]: Finished difference Result 1425 states and 2174 transitions. [2024-11-10 00:01:40,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:40,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-10 00:01:40,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:40,552 INFO L225 Difference]: With dead ends: 1425 [2024-11-10 00:01:40,552 INFO L226 Difference]: Without dead ends: 943 [2024-11-10 00:01:40,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:40,557 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 89 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:40,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 353 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:01:40,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-10 00:01:40,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 941. [2024-11-10 00:01:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 940 states have (on average 1.5106382978723405) internal successors, (1420), 940 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1420 transitions. [2024-11-10 00:01:40,585 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1420 transitions. Word has length 76 [2024-11-10 00:01:40,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:40,586 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1420 transitions. [2024-11-10 00:01:40,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:40,587 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1420 transitions. [2024-11-10 00:01:40,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 00:01:40,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:40,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:40,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:01:40,589 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:40,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:40,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1005834191, now seen corresponding path program 1 times [2024-11-10 00:01:40,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:40,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345468445] [2024-11-10 00:01:40,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:40,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:40,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-10 00:01:40,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:40,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345468445] [2024-11-10 00:01:40,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345468445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:40,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:40,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:40,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90010543] [2024-11-10 00:01:40,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:40,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:40,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:40,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:40,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:40,743 INFO L87 Difference]: Start difference. First operand 941 states and 1420 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:40,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:40,789 INFO L93 Difference]: Finished difference Result 2609 states and 3966 transitions. [2024-11-10 00:01:40,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:40,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-10 00:01:40,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:40,798 INFO L225 Difference]: With dead ends: 2609 [2024-11-10 00:01:40,799 INFO L226 Difference]: Without dead ends: 1711 [2024-11-10 00:01:40,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:40,803 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 84 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:40,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 349 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:01:40,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2024-11-10 00:01:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1709. [2024-11-10 00:01:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1708 states have (on average 1.505854800936768) internal successors, (2572), 1708 states have internal predecessors, (2572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:40,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2572 transitions. [2024-11-10 00:01:40,854 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2572 transitions. Word has length 77 [2024-11-10 00:01:40,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:40,856 INFO L471 AbstractCegarLoop]: Abstraction has 1709 states and 2572 transitions. [2024-11-10 00:01:40,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:40,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2572 transitions. [2024-11-10 00:01:40,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 00:01:40,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:40,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:40,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:01:40,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:40,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:40,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1494957157, now seen corresponding path program 1 times [2024-11-10 00:01:40,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:40,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069949504] [2024-11-10 00:01:40,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:40,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:01:40,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:40,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069949504] [2024-11-10 00:01:40,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069949504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:40,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:40,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:40,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875365536] [2024-11-10 00:01:40,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:40,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:41,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:41,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:41,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:41,001 INFO L87 Difference]: Start difference. First operand 1709 states and 2572 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:41,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:41,043 INFO L93 Difference]: Finished difference Result 4785 states and 7214 transitions. [2024-11-10 00:01:41,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:41,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-10 00:01:41,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:41,056 INFO L225 Difference]: With dead ends: 4785 [2024-11-10 00:01:41,056 INFO L226 Difference]: Without dead ends: 3119 [2024-11-10 00:01:41,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:41,061 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 79 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:41,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 345 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:01:41,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3119 states. [2024-11-10 00:01:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3119 to 3117. [2024-11-10 00:01:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3117 states, 3116 states have (on average 1.4929396662387677) internal successors, (4652), 3116 states have internal predecessors, (4652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 4652 transitions. [2024-11-10 00:01:41,145 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 4652 transitions. Word has length 78 [2024-11-10 00:01:41,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:41,146 INFO L471 AbstractCegarLoop]: Abstraction has 3117 states and 4652 transitions. [2024-11-10 00:01:41,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 4652 transitions. [2024-11-10 00:01:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:01:41,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:41,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:41,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:01:41,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:41,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:41,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1909246336, now seen corresponding path program 1 times [2024-11-10 00:01:41,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:41,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416225879] [2024-11-10 00:01:41,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:41,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:01:41,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:41,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416225879] [2024-11-10 00:01:41,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416225879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:41,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:41,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:41,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364112295] [2024-11-10 00:01:41,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:41,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:01:41,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:41,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:01:41,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:01:41,442 INFO L87 Difference]: Start difference. First operand 3117 states and 4652 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:42,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:42,073 INFO L93 Difference]: Finished difference Result 40005 states and 59960 transitions. [2024-11-10 00:01:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:01:42,074 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-10 00:01:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:42,243 INFO L225 Difference]: With dead ends: 40005 [2024-11-10 00:01:42,243 INFO L226 Difference]: Without dead ends: 36931 [2024-11-10 00:01:42,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-11-10 00:01:42,261 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1540 mSDsluCounter, 2653 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 2805 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:42,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 2805 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:01:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36931 states. [2024-11-10 00:01:42,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36931 to 6189. [2024-11-10 00:01:42,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6189 states, 6188 states have (on average 1.475759534583064) internal successors, (9132), 6188 states have internal predecessors, (9132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6189 states to 6189 states and 9132 transitions. [2024-11-10 00:01:42,753 INFO L78 Accepts]: Start accepts. Automaton has 6189 states and 9132 transitions. Word has length 79 [2024-11-10 00:01:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:42,754 INFO L471 AbstractCegarLoop]: Abstraction has 6189 states and 9132 transitions. [2024-11-10 00:01:42,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 6189 states and 9132 transitions. [2024-11-10 00:01:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 00:01:42,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:42,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:42,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:01:42,755 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:42,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:42,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1523526919, now seen corresponding path program 1 times [2024-11-10 00:01:42,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:42,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519010243] [2024-11-10 00:01:42,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:42,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:01:43,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:43,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519010243] [2024-11-10 00:01:43,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519010243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:43,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:43,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:43,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283194350] [2024-11-10 00:01:43,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:43,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:01:43,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:43,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:01:43,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:01:43,228 INFO L87 Difference]: Start difference. First operand 6189 states and 9132 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:43,558 INFO L93 Difference]: Finished difference Result 12337 states and 18222 transitions. [2024-11-10 00:01:43,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:01:43,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-10 00:01:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:43,573 INFO L225 Difference]: With dead ends: 12337 [2024-11-10 00:01:43,573 INFO L226 Difference]: Without dead ends: 6191 [2024-11-10 00:01:43,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:01:43,583 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 112 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:43,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 825 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:01:43,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6191 states. [2024-11-10 00:01:43,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6191 to 6189. [2024-11-10 00:01:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6189 states, 6188 states have (on average 1.4654169360051712) internal successors, (9068), 6188 states have internal predecessors, (9068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6189 states to 6189 states and 9068 transitions. [2024-11-10 00:01:43,731 INFO L78 Accepts]: Start accepts. Automaton has 6189 states and 9068 transitions. Word has length 82 [2024-11-10 00:01:43,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:43,732 INFO L471 AbstractCegarLoop]: Abstraction has 6189 states and 9068 transitions. [2024-11-10 00:01:43,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:43,732 INFO L276 IsEmpty]: Start isEmpty. Operand 6189 states and 9068 transitions. [2024-11-10 00:01:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-10 00:01:43,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:43,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:43,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:01:43,735 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:43,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:43,741 INFO L85 PathProgramCache]: Analyzing trace with hash -525631836, now seen corresponding path program 1 times [2024-11-10 00:01:43,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:43,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208807315] [2024-11-10 00:01:43,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:43,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:01:43,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:43,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208807315] [2024-11-10 00:01:43,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208807315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:43,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:43,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:43,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976296559] [2024-11-10 00:01:43,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:43,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:43,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:43,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:43,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:43,835 INFO L87 Difference]: Start difference. First operand 6189 states and 9068 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:43,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:43,905 INFO L93 Difference]: Finished difference Result 15252 states and 22385 transitions. [2024-11-10 00:01:43,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:43,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-11-10 00:01:43,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:43,929 INFO L225 Difference]: With dead ends: 15252 [2024-11-10 00:01:43,929 INFO L226 Difference]: Without dead ends: 9106 [2024-11-10 00:01:43,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:43,942 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 70 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:43,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 307 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:01:43,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9106 states. [2024-11-10 00:01:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9106 to 9104. [2024-11-10 00:01:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9104 states, 9103 states have (on average 1.4569922003735032) internal successors, (13263), 9103 states have internal predecessors, (13263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9104 states to 9104 states and 13263 transitions. [2024-11-10 00:01:44,203 INFO L78 Accepts]: Start accepts. Automaton has 9104 states and 13263 transitions. Word has length 84 [2024-11-10 00:01:44,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:44,204 INFO L471 AbstractCegarLoop]: Abstraction has 9104 states and 13263 transitions. [2024-11-10 00:01:44,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 9104 states and 13263 transitions. [2024-11-10 00:01:44,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 00:01:44,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:44,205 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:44,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:01:44,206 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:44,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:44,207 INFO L85 PathProgramCache]: Analyzing trace with hash 293781227, now seen corresponding path program 1 times [2024-11-10 00:01:44,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:44,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389337067] [2024-11-10 00:01:44,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:44,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:44,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:01:44,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:44,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389337067] [2024-11-10 00:01:44,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389337067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:44,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:44,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:01:44,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377899014] [2024-11-10 00:01:44,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:44,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:01:44,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:44,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:01:44,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:01:44,386 INFO L87 Difference]: Start difference. First operand 9104 states and 13263 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:44,553 INFO L93 Difference]: Finished difference Result 18162 states and 26480 transitions. [2024-11-10 00:01:44,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:01:44,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-10 00:01:44,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:44,576 INFO L225 Difference]: With dead ends: 18162 [2024-11-10 00:01:44,577 INFO L226 Difference]: Without dead ends: 9104 [2024-11-10 00:01:44,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:01:44,591 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 351 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:44,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 142 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:01:44,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9104 states. [2024-11-10 00:01:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9104 to 9104. [2024-11-10 00:01:44,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9104 states, 9103 states have (on average 1.4464462265187301) internal successors, (13167), 9103 states have internal predecessors, (13167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:44,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9104 states to 9104 states and 13167 transitions. [2024-11-10 00:01:44,853 INFO L78 Accepts]: Start accepts. Automaton has 9104 states and 13167 transitions. Word has length 85 [2024-11-10 00:01:44,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:44,853 INFO L471 AbstractCegarLoop]: Abstraction has 9104 states and 13167 transitions. [2024-11-10 00:01:44,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:44,854 INFO L276 IsEmpty]: Start isEmpty. Operand 9104 states and 13167 transitions. [2024-11-10 00:01:44,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 00:01:44,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:44,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:44,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:01:44,855 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:44,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:44,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1386145866, now seen corresponding path program 1 times [2024-11-10 00:01:44,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:44,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874672676] [2024-11-10 00:01:44,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:44,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:01:45,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:45,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874672676] [2024-11-10 00:01:45,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874672676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:45,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:45,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:01:45,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636588352] [2024-11-10 00:01:45,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:45,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:01:45,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:45,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:01:45,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:01:45,250 INFO L87 Difference]: Start difference. First operand 9104 states and 13167 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:45,308 INFO L93 Difference]: Finished difference Result 9618 states and 13808 transitions. [2024-11-10 00:01:45,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:01:45,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-10 00:01:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:45,329 INFO L225 Difference]: With dead ends: 9618 [2024-11-10 00:01:45,329 INFO L226 Difference]: Without dead ends: 9616 [2024-11-10 00:01:45,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:01:45,335 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:45,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:01:45,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9616 states. [2024-11-10 00:01:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9616 to 9616. [2024-11-10 00:01:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9616 states, 9615 states have (on average 1.4193447737909517) internal successors, (13647), 9615 states have internal predecessors, (13647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9616 states to 9616 states and 13647 transitions. [2024-11-10 00:01:45,498 INFO L78 Accepts]: Start accepts. Automaton has 9616 states and 13647 transitions. Word has length 85 [2024-11-10 00:01:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:45,498 INFO L471 AbstractCegarLoop]: Abstraction has 9616 states and 13647 transitions. [2024-11-10 00:01:45,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 9616 states and 13647 transitions. [2024-11-10 00:01:45,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 00:01:45,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:45,504 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:45,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:01:45,505 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:45,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:45,505 INFO L85 PathProgramCache]: Analyzing trace with hash -709393133, now seen corresponding path program 1 times [2024-11-10 00:01:45,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:45,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746057133] [2024-11-10 00:01:45,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:45,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:45,785 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:01:45,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:45,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746057133] [2024-11-10 00:01:45,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746057133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:45,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:45,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:45,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490387027] [2024-11-10 00:01:45,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:45,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:01:45,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:45,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:01:45,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:01:45,788 INFO L87 Difference]: Start difference. First operand 9616 states and 13647 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:46,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:46,294 INFO L93 Difference]: Finished difference Result 68958 states and 97830 transitions. [2024-11-10 00:01:46,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:01:46,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 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 116 [2024-11-10 00:01:46,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:46,435 INFO L225 Difference]: With dead ends: 68958 [2024-11-10 00:01:46,436 INFO L226 Difference]: Without dead ends: 59388 [2024-11-10 00:01:46,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:01:46,468 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 1152 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:46,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 1676 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:01:46,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59388 states. [2024-11-10 00:01:47,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59388 to 19184. [2024-11-10 00:01:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19184 states, 19183 states have (on average 1.415367773549497) internal successors, (27151), 19183 states have internal predecessors, (27151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19184 states to 19184 states and 27151 transitions. [2024-11-10 00:01:47,345 INFO L78 Accepts]: Start accepts. Automaton has 19184 states and 27151 transitions. Word has length 116 [2024-11-10 00:01:47,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:47,346 INFO L471 AbstractCegarLoop]: Abstraction has 19184 states and 27151 transitions. [2024-11-10 00:01:47,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:47,354 INFO L276 IsEmpty]: Start isEmpty. Operand 19184 states and 27151 transitions. [2024-11-10 00:01:47,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 00:01:47,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:47,368 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:47,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:01:47,368 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:47,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:47,369 INFO L85 PathProgramCache]: Analyzing trace with hash -600235278, now seen corresponding path program 1 times [2024-11-10 00:01:47,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:47,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055100703] [2024-11-10 00:01:47,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:47,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:01:47,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:47,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055100703] [2024-11-10 00:01:47,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055100703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:47,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:47,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:47,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057901423] [2024-11-10 00:01:47,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:47,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:01:47,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:47,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:01:47,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:01:47,640 INFO L87 Difference]: Start difference. First operand 19184 states and 27151 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:48,156 INFO L93 Difference]: Finished difference Result 78526 states and 111334 transitions. [2024-11-10 00:01:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:01:48,156 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-10 00:01:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:48,281 INFO L225 Difference]: With dead ends: 78526 [2024-11-10 00:01:48,282 INFO L226 Difference]: Without dead ends: 68956 [2024-11-10 00:01:48,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:01:48,308 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 1180 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:48,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1558 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:01:48,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68956 states. [2024-11-10 00:01:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68956 to 33584. [2024-11-10 00:01:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33584 states, 33583 states have (on average 1.4102075454843224) internal successors, (47359), 33583 states have internal predecessors, (47359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:49,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33584 states to 33584 states and 47359 transitions. [2024-11-10 00:01:49,360 INFO L78 Accepts]: Start accepts. Automaton has 33584 states and 47359 transitions. Word has length 116 [2024-11-10 00:01:49,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:49,361 INFO L471 AbstractCegarLoop]: Abstraction has 33584 states and 47359 transitions. [2024-11-10 00:01:49,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:49,361 INFO L276 IsEmpty]: Start isEmpty. Operand 33584 states and 47359 transitions. [2024-11-10 00:01:49,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 00:01:49,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:49,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:49,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:01:49,368 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:49,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:49,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1453137971, now seen corresponding path program 1 times [2024-11-10 00:01:49,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:49,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028141161] [2024-11-10 00:01:49,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:49,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:01:49,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:49,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028141161] [2024-11-10 00:01:49,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028141161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:49,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:49,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:49,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377815925] [2024-11-10 00:01:49,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:49,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:01:49,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:49,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:01:49,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:01:49,650 INFO L87 Difference]: Start difference. First operand 33584 states and 47359 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:50,278 INFO L93 Difference]: Finished difference Result 88094 states and 124838 transitions. [2024-11-10 00:01:50,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:01:50,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 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 116 [2024-11-10 00:01:50,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:50,416 INFO L225 Difference]: With dead ends: 88094 [2024-11-10 00:01:50,416 INFO L226 Difference]: Without dead ends: 78524 [2024-11-10 00:01:50,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:01:50,576 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 1238 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:50,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 1484 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:01:50,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78524 states. [2024-11-10 00:01:51,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78524 to 43152. [2024-11-10 00:01:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43152 states, 43151 states have (on average 1.4104655743783459) internal successors, (60863), 43151 states have internal predecessors, (60863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43152 states to 43152 states and 60863 transitions. [2024-11-10 00:01:51,640 INFO L78 Accepts]: Start accepts. Automaton has 43152 states and 60863 transitions. Word has length 116 [2024-11-10 00:01:51,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:51,640 INFO L471 AbstractCegarLoop]: Abstraction has 43152 states and 60863 transitions. [2024-11-10 00:01:51,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 43152 states and 60863 transitions. [2024-11-10 00:01:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 00:01:51,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:51,649 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:51,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:01:51,649 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:51,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:51,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1355936494, now seen corresponding path program 1 times [2024-11-10 00:01:51,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:51,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233833075] [2024-11-10 00:01:51,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:51,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 00:01:51,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:51,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233833075] [2024-11-10 00:01:51,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233833075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:51,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:51,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:51,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255360977] [2024-11-10 00:01:51,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:51,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:01:51,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:51,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:01:51,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:01:51,875 INFO L87 Difference]: Start difference. First operand 43152 states and 60863 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:52,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:52,495 INFO L93 Difference]: Finished difference Result 97662 states and 138342 transitions. [2024-11-10 00:01:52,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:01:52,496 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 116 [2024-11-10 00:01:52,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:52,669 INFO L225 Difference]: With dead ends: 97662 [2024-11-10 00:01:52,670 INFO L226 Difference]: Without dead ends: 88092 [2024-11-10 00:01:52,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:01:52,720 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 1307 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:52,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 1504 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:01:52,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88092 states. [2024-11-10 00:01:53,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88092 to 52720. [2024-11-10 00:01:53,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52720 states, 52719 states have (on average 1.4106299436635747) internal successors, (74367), 52719 states have internal predecessors, (74367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52720 states to 52720 states and 74367 transitions. [2024-11-10 00:01:53,873 INFO L78 Accepts]: Start accepts. Automaton has 52720 states and 74367 transitions. Word has length 116 [2024-11-10 00:01:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:53,873 INFO L471 AbstractCegarLoop]: Abstraction has 52720 states and 74367 transitions. [2024-11-10 00:01:53,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 52720 states and 74367 transitions. [2024-11-10 00:01:53,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 00:01:53,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:53,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:53,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:01:53,883 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:53,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:53,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1277174957, now seen corresponding path program 1 times [2024-11-10 00:01:53,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:53,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658792009] [2024-11-10 00:01:53,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:53,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-10 00:01:54,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:54,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658792009] [2024-11-10 00:01:54,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658792009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:54,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:54,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:54,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126003102] [2024-11-10 00:01:54,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:54,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:01:54,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:54,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:01:54,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:01:54,207 INFO L87 Difference]: Start difference. First operand 52720 states and 74367 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:54,933 INFO L93 Difference]: Finished difference Result 107230 states and 151846 transitions. [2024-11-10 00:01:54,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:01:54,934 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 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 116 [2024-11-10 00:01:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:55,060 INFO L225 Difference]: With dead ends: 107230 [2024-11-10 00:01:55,060 INFO L226 Difference]: Without dead ends: 97660 [2024-11-10 00:01:55,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:01:55,094 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 1160 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:55,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 1678 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:01:55,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97660 states. [2024-11-10 00:01:55,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97660 to 62288. [2024-11-10 00:01:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62288 states, 62287 states have (on average 1.4107438149212517) internal successors, (87871), 62287 states have internal predecessors, (87871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62288 states to 62288 states and 87871 transitions. [2024-11-10 00:01:56,389 INFO L78 Accepts]: Start accepts. Automaton has 62288 states and 87871 transitions. Word has length 116 [2024-11-10 00:01:56,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:56,390 INFO L471 AbstractCegarLoop]: Abstraction has 62288 states and 87871 transitions. [2024-11-10 00:01:56,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand 62288 states and 87871 transitions. [2024-11-10 00:01:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 00:01:56,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:56,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:56,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:01:56,397 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:56,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:56,397 INFO L85 PathProgramCache]: Analyzing trace with hash 658528466, now seen corresponding path program 1 times [2024-11-10 00:01:56,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:56,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736790593] [2024-11-10 00:01:56,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:56,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:01:56,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:56,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736790593] [2024-11-10 00:01:56,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736790593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:56,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:56,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:56,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301473555] [2024-11-10 00:01:56,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:56,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:01:56,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:56,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:01:56,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:01:56,613 INFO L87 Difference]: Start difference. First operand 62288 states and 87871 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:57,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:57,130 INFO L93 Difference]: Finished difference Result 110974 states and 157094 transitions. [2024-11-10 00:01:57,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:01:57,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-10 00:01:57,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:57,267 INFO L225 Difference]: With dead ends: 110974 [2024-11-10 00:01:57,267 INFO L226 Difference]: Without dead ends: 104316 [2024-11-10 00:01:57,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:01:57,301 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 1139 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:57,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 1982 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:01:57,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104316 states. [2024-11-10 00:01:58,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104316 to 68944. [2024-11-10 00:01:58,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68944 states, 68943 states have (on average 1.411006193522185) internal successors, (97279), 68943 states have internal predecessors, (97279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68944 states to 68944 states and 97279 transitions. [2024-11-10 00:01:58,963 INFO L78 Accepts]: Start accepts. Automaton has 68944 states and 97279 transitions. Word has length 116 [2024-11-10 00:01:58,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:58,964 INFO L471 AbstractCegarLoop]: Abstraction has 68944 states and 97279 transitions. [2024-11-10 00:01:58,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 68944 states and 97279 transitions. [2024-11-10 00:01:58,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 00:01:58,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:58,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:58,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:01:58,971 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:58,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:58,971 INFO L85 PathProgramCache]: Analyzing trace with hash 621773550, now seen corresponding path program 1 times [2024-11-10 00:01:58,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:58,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971299204] [2024-11-10 00:01:58,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:58,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:59,309 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:01:59,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:59,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971299204] [2024-11-10 00:01:59,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971299204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:01:59,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400824421] [2024-11-10 00:01:59,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:59,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:01:59,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:01:59,313 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-10 00:01:59,317 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-10 00:01:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:59,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:01:59,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:02:00,189 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:00,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:02:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:01,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400824421] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:02:01,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:02:01,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-10 00:02:01,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214568218] [2024-11-10 00:02:01,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:02:01,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 00:02:01,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:01,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 00:02:01,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2024-11-10 00:02:01,763 INFO L87 Difference]: Start difference. First operand 68944 states and 97279 transitions. Second operand has 23 states, 23 states have (on average 12.173913043478262) internal successors, (280), 22 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:03,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:03,703 INFO L93 Difference]: Finished difference Result 220630 states and 309746 transitions. [2024-11-10 00:02:03,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 00:02:03,704 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 12.173913043478262) internal successors, (280), 22 states have internal predecessors, (280), 0 states have call successors, (0), 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 118 [2024-11-10 00:02:03,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:03,932 INFO L225 Difference]: With dead ends: 220630 [2024-11-10 00:02:03,933 INFO L226 Difference]: Without dead ends: 170708 [2024-11-10 00:02:03,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=364, Invalid=1118, Unknown=0, NotChecked=0, Total=1482 [2024-11-10 00:02:03,955 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1218 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:03,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 1139 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 00:02:04,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170708 states. [2024-11-10 00:02:05,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170708 to 145264. [2024-11-10 00:02:06,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145264 states, 145263 states have (on average 1.4012584071649352) internal successors, (203551), 145263 states have internal predecessors, (203551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:06,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145264 states to 145264 states and 203551 transitions. [2024-11-10 00:02:06,939 INFO L78 Accepts]: Start accepts. Automaton has 145264 states and 203551 transitions. Word has length 118 [2024-11-10 00:02:06,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:06,939 INFO L471 AbstractCegarLoop]: Abstraction has 145264 states and 203551 transitions. [2024-11-10 00:02:06,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.173913043478262) internal successors, (280), 22 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:06,939 INFO L276 IsEmpty]: Start isEmpty. Operand 145264 states and 203551 transitions. [2024-11-10 00:02:06,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 00:02:06,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:06,949 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:02:06,964 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-10 00:02:07,150 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,SelfDestructingSolverStorable17 [2024-11-10 00:02:07,151 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:07,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:07,151 INFO L85 PathProgramCache]: Analyzing trace with hash 825279758, now seen corresponding path program 1 times [2024-11-10 00:02:07,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:07,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467728556] [2024-11-10 00:02:07,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:07,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:07,510 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:07,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:07,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467728556] [2024-11-10 00:02:07,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467728556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:02:07,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607229188] [2024-11-10 00:02:07,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:07,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:02:07,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:02:07,513 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-10 00:02:07,515 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-10 00:02:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:07,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:02:07,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:02:08,276 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:08,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:02:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:09,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607229188] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:02:09,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:02:09,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-10 00:02:09,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132749378] [2024-11-10 00:02:09,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:02:09,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 00:02:09,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:09,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 00:02:09,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2024-11-10 00:02:09,085 INFO L87 Difference]: Start difference. First operand 145264 states and 203551 transitions. Second operand has 23 states, 23 states have (on average 11.826086956521738) internal successors, (272), 22 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:11,994 INFO L93 Difference]: Finished difference Result 604150 states and 852186 transitions. [2024-11-10 00:02:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 00:02:11,995 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 11.826086956521738) internal successors, (272), 22 states have internal predecessors, (272), 0 states have call successors, (0), 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 118 [2024-11-10 00:02:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:12,841 INFO L225 Difference]: With dead ends: 604150 [2024-11-10 00:02:12,842 INFO L226 Difference]: Without dead ends: 458932 [2024-11-10 00:02:13,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 00:02:13,021 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 2735 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2735 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:13,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2735 Valid, 1223 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:02:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458932 states. [2024-11-10 00:02:18,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458932 to 341232. [2024-11-10 00:02:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341232 states, 341231 states have (on average 1.3924028004489628) internal successors, (475131), 341231 states have internal predecessors, (475131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341232 states to 341232 states and 475131 transitions. [2024-11-10 00:02:20,822 INFO L78 Accepts]: Start accepts. Automaton has 341232 states and 475131 transitions. Word has length 118 [2024-11-10 00:02:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:20,823 INFO L471 AbstractCegarLoop]: Abstraction has 341232 states and 475131 transitions. [2024-11-10 00:02:20,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.826086956521738) internal successors, (272), 22 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 341232 states and 475131 transitions. [2024-11-10 00:02:20,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 00:02:20,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:02:20,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:02:21,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:02:21,047 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:21,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:21,048 INFO L85 PathProgramCache]: Analyzing trace with hash 934437613, now seen corresponding path program 1 times [2024-11-10 00:02:21,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:21,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686861515] [2024-11-10 00:02:21,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:21,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:21,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:21,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686861515] [2024-11-10 00:02:21,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686861515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:02:21,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683051261] [2024-11-10 00:02:21,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:21,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:02:21,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:02:21,614 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-10 00:02:21,615 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-10 00:02:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:21,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:02:21,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:02:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:22,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:02:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:23,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683051261] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:02:23,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:02:23,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-10 00:02:23,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873239529] [2024-11-10 00:02:23,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:02:23,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 00:02:23,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:23,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 00:02:23,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-11-10 00:02:23,235 INFO L87 Difference]: Start difference. First operand 341232 states and 475131 transitions. Second operand has 21 states, 21 states have (on average 12.333333333333334) internal successors, (259), 20 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:29,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:29,726 INFO L93 Difference]: Finished difference Result 1435878 states and 2013178 transitions. [2024-11-10 00:02:29,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 00:02:29,727 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 12.333333333333334) internal successors, (259), 20 states have internal predecessors, (259), 0 states have call successors, (0), 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 118 [2024-11-10 00:02:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:32,151 INFO L225 Difference]: With dead ends: 1435878 [2024-11-10 00:02:32,151 INFO L226 Difference]: Without dead ends: 1094692 [2024-11-10 00:02:32,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=379, Invalid=1103, Unknown=0, NotChecked=0, Total=1482 [2024-11-10 00:02:32,548 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1380 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:32,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 1261 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:02:34,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094692 states.