./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f7a5a1c3d43a07fad050d83cae91745968fcd759f4b97582e892f295162805b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:01:19,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:01:19,898 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:19,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:01:19,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:01:19,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:01:19,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:01:19,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:01:19,930 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:01:19,930 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:01:19,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:01:19,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:01:19,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:01:19,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:01:19,932 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:01:19,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:01:19,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:01:19,933 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:01:19,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:01:19,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:01:19,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:01:19,934 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:01:19,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:01:19,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:01:19,937 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:01:19,937 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:01:19,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:01:19,938 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:01:19,938 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:01:19,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:01:19,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:01:19,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:01:19,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:01:19,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:01:19,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:01:19,942 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:01:19,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:01:19,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:01:19,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:01:19,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:01:19,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:01:19,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:01:19,945 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 -> 7f7a5a1c3d43a07fad050d83cae91745968fcd759f4b97582e892f295162805b [2024-11-10 00:01:20,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:01:20,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:01:20,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:01:20,234 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:01:20,235 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:01:20,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-10 00:01:21,622 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:01:21,877 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:01:21,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-10 00:01:21,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec4bd31b0/77184f3335214136b63c573fa01cad4c/FLAG1879b59f1 [2024-11-10 00:01:22,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec4bd31b0/77184f3335214136b63c573fa01cad4c [2024-11-10 00:01:22,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:01:22,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:01:22,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:01:22,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:01:22,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:01:22,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:01:22" (1/1) ... [2024-11-10 00:01:22,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74812a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:22, skipping insertion in model container [2024-11-10 00:01:22,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:01:22" (1/1) ... [2024-11-10 00:01:22,260 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:01:22,500 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.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5805,5818] [2024-11-10 00:01:22,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:01:22,544 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:01:22,589 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.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5805,5818] [2024-11-10 00:01:22,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:01:22,621 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:01:22,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:22 WrapperNode [2024-11-10 00:01:22,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:01:22,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:01:22,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:01:22,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:01:22,628 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:22" (1/1) ... [2024-11-10 00:01:22,642 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:22" (1/1) ... [2024-11-10 00:01:22,677 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 451 [2024-11-10 00:01:22,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:01:22,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:01:22,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:01:22,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:01:22,688 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:22" (1/1) ... [2024-11-10 00:01:22,689 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:22" (1/1) ... [2024-11-10 00:01:22,691 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:22" (1/1) ... [2024-11-10 00:01:22,715 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:22,715 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:22" (1/1) ... [2024-11-10 00:01:22,715 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:22" (1/1) ... [2024-11-10 00:01:22,723 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:22" (1/1) ... [2024-11-10 00:01:22,725 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:22" (1/1) ... [2024-11-10 00:01:22,726 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:22" (1/1) ... [2024-11-10 00:01:22,727 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:22" (1/1) ... [2024-11-10 00:01:22,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:01:22,730 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:01:22,730 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:01:22,730 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:01:22,731 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:22" (1/1) ... [2024-11-10 00:01:22,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:01:22,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:01:22,777 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:22,786 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:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:01:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:01:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:01:22,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:01:22,983 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:01:22,985 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:01:23,393 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L490: havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-10 00:01:23,393 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L540: havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-10 00:01:23,393 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L400: havoc main_~node4____CPAchecker_TMP_0~0#1; [2024-11-10 00:01:23,393 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:01:23,393 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:01:23,394 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:01:23,394 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:01:23,394 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:01:23,394 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L246: havoc main_~node5__m5~0#1;havoc main_~node4__m4~0#1; [2024-11-10 00:01:23,394 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L246: havoc main_~node5__m5~0#1;havoc main_~node4__m4~0#1; [2024-11-10 00:01:23,394 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L246: havoc main_~node5__m5~0#1;havoc main_~node4__m4~0#1; [2024-11-10 00:01:23,394 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L445: havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-10 00:01:23,394 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,394 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,394 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,395 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,395 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,395 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,395 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,396 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,396 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,396 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,396 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,396 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,396 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,396 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,396 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,397 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,397 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,397 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,397 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,398 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,398 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,398 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,398 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,399 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,399 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,399 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,399 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,399 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,399 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,399 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,399 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,399 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:23,399 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L355: havoc main_~node5____CPAchecker_TMP_0~0#1; [2024-11-10 00:01:23,399 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: havoc main_~node3__m3~0#1;havoc main_~node2__m2~0#1; [2024-11-10 00:01:23,399 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: havoc main_~node3__m3~0#1;havoc main_~node2__m2~0#1; [2024-11-10 00:01:23,399 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: havoc main_~node3__m3~0#1;havoc main_~node2__m2~0#1; [2024-11-10 00:01:23,429 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-10 00:01:23,429 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:01:23,444 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:01:23,444 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:01:23,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:01:23 BoogieIcfgContainer [2024-11-10 00:01:23,448 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:01:23,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:01:23,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:01:23,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:01:23,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:01:22" (1/3) ... [2024-11-10 00:01:23,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576f6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:01:23, skipping insertion in model container [2024-11-10 00:01:23,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:22" (2/3) ... [2024-11-10 00:01:23,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576f6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:01:23, skipping insertion in model container [2024-11-10 00:01:23,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:01:23" (3/3) ... [2024-11-10 00:01:23,456 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-10 00:01:23,467 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:01:23,467 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 00:01:23,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:01:23,526 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;@79be29b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:01:23,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 00:01:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 101 states have (on average 1.693069306930693) internal successors, (171), 102 states have internal predecessors, (171), 0 states have call successors, (0), 0 states 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:23,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:01:23,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:23,540 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] [2024-11-10 00:01:23,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:23,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:23,545 INFO L85 PathProgramCache]: Analyzing trace with hash -264958169, now seen corresponding path program 1 times [2024-11-10 00:01:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:23,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278565024] [2024-11-10 00:01:23,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:23,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:24,013 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:24,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:24,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278565024] [2024-11-10 00:01:24,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278565024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:24,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:24,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:24,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653071405] [2024-11-10 00:01:24,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:24,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:24,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:24,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:24,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:24,055 INFO L87 Difference]: Start difference. First operand has 103 states, 101 states have (on average 1.693069306930693) internal successors, (171), 102 states have internal predecessors, (171), 0 states have call successors, (0), 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 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:24,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:24,190 INFO L93 Difference]: Finished difference Result 231 states and 366 transitions. [2024-11-10 00:01:24,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:24,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:01:24,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:24,209 INFO L225 Difference]: With dead ends: 231 [2024-11-10 00:01:24,209 INFO L226 Difference]: Without dead ends: 156 [2024-11-10 00:01:24,212 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:24,218 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 111 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 346 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:24,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 346 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:24,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-10 00:01:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2024-11-10 00:01:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.4444444444444444) internal successors, (221), 153 states have internal predecessors, (221), 0 states have call successors, (0), 0 states 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:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 221 transitions. [2024-11-10 00:01:24,258 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 221 transitions. Word has length 60 [2024-11-10 00:01:24,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:24,259 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 221 transitions. [2024-11-10 00:01:24,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:24,259 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 221 transitions. [2024-11-10 00:01:24,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-10 00:01:24,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:24,261 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] [2024-11-10 00:01:24,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:01:24,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:24,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:24,263 INFO L85 PathProgramCache]: Analyzing trace with hash -808663251, now seen corresponding path program 1 times [2024-11-10 00:01:24,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:24,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399318822] [2024-11-10 00:01:24,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:24,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:24,433 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:24,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:24,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399318822] [2024-11-10 00:01:24,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399318822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:24,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:24,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:24,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200898542] [2024-11-10 00:01:24,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:24,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:24,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:24,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:24,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:24,438 INFO L87 Difference]: Start difference. First operand 154 states and 221 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:24,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:24,463 INFO L93 Difference]: Finished difference Result 378 states and 569 transitions. [2024-11-10 00:01:24,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:24,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-10 00:01:24,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:24,465 INFO L225 Difference]: With dead ends: 378 [2024-11-10 00:01:24,465 INFO L226 Difference]: Without dead ends: 258 [2024-11-10 00:01:24,466 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:24,467 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 81 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 296 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:24,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 296 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:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-10 00:01:24,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2024-11-10 00:01:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.4862745098039216) internal successors, (379), 255 states have internal predecessors, (379), 0 states have call successors, (0), 0 states 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:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2024-11-10 00:01:24,481 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 61 [2024-11-10 00:01:24,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:24,481 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2024-11-10 00:01:24,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:24,482 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2024-11-10 00:01:24,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:01:24,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:24,483 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] [2024-11-10 00:01:24,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:01:24,483 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:24,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:24,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2052584811, now seen corresponding path program 1 times [2024-11-10 00:01:24,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:24,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351769610] [2024-11-10 00:01:24,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:24,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:24,584 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:24,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:24,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351769610] [2024-11-10 00:01:24,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351769610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:24,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:24,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:24,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751686503] [2024-11-10 00:01:24,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:24,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:24,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:24,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:24,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:24,590 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:24,618 INFO L93 Difference]: Finished difference Result 668 states and 1017 transitions. [2024-11-10 00:01:24,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:24,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 00:01:24,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:24,625 INFO L225 Difference]: With dead ends: 668 [2024-11-10 00:01:24,626 INFO L226 Difference]: Without dead ends: 446 [2024-11-10 00:01:24,627 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:24,630 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 76 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 292 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:24,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 292 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:24,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-10 00:01:24,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 444. [2024-11-10 00:01:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 1.5056433408577878) internal successors, (667), 443 states have internal predecessors, (667), 0 states have call successors, (0), 0 states 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:24,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 667 transitions. [2024-11-10 00:01:24,673 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 667 transitions. Word has length 62 [2024-11-10 00:01:24,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:24,675 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 667 transitions. [2024-11-10 00:01:24,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 667 transitions. [2024-11-10 00:01:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 00:01:24,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:24,680 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] [2024-11-10 00:01:24,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:01:24,680 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:24,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:24,681 INFO L85 PathProgramCache]: Analyzing trace with hash 415511928, now seen corresponding path program 1 times [2024-11-10 00:01:24,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:24,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529490232] [2024-11-10 00:01:24,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:24,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:24,816 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:24,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:24,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529490232] [2024-11-10 00:01:24,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529490232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:24,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:24,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:24,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769478043] [2024-11-10 00:01:24,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:24,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:24,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:24,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:24,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:24,820 INFO L87 Difference]: Start difference. First operand 444 states and 667 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:24,850 INFO L93 Difference]: Finished difference Result 1200 states and 1829 transitions. [2024-11-10 00:01:24,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:24,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-10 00:01:24,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:24,853 INFO L225 Difference]: With dead ends: 1200 [2024-11-10 00:01:24,853 INFO L226 Difference]: Without dead ends: 790 [2024-11-10 00:01:24,855 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:24,855 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 71 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 288 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:24,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 288 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:24,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-11-10 00:01:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2024-11-10 00:01:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.508259212198221) internal successors, (1187), 787 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states 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:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1187 transitions. [2024-11-10 00:01:24,875 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1187 transitions. Word has length 63 [2024-11-10 00:01:24,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:24,875 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1187 transitions. [2024-11-10 00:01:24,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1187 transitions. [2024-11-10 00:01:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 00:01:24,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:24,876 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] [2024-11-10 00:01:24,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:01:24,876 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:24,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:24,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1781395363, now seen corresponding path program 1 times [2024-11-10 00:01:24,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:24,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102231269] [2024-11-10 00:01:24,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:24,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:25,021 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:25,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:25,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102231269] [2024-11-10 00:01:25,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102231269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:25,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:25,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:01:25,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499148347] [2024-11-10 00:01:25,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:25,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:01:25,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:25,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:01:25,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:01:25,026 INFO L87 Difference]: Start difference. First operand 788 states and 1187 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:25,276 INFO L93 Difference]: Finished difference Result 8328 states and 12717 transitions. [2024-11-10 00:01:25,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 00:01:25,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-11-10 00:01:25,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:25,297 INFO L225 Difference]: With dead ends: 8328 [2024-11-10 00:01:25,298 INFO L226 Difference]: Without dead ends: 7574 [2024-11-10 00:01:25,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-10 00:01:25,301 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1016 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 2312 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:25,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 2312 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:01:25,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7574 states. [2024-11-10 00:01:25,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7574 to 1540. [2024-11-10 00:01:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1539 states have (on average 1.4990253411306043) internal successors, (2307), 1539 states have internal predecessors, (2307), 0 states have call successors, (0), 0 states 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:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2307 transitions. [2024-11-10 00:01:25,355 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2307 transitions. Word has length 64 [2024-11-10 00:01:25,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:25,356 INFO L471 AbstractCegarLoop]: Abstraction has 1540 states and 2307 transitions. [2024-11-10 00:01:25,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2307 transitions. [2024-11-10 00:01:25,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:01:25,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:25,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:25,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:01:25,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:25,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:25,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1943848027, now seen corresponding path program 1 times [2024-11-10 00:01:25,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:25,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515135353] [2024-11-10 00:01:25,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:25,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:25,668 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:25,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:25,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515135353] [2024-11-10 00:01:25,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515135353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:25,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:25,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:01:25,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022995171] [2024-11-10 00:01:25,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:25,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:01:25,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:25,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:01:25,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:01:25,671 INFO L87 Difference]: Start difference. First operand 1540 states and 2307 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:25,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:25,824 INFO L93 Difference]: Finished difference Result 3048 states and 4581 transitions. [2024-11-10 00:01:25,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:01:25,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 00:01:25,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:25,829 INFO L225 Difference]: With dead ends: 3048 [2024-11-10 00:01:25,829 INFO L226 Difference]: Without dead ends: 1542 [2024-11-10 00:01:25,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:01:25,832 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 349 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:25,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 553 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:01:25,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-11-10 00:01:25,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1540. [2024-11-10 00:01:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1539 states have (on average 1.48862897985705) internal successors, (2291), 1539 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states 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:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2291 transitions. [2024-11-10 00:01:25,855 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2291 transitions. Word has length 67 [2024-11-10 00:01:25,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:25,857 INFO L471 AbstractCegarLoop]: Abstraction has 1540 states and 2291 transitions. [2024-11-10 00:01:25,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2291 transitions. [2024-11-10 00:01:25,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:01:25,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:25,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] [2024-11-10 00:01:25,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:01:25,859 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:25,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:25,859 INFO L85 PathProgramCache]: Analyzing trace with hash -781622132, now seen corresponding path program 1 times [2024-11-10 00:01:25,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:25,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714801705] [2024-11-10 00:01:25,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:25,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:25,939 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:25,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:25,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714801705] [2024-11-10 00:01:25,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714801705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:25,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:25,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298264583] [2024-11-10 00:01:25,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:25,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:25,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:25,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:25,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:25,943 INFO L87 Difference]: Start difference. First operand 1540 states and 2291 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:25,963 INFO L93 Difference]: Finished difference Result 4232 states and 6293 transitions. [2024-11-10 00:01:25,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:25,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 00:01:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:25,971 INFO L225 Difference]: With dead ends: 4232 [2024-11-10 00:01:25,971 INFO L226 Difference]: Without dead ends: 2726 [2024-11-10 00:01:25,973 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:25,973 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 88 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 312 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:25,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 312 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:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2024-11-10 00:01:26,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 2724. [2024-11-10 00:01:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2724 states, 2723 states have (on average 1.4700697759823724) internal successors, (4003), 2723 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states 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:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 4003 transitions. [2024-11-10 00:01:26,008 INFO L78 Accepts]: Start accepts. Automaton has 2724 states and 4003 transitions. Word has length 67 [2024-11-10 00:01:26,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:26,009 INFO L471 AbstractCegarLoop]: Abstraction has 2724 states and 4003 transitions. [2024-11-10 00:01:26,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 4003 transitions. [2024-11-10 00:01:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:01:26,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:26,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:26,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:01:26,012 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:26,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:26,012 INFO L85 PathProgramCache]: Analyzing trace with hash 221664738, now seen corresponding path program 1 times [2024-11-10 00:01:26,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:26,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500375078] [2024-11-10 00:01:26,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:26,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:26,102 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:26,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:26,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500375078] [2024-11-10 00:01:26,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500375078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:26,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:26,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:26,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121003361] [2024-11-10 00:01:26,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:26,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:26,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:26,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:26,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:26,108 INFO L87 Difference]: Start difference. First operand 2724 states and 4003 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:26,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:26,148 INFO L93 Difference]: Finished difference Result 6714 states and 9895 transitions. [2024-11-10 00:01:26,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:26,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:01:26,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:26,159 INFO L225 Difference]: With dead ends: 6714 [2024-11-10 00:01:26,162 INFO L226 Difference]: Without dead ends: 4024 [2024-11-10 00:01:26,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:26,167 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 61 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:26,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 225 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:01:26,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2024-11-10 00:01:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3990. [2024-11-10 00:01:26,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3990 states, 3989 states have (on average 1.457257458009526) internal successors, (5813), 3989 states have internal predecessors, (5813), 0 states have call successors, (0), 0 states 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:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3990 states and 5813 transitions. [2024-11-10 00:01:26,229 INFO L78 Accepts]: Start accepts. Automaton has 3990 states and 5813 transitions. Word has length 69 [2024-11-10 00:01:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:26,230 INFO L471 AbstractCegarLoop]: Abstraction has 3990 states and 5813 transitions. [2024-11-10 00:01:26,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3990 states and 5813 transitions. [2024-11-10 00:01:26,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 00:01:26,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:26,232 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:26,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:01:26,232 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:26,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:26,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1985138478, now seen corresponding path program 1 times [2024-11-10 00:01:26,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:26,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875340306] [2024-11-10 00:01:26,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:26,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:26,441 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:26,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:26,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875340306] [2024-11-10 00:01:26,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875340306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:26,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:26,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:01:26,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126924234] [2024-11-10 00:01:26,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:26,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:01:26,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:26,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:01:26,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:01:26,444 INFO L87 Difference]: Start difference. First operand 3990 states and 5813 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:26,476 INFO L93 Difference]: Finished difference Result 4248 states and 6134 transitions. [2024-11-10 00:01:26,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:01:26,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-10 00:01:26,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:26,487 INFO L225 Difference]: With dead ends: 4248 [2024-11-10 00:01:26,487 INFO L226 Difference]: Without dead ends: 4246 [2024-11-10 00:01:26,489 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:26,489 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:26,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:01:26,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4246 states. [2024-11-10 00:01:26,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4246 to 4246. [2024-11-10 00:01:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4246 states, 4245 states have (on average 1.4259128386336868) internal successors, (6053), 4245 states have internal predecessors, (6053), 0 states have call successors, (0), 0 states 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:26,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4246 states to 4246 states and 6053 transitions. [2024-11-10 00:01:26,552 INFO L78 Accepts]: Start accepts. Automaton has 4246 states and 6053 transitions. Word has length 70 [2024-11-10 00:01:26,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:26,552 INFO L471 AbstractCegarLoop]: Abstraction has 4246 states and 6053 transitions. [2024-11-10 00:01:26,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:26,553 INFO L276 IsEmpty]: Start isEmpty. Operand 4246 states and 6053 transitions. [2024-11-10 00:01:26,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 00:01:26,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:26,555 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:26,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:01:26,555 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:26,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:26,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1706786849, now seen corresponding path program 1 times [2024-11-10 00:01:26,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:26,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711866225] [2024-11-10 00:01:26,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:26,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:26,737 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:26,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:26,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711866225] [2024-11-10 00:01:26,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711866225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:26,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:26,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:01:26,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237056050] [2024-11-10 00:01:26,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:26,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:01:26,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:26,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:01:26,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:01:26,740 INFO L87 Difference]: Start difference. First operand 4246 states and 6053 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:26,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:26,979 INFO L93 Difference]: Finished difference Result 26162 states and 37307 transitions. [2024-11-10 00:01:26,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:01:26,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-11-10 00:01:26,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:27,033 INFO L225 Difference]: With dead ends: 26162 [2024-11-10 00:01:27,033 INFO L226 Difference]: Without dead ends: 21952 [2024-11-10 00:01:27,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:01:27,049 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 792 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:27,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1099 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:01:27,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21952 states. [2024-11-10 00:01:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21952 to 8454. [2024-11-10 00:01:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8454 states, 8453 states have (on average 1.4220986631964982) internal successors, (12021), 8453 states have internal predecessors, (12021), 0 states have call successors, (0), 0 states 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:27,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8454 states to 8454 states and 12021 transitions. [2024-11-10 00:01:27,307 INFO L78 Accepts]: Start accepts. Automaton has 8454 states and 12021 transitions. Word has length 97 [2024-11-10 00:01:27,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:27,308 INFO L471 AbstractCegarLoop]: Abstraction has 8454 states and 12021 transitions. [2024-11-10 00:01:27,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:27,308 INFO L276 IsEmpty]: Start isEmpty. Operand 8454 states and 12021 transitions. [2024-11-10 00:01:27,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 00:01:27,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:27,311 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:27,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:01:27,311 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:27,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:27,312 INFO L85 PathProgramCache]: Analyzing trace with hash -534807198, now seen corresponding path program 1 times [2024-11-10 00:01:27,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:27,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518087550] [2024-11-10 00:01:27,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:27,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:27,479 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:27,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:27,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518087550] [2024-11-10 00:01:27,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518087550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:27,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:27,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:01:27,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473072647] [2024-11-10 00:01:27,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:27,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:01:27,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:27,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:01:27,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:01:27,482 INFO L87 Difference]: Start difference. First operand 8454 states and 12021 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:27,725 INFO L93 Difference]: Finished difference Result 30370 states and 43275 transitions. [2024-11-10 00:01:27,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:01:27,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-11-10 00:01:27,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:27,776 INFO L225 Difference]: With dead ends: 30370 [2024-11-10 00:01:27,777 INFO L226 Difference]: Without dead ends: 26160 [2024-11-10 00:01:27,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:01:27,793 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 822 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:27,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1016 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:01:27,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26160 states. [2024-11-10 00:01:28,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26160 to 14790. [2024-11-10 00:01:28,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14790 states, 14789 states have (on average 1.4165257961998783) internal successors, (20949), 14789 states have internal predecessors, (20949), 0 states have call successors, (0), 0 states 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:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14790 states to 14790 states and 20949 transitions. [2024-11-10 00:01:28,102 INFO L78 Accepts]: Start accepts. Automaton has 14790 states and 20949 transitions. Word has length 97 [2024-11-10 00:01:28,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:28,102 INFO L471 AbstractCegarLoop]: Abstraction has 14790 states and 20949 transitions. [2024-11-10 00:01:28,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:28,103 INFO L276 IsEmpty]: Start isEmpty. Operand 14790 states and 20949 transitions. [2024-11-10 00:01:28,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 00:01:28,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:28,106 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:28,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:01:28,106 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:28,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:28,107 INFO L85 PathProgramCache]: Analyzing trace with hash 951085633, now seen corresponding path program 1 times [2024-11-10 00:01:28,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:28,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125002467] [2024-11-10 00:01:28,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:28,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:28,320 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:28,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:28,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125002467] [2024-11-10 00:01:28,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125002467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:28,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:28,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:01:28,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423368365] [2024-11-10 00:01:28,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:28,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:01:28,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:28,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:01:28,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:01:28,326 INFO L87 Difference]: Start difference. First operand 14790 states and 20949 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:28,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:28,521 INFO L93 Difference]: Finished difference Result 34578 states and 49243 transitions. [2024-11-10 00:01:28,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:01:28,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-11-10 00:01:28,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:28,581 INFO L225 Difference]: With dead ends: 34578 [2024-11-10 00:01:28,581 INFO L226 Difference]: Without dead ends: 30368 [2024-11-10 00:01:28,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:01:28,596 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 877 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:28,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 1005 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:01:28,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30368 states. [2024-11-10 00:01:28,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30368 to 18998. [2024-11-10 00:01:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18998 states, 18997 states have (on average 1.4169079328314997) internal successors, (26917), 18997 states have internal predecessors, (26917), 0 states have call successors, (0), 0 states 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:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18998 states to 18998 states and 26917 transitions. [2024-11-10 00:01:28,920 INFO L78 Accepts]: Start accepts. Automaton has 18998 states and 26917 transitions. Word has length 97 [2024-11-10 00:01:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:28,920 INFO L471 AbstractCegarLoop]: Abstraction has 18998 states and 26917 transitions. [2024-11-10 00:01:28,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 18998 states and 26917 transitions. [2024-11-10 00:01:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 00:01:28,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:28,923 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:28,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:01:28,923 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:28,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:28,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1029847170, now seen corresponding path program 1 times [2024-11-10 00:01:28,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:28,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105408698] [2024-11-10 00:01:28,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:28,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:29,050 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:29,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:29,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105408698] [2024-11-10 00:01:29,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105408698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:29,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:29,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:01:29,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934491392] [2024-11-10 00:01:29,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:29,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:01:29,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:29,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:01:29,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:01:29,052 INFO L87 Difference]: Start difference. First operand 18998 states and 26917 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:29,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:29,327 INFO L93 Difference]: Finished difference Result 38786 states and 55211 transitions. [2024-11-10 00:01:29,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:01:29,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-11-10 00:01:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:29,389 INFO L225 Difference]: With dead ends: 38786 [2024-11-10 00:01:29,389 INFO L226 Difference]: Without dead ends: 34576 [2024-11-10 00:01:29,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:01:29,407 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 801 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:29,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 1080 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:01:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34576 states. [2024-11-10 00:01:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34576 to 23206. [2024-11-10 00:01:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23206 states, 23205 states have (on average 1.4171514759750055) internal successors, (32885), 23205 states have internal predecessors, (32885), 0 states have call successors, (0), 0 states 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:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23206 states to 23206 states and 32885 transitions. [2024-11-10 00:01:29,862 INFO L78 Accepts]: Start accepts. Automaton has 23206 states and 32885 transitions. Word has length 97 [2024-11-10 00:01:29,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:29,863 INFO L471 AbstractCegarLoop]: Abstraction has 23206 states and 32885 transitions. [2024-11-10 00:01:29,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 23206 states and 32885 transitions. [2024-11-10 00:01:29,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 00:01:29,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:29,867 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:29,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:01:29,867 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:29,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:29,868 INFO L85 PathProgramCache]: Analyzing trace with hash 243847667, now seen corresponding path program 1 times [2024-11-10 00:01:29,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:29,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816217894] [2024-11-10 00:01:29,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:29,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 00:01:30,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:30,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816217894] [2024-11-10 00:01:30,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816217894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:30,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:30,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:01:30,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144644533] [2024-11-10 00:01:30,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:30,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:01:30,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:30,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:01:30,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:01:30,092 INFO L87 Difference]: Start difference. First operand 23206 states and 32885 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:30,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:30,297 INFO L93 Difference]: Finished difference Result 40466 states and 57595 transitions. [2024-11-10 00:01:30,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:01:30,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-11-10 00:01:30,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:30,358 INFO L225 Difference]: With dead ends: 40466 [2024-11-10 00:01:30,358 INFO L226 Difference]: Without dead ends: 37520 [2024-11-10 00:01:30,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:01:30,375 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 778 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:30,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 1282 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:01:30,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37520 states. [2024-11-10 00:01:30,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37520 to 26150. [2024-11-10 00:01:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26150 states, 26149 states have (on average 1.4179127308883706) internal successors, (37077), 26149 states have internal predecessors, (37077), 0 states have call successors, (0), 0 states 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:30,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26150 states to 26150 states and 37077 transitions. [2024-11-10 00:01:30,800 INFO L78 Accepts]: Start accepts. Automaton has 26150 states and 37077 transitions. Word has length 98 [2024-11-10 00:01:30,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:30,801 INFO L471 AbstractCegarLoop]: Abstraction has 26150 states and 37077 transitions. [2024-11-10 00:01:30,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:30,801 INFO L276 IsEmpty]: Start isEmpty. Operand 26150 states and 37077 transitions. [2024-11-10 00:01:30,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 00:01:30,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:30,805 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:30,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:01:30,805 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:30,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:30,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1046800349, now seen corresponding path program 1 times [2024-11-10 00:01:30,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:30,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442115619] [2024-11-10 00:01:30,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:30,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:01:30,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:30,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442115619] [2024-11-10 00:01:30,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442115619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:30,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:30,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:30,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603145256] [2024-11-10 00:01:30,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:30,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:30,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:30,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:30,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:30,905 INFO L87 Difference]: Start difference. First operand 26150 states and 37077 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:31,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:31,010 INFO L93 Difference]: Finished difference Result 45331 states and 64379 transitions. [2024-11-10 00:01:31,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:31,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-11-10 00:01:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:31,035 INFO L225 Difference]: With dead ends: 45331 [2024-11-10 00:01:31,035 INFO L226 Difference]: Without dead ends: 19217 [2024-11-10 00:01:31,060 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:31,061 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 62 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:31,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 294 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:01:31,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19217 states. [2024-11-10 00:01:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19217 to 19215. [2024-11-10 00:01:31,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19215 states, 19214 states have (on average 1.4118871656084104) internal successors, (27128), 19214 states have internal predecessors, (27128), 0 states have call successors, (0), 0 states 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:31,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19215 states to 19215 states and 27128 transitions. [2024-11-10 00:01:31,489 INFO L78 Accepts]: Start accepts. Automaton has 19215 states and 27128 transitions. Word has length 99 [2024-11-10 00:01:31,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:31,490 INFO L471 AbstractCegarLoop]: Abstraction has 19215 states and 27128 transitions. [2024-11-10 00:01:31,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:31,490 INFO L276 IsEmpty]: Start isEmpty. Operand 19215 states and 27128 transitions. [2024-11-10 00:01:31,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 00:01:31,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:31,493 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:31,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:01:31,493 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:31,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:31,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1858146286, now seen corresponding path program 1 times [2024-11-10 00:01:31,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:31,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285149028] [2024-11-10 00:01:31,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:31,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:31,967 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:01:31,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:31,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285149028] [2024-11-10 00:01:31,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285149028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:01:31,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077269113] [2024-11-10 00:01:31,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:31,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:01:31,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:01:31,971 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:31,972 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:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:32,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:01:32,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:01:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:01:32,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:01:33,614 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:01:33,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077269113] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:01:33,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:01:33,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-11-10 00:01:33,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031378244] [2024-11-10 00:01:33,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:01:33,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 00:01:33,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:33,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 00:01:33,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2024-11-10 00:01:33,617 INFO L87 Difference]: Start difference. First operand 19215 states and 27128 transitions. Second operand has 26 states, 26 states have (on average 10.76923076923077) internal successors, (280), 25 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:01:38,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:38,608 INFO L93 Difference]: Finished difference Result 189690 states and 269058 transitions. [2024-11-10 00:01:38,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-11-10 00:01:38,609 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.76923076923077) internal successors, (280), 25 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 100 [2024-11-10 00:01:38,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:38,965 INFO L225 Difference]: With dead ends: 189690 [2024-11-10 00:01:38,965 INFO L226 Difference]: Without dead ends: 170519 [2024-11-10 00:01:38,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6191 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3001, Invalid=15089, Unknown=0, NotChecked=0, Total=18090 [2024-11-10 00:01:38,997 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 4020 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 2573 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4020 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 2613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:38,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4020 Valid, 1467 Invalid, 2613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2573 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 00:01:39,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170519 states. [2024-11-10 00:01:41,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170519 to 106855. [2024-11-10 00:01:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106855 states, 106854 states have (on average 1.3921519082112042) internal successors, (148757), 106854 states have internal predecessors, (148757), 0 states have call successors, (0), 0 states 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,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106855 states to 106855 states and 148757 transitions. [2024-11-10 00:01:41,393 INFO L78 Accepts]: Start accepts. Automaton has 106855 states and 148757 transitions. Word has length 100 [2024-11-10 00:01:41,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:41,394 INFO L471 AbstractCegarLoop]: Abstraction has 106855 states and 148757 transitions. [2024-11-10 00:01:41,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.76923076923077) internal successors, (280), 25 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:01:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 106855 states and 148757 transitions. [2024-11-10 00:01:41,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 00:01:41,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:41,404 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:41,420 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:01:41,605 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,SelfDestructingSolverStorable15 [2024-11-10 00:01:41,609 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:41,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:41,610 INFO L85 PathProgramCache]: Analyzing trace with hash 609426287, now seen corresponding path program 1 times [2024-11-10 00:01:41,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:41,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400775901] [2024-11-10 00:01:41,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:41,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:01:42,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:42,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400775901] [2024-11-10 00:01:42,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400775901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:01:42,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144213171] [2024-11-10 00:01:42,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:42,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:01:42,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:01:42,170 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:01:42,172 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:01:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:42,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:01:42,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:01:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:01:42,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:01:43,507 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:01:43,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144213171] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:01:43,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:01:43,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-11-10 00:01:43,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618619695] [2024-11-10 00:01:43,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:01:43,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 00:01:43,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:43,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 00:01:43,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2024-11-10 00:01:43,514 INFO L87 Difference]: Start difference. First operand 106855 states and 148757 transitions. Second operand has 26 states, 26 states have (on average 9.846153846153847) internal successors, (256), 25 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:49,385 INFO L93 Difference]: Finished difference Result 871086 states and 1205574 transitions. [2024-11-10 00:01:49,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-10 00:01:49,386 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.846153846153847) internal successors, (256), 25 states have internal predecessors, (256), 0 states have call successors, (0), 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 100 [2024-11-10 00:01:49,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:50,744 INFO L225 Difference]: With dead ends: 871086 [2024-11-10 00:01:50,744 INFO L226 Difference]: Without dead ends: 764269 [2024-11-10 00:01:50,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2575 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1671, Invalid=7641, Unknown=0, NotChecked=0, Total=9312 [2024-11-10 00:01:50,979 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 4013 mSDsluCounter, 2108 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4013 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 2751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:50,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4013 Valid, 2281 Invalid, 2751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 00:01:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764269 states. [2024-11-10 00:01:58,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764269 to 530812. [2024-11-10 00:01:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530812 states, 530811 states have (on average 1.3698058254256222) internal successors, (727108), 530811 states have internal predecessors, (727108), 0 states have call successors, (0), 0 states 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:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530812 states to 530812 states and 727108 transitions. [2024-11-10 00:02:00,976 INFO L78 Accepts]: Start accepts. Automaton has 530812 states and 727108 transitions. Word has length 100 [2024-11-10 00:02:00,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:00,977 INFO L471 AbstractCegarLoop]: Abstraction has 530812 states and 727108 transitions. [2024-11-10 00:02:00,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.846153846153847) internal successors, (256), 25 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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:00,977 INFO L276 IsEmpty]: Start isEmpty. Operand 530812 states and 727108 transitions. [2024-11-10 00:02:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 00:02:01,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:01,006 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:02:01,046 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:01,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 00:02:01,208 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:01,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:01,209 INFO L85 PathProgramCache]: Analyzing trace with hash 60694302, now seen corresponding path program 1 times [2024-11-10 00:02:01,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:01,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830363131] [2024-11-10 00:02:01,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:01,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:01,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:01,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830363131] [2024-11-10 00:02:01,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830363131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:01,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:01,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:01,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816287797] [2024-11-10 00:02:01,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:01,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:01,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:01,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:01,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:01,316 INFO L87 Difference]: Start difference. First operand 530812 states and 727108 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:04,340 INFO L93 Difference]: Finished difference Result 826865 states and 1132593 transitions. [2024-11-10 00:02:04,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:04,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-10 00:02:04,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:05,652 INFO L225 Difference]: With dead ends: 826865 [2024-11-10 00:02:05,653 INFO L226 Difference]: Without dead ends: 296424 [2024-11-10 00:02:05,884 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:02:05,884 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 52 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:05,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 279 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:06,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296424 states. [2024-11-10 00:02:09,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296424 to 296422. [2024-11-10 00:02:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296422 states, 296421 states have (on average 1.3534736067957398) internal successors, (401198), 296421 states have internal predecessors, (401198), 0 states have call successors, (0), 0 states 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:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296422 states to 296422 states and 401198 transitions. [2024-11-10 00:02:10,098 INFO L78 Accepts]: Start accepts. Automaton has 296422 states and 401198 transitions. Word has length 102 [2024-11-10 00:02:10,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:10,098 INFO L471 AbstractCegarLoop]: Abstraction has 296422 states and 401198 transitions. [2024-11-10 00:02:10,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:10,098 INFO L276 IsEmpty]: Start isEmpty. Operand 296422 states and 401198 transitions. [2024-11-10 00:02:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 00:02:10,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:10,108 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:02:10,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:02:10,108 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:10,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:10,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2091988355, now seen corresponding path program 1 times [2024-11-10 00:02:10,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:10,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113396256] [2024-11-10 00:02:10,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:10,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:10,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:10,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113396256] [2024-11-10 00:02:10,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113396256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:02:10,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171175790] [2024-11-10 00:02:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:10,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:02:10,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:02:10,469 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:10,470 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:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:10,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:02:10,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:02:11,048 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:11,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:02:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:12,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171175790] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:02:12,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:02:12,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-10 00:02:12,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383422602] [2024-11-10 00:02:12,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:02:12,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 00:02:12,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:12,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 00:02:12,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-11-10 00:02:12,268 INFO L87 Difference]: Start difference. First operand 296422 states and 401198 transitions. Second operand has 21 states, 21 states have (on average 11.428571428571429) internal successors, (240), 20 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:16,845 INFO L93 Difference]: Finished difference Result 1500072 states and 2037040 transitions. [2024-11-10 00:02:16,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 00:02:16,845 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 11.428571428571429) internal successors, (240), 20 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-10 00:02:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted.