./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers/diskperf.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers/diskperf.i.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 f0996d70f204c5713a65b04e25037e48d7532ec1ba0c10162e12c5c0d518b4e3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:53:24,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:53:24,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:53:24,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:53:24,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:53:24,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:53:24,828 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:53:24,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:53:24,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:53:24,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:53:24,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:53:24,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:53:24,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:53:24,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:53:24,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:53:24,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:53:24,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:53:24,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:53:24,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:53:24,858 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:53:24,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:53:24,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:53:24,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:53:24,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:53:24,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:53:24,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:53:24,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:53:24,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:53:24,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:53:24,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:53:24,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:53:24,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:53:24,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:53:24,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:53:24,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:53:24,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:53:24,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:53:24,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:53:24,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:53:24,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:53:24,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:53:24,887 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:53:24,923 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:53:24,924 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:53:24,924 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:53:24,924 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:53:24,925 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:53:24,926 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:53:24,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:53:24,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:53:24,927 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:53:24,927 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:53:24,928 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:53:24,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:53:24,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:53:24,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:53:24,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:53:24,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:53:24,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:53:24,930 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:53:24,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:53:24,930 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:53:24,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:53:24,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:53:24,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:53:24,931 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:53:24,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:24,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:53:24,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:53:24,934 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:53:24,934 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:53:24,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:53:24,934 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:53:24,935 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:53:24,935 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:53:24,935 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> f0996d70f204c5713a65b04e25037e48d7532ec1ba0c10162e12c5c0d518b4e3 [2022-11-02 20:53:25,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:53:25,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:53:25,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:53:25,308 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:53:25,309 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:53:25,310 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ntdrivers/diskperf.i.cil-1.c [2022-11-02 20:53:25,386 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/bin/uautomizer-Dbtcem3rbc/data/1439f95f6/dd6b80da6916453ebbde420d365440a3/FLAGc9bcae21d [2022-11-02 20:53:26,084 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:53:26,087 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/sv-benchmarks/c/ntdrivers/diskperf.i.cil-1.c [2022-11-02 20:53:26,126 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/bin/uautomizer-Dbtcem3rbc/data/1439f95f6/dd6b80da6916453ebbde420d365440a3/FLAGc9bcae21d [2022-11-02 20:53:26,207 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/bin/uautomizer-Dbtcem3rbc/data/1439f95f6/dd6b80da6916453ebbde420d365440a3 [2022-11-02 20:53:26,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:53:26,213 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:53:26,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:26,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:53:26,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:53:26,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:26" (1/1) ... [2022-11-02 20:53:26,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c52b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:26, skipping insertion in model container [2022-11-02 20:53:26,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:26" (1/1) ... [2022-11-02 20:53:26,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:53:26,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:53:27,016 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/sv-benchmarks/c/ntdrivers/diskperf.i.cil-1.c[84645,84658] [2022-11-02 20:53:27,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:27,373 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:53:27,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/sv-benchmarks/c/ntdrivers/diskperf.i.cil-1.c[84645,84658] [2022-11-02 20:53:27,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:27,708 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:53:27,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:27 WrapperNode [2022-11-02 20:53:27,708 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:27,709 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:27,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:53:27,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:53:27,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:27" (1/1) ... [2022-11-02 20:53:27,800 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:27" (1/1) ... [2022-11-02 20:53:27,956 INFO L138 Inliner]: procedures = 127, calls = 1459, calls flagged for inlining = 20, calls inlined = 18, statements flattened = 3749 [2022-11-02 20:53:27,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:27,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:53:27,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:53:27,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:53:27,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:27" (1/1) ... [2022-11-02 20:53:27,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:27" (1/1) ... [2022-11-02 20:53:28,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:27" (1/1) ... [2022-11-02 20:53:28,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:27" (1/1) ... [2022-11-02 20:53:28,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:27" (1/1) ... [2022-11-02 20:53:28,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:27" (1/1) ... [2022-11-02 20:53:28,213 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:27" (1/1) ... [2022-11-02 20:53:28,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:27" (1/1) ... [2022-11-02 20:53:28,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:53:28,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:53:28,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:53:28,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:53:28,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:27" (1/1) ... [2022-11-02 20:53:28,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:28,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:28,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:53:28,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1cc1784-6862-45ff-9e4f-33bdee751b1e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:53:28,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 20:53:28,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 20:53:28,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:53:28,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:53:28,382 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-11-02 20:53:28,383 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-11-02 20:53:28,383 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2022-11-02 20:53:28,383 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2022-11-02 20:53:28,383 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-11-02 20:53:28,383 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-11-02 20:53:28,383 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfAddCounters [2022-11-02 20:53:28,384 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfAddCounters [2022-11-02 20:53:28,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 20:53:28,384 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 20:53:28,384 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2022-11-02 20:53:28,384 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2022-11-02 20:53:28,384 INFO L130 BoogieDeclarations]: Found specification of procedure IoWMIRegistrationControl [2022-11-02 20:53:28,384 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWMIRegistrationControl [2022-11-02 20:53:28,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:53:28,385 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-11-02 20:53:28,385 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-11-02 20:53:28,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-02 20:53:28,385 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-02 20:53:28,385 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-11-02 20:53:28,386 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-11-02 20:53:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:53:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:53:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure KeQuerySystemTime [2022-11-02 20:53:28,386 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQuerySystemTime [2022-11-02 20:53:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:53:28,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:53:28,387 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-11-02 20:53:28,387 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-11-02 20:53:28,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:53:28,387 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2022-11-02 20:53:28,387 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2022-11-02 20:53:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:53:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfLogError [2022-11-02 20:53:28,388 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfLogError [2022-11-02 20:53:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:53:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryPerformanceCounter [2022-11-02 20:53:28,388 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryPerformanceCounter [2022-11-02 20:53:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2022-11-02 20:53:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2022-11-02 20:53:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-11-02 20:53:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-11-02 20:53:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-11-02 20:53:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-11-02 20:53:28,390 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2022-11-02 20:53:28,390 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2022-11-02 20:53:28,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:53:28,390 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2022-11-02 20:53:28,390 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2022-11-02 20:53:28,390 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2022-11-02 20:53:28,391 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2022-11-02 20:53:28,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 20:53:28,391 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-11-02 20:53:28,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-11-02 20:53:28,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:53:28,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:53:29,066 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:53:29,069 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:53:29,317 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:53:29,345 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-11-02 20:53:29,345 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-11-02 20:53:29,496 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:53:29,512 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-11-02 20:53:29,512 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-11-02 20:53:30,131 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:53:30,160 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-11-02 20:53:30,161 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-11-02 20:53:30,309 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:53:30,311 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:53:30,319 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:54:19,362 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##61: assume false; [2022-11-02 20:54:19,363 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume !false; [2022-11-02 20:54:19,363 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume !false; [2022-11-02 20:54:19,363 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##128: assume false; [2022-11-02 20:54:19,363 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2022-11-02 20:54:19,363 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2022-11-02 20:54:19,386 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:54:19,397 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:54:19,397 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:54:19,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:19 BoogieIcfgContainer [2022-11-02 20:54:19,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:54:19,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:54:19,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:54:19,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:54:19,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:53:26" (1/3) ... [2022-11-02 20:54:19,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20bf30c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:54:19, skipping insertion in model container [2022-11-02 20:54:19,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:27" (2/3) ... [2022-11-02 20:54:19,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20bf30c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:54:19, skipping insertion in model container [2022-11-02 20:54:19,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:19" (3/3) ... [2022-11-02 20:54:19,409 INFO L112 eAbstractionObserver]: Analyzing ICFG diskperf.i.cil-1.c [2022-11-02 20:54:19,429 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:54:19,429 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:54:19,488 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:54:19,495 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@5775c74c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:54:19,495 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:54:19,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 378 states, 274 states have (on average 1.4197080291970803) internal successors, (389), 292 states have internal predecessors, (389), 80 states have call successors, (80), 22 states have call predecessors, (80), 22 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2022-11-02 20:54:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:54:19,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:19,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:19,511 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:19,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:19,516 INFO L85 PathProgramCache]: Analyzing trace with hash 2013573229, now seen corresponding path program 1 times [2022-11-02 20:54:19,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:19,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992501070] [2022-11-02 20:54:19,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:19,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:21,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:21,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992501070] [2022-11-02 20:54:21,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992501070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:21,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:21,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:21,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187356604] [2022-11-02 20:54:21,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:21,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:54:21,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:21,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:54:21,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:54:21,433 INFO L87 Difference]: Start difference. First operand has 378 states, 274 states have (on average 1.4197080291970803) internal successors, (389), 292 states have internal predecessors, (389), 80 states have call successors, (80), 22 states have call predecessors, (80), 22 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:21,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:21,529 INFO L93 Difference]: Finished difference Result 750 states and 1130 transitions. [2022-11-02 20:54:21,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:54:21,531 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:54:21,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:21,543 INFO L225 Difference]: With dead ends: 750 [2022-11-02 20:54:21,543 INFO L226 Difference]: Without dead ends: 371 [2022-11-02 20:54:21,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:54:21,554 INFO L413 NwaCegarLoop]: 525 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:21,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:54:21,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-11-02 20:54:21,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2022-11-02 20:54:21,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 269 states have (on average 1.3605947955390334) internal successors, (366), 285 states have internal predecessors, (366), 80 states have call successors, (80), 22 states have call predecessors, (80), 21 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-11-02 20:54:21,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 512 transitions. [2022-11-02 20:54:21,625 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 512 transitions. Word has length 17 [2022-11-02 20:54:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:21,625 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 512 transitions. [2022-11-02 20:54:21,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 512 transitions. [2022-11-02 20:54:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:54:21,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:21,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:21,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:54:21,628 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:21,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:21,628 INFO L85 PathProgramCache]: Analyzing trace with hash -6791183, now seen corresponding path program 1 times [2022-11-02 20:54:21,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:21,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208039004] [2022-11-02 20:54:21,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:21,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:24,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:24,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:24,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208039004] [2022-11-02 20:54:24,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208039004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:24,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:24,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:24,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959211987] [2022-11-02 20:54:24,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:24,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:54:24,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:24,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:54:24,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:54:24,031 INFO L87 Difference]: Start difference. First operand 371 states and 512 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:24,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:24,177 INFO L93 Difference]: Finished difference Result 744 states and 1027 transitions. [2022-11-02 20:54:24,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:54:24,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:54:24,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:24,181 INFO L225 Difference]: With dead ends: 744 [2022-11-02 20:54:24,181 INFO L226 Difference]: Without dead ends: 377 [2022-11-02 20:54:24,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:54:24,184 INFO L413 NwaCegarLoop]: 508 mSDtfsCounter, 2 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:24,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1516 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:54:24,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-02 20:54:24,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2022-11-02 20:54:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 273 states have (on average 1.3553113553113554) internal successors, (370), 289 states have internal predecessors, (370), 80 states have call successors, (80), 22 states have call predecessors, (80), 21 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-11-02 20:54:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 516 transitions. [2022-11-02 20:54:24,211 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 516 transitions. Word has length 19 [2022-11-02 20:54:24,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:24,212 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 516 transitions. [2022-11-02 20:54:24,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 516 transitions. [2022-11-02 20:54:24,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:54:24,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:24,214 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:24,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:54:24,214 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:24,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:24,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1840508881, now seen corresponding path program 1 times [2022-11-02 20:54:24,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:24,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676487224] [2022-11-02 20:54:24,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:24,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:27,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:54:27,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:27,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676487224] [2022-11-02 20:54:27,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676487224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:27,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:27,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:27,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965803194] [2022-11-02 20:54:27,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:27,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:27,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:27,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:27,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:27,317 INFO L87 Difference]: Start difference. First operand 375 states and 516 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:27,522 INFO L93 Difference]: Finished difference Result 395 states and 542 transitions. [2022-11-02 20:54:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:27,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 20:54:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:27,526 INFO L225 Difference]: With dead ends: 395 [2022-11-02 20:54:27,526 INFO L226 Difference]: Without dead ends: 375 [2022-11-02 20:54:27,527 INFO L412 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 [2022-11-02 20:54:27,528 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 12 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:27,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 965 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:54:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-11-02 20:54:27,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2022-11-02 20:54:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 273 states have (on average 1.3516483516483517) internal successors, (369), 289 states have internal predecessors, (369), 80 states have call successors, (80), 22 states have call predecessors, (80), 21 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-11-02 20:54:27,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 515 transitions. [2022-11-02 20:54:27,579 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 515 transitions. Word has length 23 [2022-11-02 20:54:27,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:27,579 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 515 transitions. [2022-11-02 20:54:27,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 515 transitions. [2022-11-02 20:54:27,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:54:27,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:27,581 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:27,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:54:27,582 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:27,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:27,582 INFO L85 PathProgramCache]: Analyzing trace with hash 2125296181, now seen corresponding path program 1 times [2022-11-02 20:54:27,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:27,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182826222] [2022-11-02 20:54:27,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:27,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:31,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:54:31,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:31,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182826222] [2022-11-02 20:54:31,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182826222] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:31,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:31,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:31,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006185614] [2022-11-02 20:54:31,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:31,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:31,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:31,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:31,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:31,239 INFO L87 Difference]: Start difference. First operand 375 states and 515 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:33,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:33,694 INFO L93 Difference]: Finished difference Result 869 states and 1216 transitions. [2022-11-02 20:54:33,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:33,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 20:54:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:33,701 INFO L225 Difference]: With dead ends: 869 [2022-11-02 20:54:33,701 INFO L226 Difference]: Without dead ends: 614 [2022-11-02 20:54:33,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:33,704 INFO L413 NwaCegarLoop]: 715 mSDtfsCounter, 431 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:33,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1066 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 75 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 20:54:33,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-11-02 20:54:33,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 594. [2022-11-02 20:54:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 435 states have (on average 1.335632183908046) internal successors, (581), 445 states have internal predecessors, (581), 120 states have call successors, (120), 39 states have call predecessors, (120), 38 states have return successors, (129), 113 states have call predecessors, (129), 109 states have call successors, (129) [2022-11-02 20:54:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 830 transitions. [2022-11-02 20:54:33,742 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 830 transitions. Word has length 25 [2022-11-02 20:54:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:33,743 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 830 transitions. [2022-11-02 20:54:33,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 830 transitions. [2022-11-02 20:54:33,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:54:33,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:33,745 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:54:33,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:54:33,746 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:33,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:33,747 INFO L85 PathProgramCache]: Analyzing trace with hash -642930051, now seen corresponding path program 1 times [2022-11-02 20:54:33,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:33,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111005352] [2022-11-02 20:54:33,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:33,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:54:37,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:37,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111005352] [2022-11-02 20:54:37,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111005352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:37,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:37,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:37,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670011871] [2022-11-02 20:54:37,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:37,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:37,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:37,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:37,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:37,182 INFO L87 Difference]: Start difference. First operand 594 states and 830 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:37,382 INFO L93 Difference]: Finished difference Result 1408 states and 2008 transitions. [2022-11-02 20:54:37,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:37,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 20:54:37,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:37,397 INFO L225 Difference]: With dead ends: 1408 [2022-11-02 20:54:37,397 INFO L226 Difference]: Without dead ends: 945 [2022-11-02 20:54:37,400 INFO L412 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 [2022-11-02 20:54:37,407 INFO L413 NwaCegarLoop]: 584 mSDtfsCounter, 421 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:37,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 924 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:54:37,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2022-11-02 20:54:37,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 915. [2022-11-02 20:54:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 663 states have (on average 1.3423831070889893) internal successors, (890), 674 states have internal predecessors, (890), 189 states have call successors, (189), 62 states have call predecessors, (189), 62 states have return successors, (223), 183 states have call predecessors, (223), 179 states have call successors, (223) [2022-11-02 20:54:37,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1302 transitions. [2022-11-02 20:54:37,485 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1302 transitions. Word has length 33 [2022-11-02 20:54:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:37,486 INFO L495 AbstractCegarLoop]: Abstraction has 915 states and 1302 transitions. [2022-11-02 20:54:37,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:37,487 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1302 transitions. [2022-11-02 20:54:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:54:37,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:37,495 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:54:37,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:54:37,496 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:37,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash 401969732, now seen corresponding path program 1 times [2022-11-02 20:54:37,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:37,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865600080] [2022-11-02 20:54:37,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:37,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:40,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:54:40,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:40,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865600080] [2022-11-02 20:54:40,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865600080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:40,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:40,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:40,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913371911] [2022-11-02 20:54:40,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:40,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:40,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:40,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:40,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:40,520 INFO L87 Difference]: Start difference. First operand 915 states and 1302 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:42,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:42,857 INFO L93 Difference]: Finished difference Result 929 states and 1321 transitions. [2022-11-02 20:54:42,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:42,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 20:54:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:42,863 INFO L225 Difference]: With dead ends: 929 [2022-11-02 20:54:42,864 INFO L226 Difference]: Without dead ends: 925 [2022-11-02 20:54:42,865 INFO L412 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 [2022-11-02 20:54:42,865 INFO L413 NwaCegarLoop]: 486 mSDtfsCounter, 28 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:42,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 909 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 20:54:42,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2022-11-02 20:54:42,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 924. [2022-11-02 20:54:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 673 states have (on average 1.3417533432392272) internal successors, (903), 682 states have internal predecessors, (903), 188 states have call successors, (188), 63 states have call predecessors, (188), 62 states have return successors, (223), 183 states have call predecessors, (223), 179 states have call successors, (223) [2022-11-02 20:54:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1314 transitions. [2022-11-02 20:54:42,925 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1314 transitions. Word has length 33 [2022-11-02 20:54:42,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:42,925 INFO L495 AbstractCegarLoop]: Abstraction has 924 states and 1314 transitions. [2022-11-02 20:54:42,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1314 transitions. [2022-11-02 20:54:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:54:42,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:42,930 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:54:42,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:54:42,931 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:42,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:42,932 INFO L85 PathProgramCache]: Analyzing trace with hash 937185154, now seen corresponding path program 1 times [2022-11-02 20:54:42,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:42,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189533390] [2022-11-02 20:54:42,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:42,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:46,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:54:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:54:46,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:46,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189533390] [2022-11-02 20:54:46,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189533390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:46,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:46,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:54:46,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497166524] [2022-11-02 20:54:46,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:46,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:54:46,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:46,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:54:46,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:54:46,241 INFO L87 Difference]: Start difference. First operand 924 states and 1314 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:54:48,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:50,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:53,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:53,313 INFO L93 Difference]: Finished difference Result 981 states and 1395 transitions. [2022-11-02 20:54:53,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:54:53,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-11-02 20:54:53,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:53,322 INFO L225 Difference]: With dead ends: 981 [2022-11-02 20:54:53,322 INFO L226 Difference]: Without dead ends: 970 [2022-11-02 20:54:53,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:54:53,324 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 648 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 138 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:53,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1084 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 665 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-11-02 20:54:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-11-02 20:54:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 948. [2022-11-02 20:54:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 695 states have (on average 1.3410071942446042) internal successors, (932), 706 states have internal predecessors, (932), 188 states have call successors, (188), 63 states have call predecessors, (188), 64 states have return successors, (232), 183 states have call predecessors, (232), 179 states have call successors, (232) [2022-11-02 20:54:53,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1352 transitions. [2022-11-02 20:54:53,382 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1352 transitions. Word has length 37 [2022-11-02 20:54:53,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:53,382 INFO L495 AbstractCegarLoop]: Abstraction has 948 states and 1352 transitions. [2022-11-02 20:54:53,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:54:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1352 transitions. [2022-11-02 20:54:53,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:54:53,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:53,384 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:54:53,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:54:53,384 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:53,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:53,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1448171803, now seen corresponding path program 1 times [2022-11-02 20:54:53,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:53,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525470248] [2022-11-02 20:54:53,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:53,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:56,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:54:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:54:56,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:56,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525470248] [2022-11-02 20:54:56,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525470248] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:56,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:56,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:54:56,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992554849] [2022-11-02 20:54:56,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:56,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:54:56,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:56,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:54:56,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:54:56,829 INFO L87 Difference]: Start difference. First operand 948 states and 1352 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:54:58,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:01,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:03,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:03,512 INFO L93 Difference]: Finished difference Result 972 states and 1380 transitions. [2022-11-02 20:55:03,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:55:03,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-11-02 20:55:03,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:03,519 INFO L225 Difference]: With dead ends: 972 [2022-11-02 20:55:03,519 INFO L226 Difference]: Without dead ends: 964 [2022-11-02 20:55:03,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:55:03,521 INFO L413 NwaCegarLoop]: 462 mSDtfsCounter, 637 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 134 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:03,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1078 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 661 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-11-02 20:55:03,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2022-11-02 20:55:03,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 948. [2022-11-02 20:55:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 695 states have (on average 1.339568345323741) internal successors, (931), 706 states have internal predecessors, (931), 188 states have call successors, (188), 63 states have call predecessors, (188), 64 states have return successors, (232), 183 states have call predecessors, (232), 179 states have call successors, (232) [2022-11-02 20:55:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1351 transitions. [2022-11-02 20:55:03,602 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1351 transitions. Word has length 38 [2022-11-02 20:55:03,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:03,603 INFO L495 AbstractCegarLoop]: Abstraction has 948 states and 1351 transitions. [2022-11-02 20:55:03,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:55:03,603 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1351 transitions. [2022-11-02 20:55:03,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:55:03,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:03,605 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:55:03,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:55:03,605 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:03,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:03,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2084178201, now seen corresponding path program 1 times [2022-11-02 20:55:03,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:03,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050943154] [2022-11-02 20:55:03,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:03,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:05,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:55:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:55:05,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:05,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050943154] [2022-11-02 20:55:05,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050943154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:05,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:05,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:55:05,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548986915] [2022-11-02 20:55:05,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:05,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:55:05,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:05,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:55:05,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:55:05,830 INFO L87 Difference]: Start difference. First operand 948 states and 1351 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:55:07,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:09,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:09,249 INFO L93 Difference]: Finished difference Result 1745 states and 2521 transitions. [2022-11-02 20:55:09,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:55:09,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-11-02 20:55:09,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:09,260 INFO L225 Difference]: With dead ends: 1745 [2022-11-02 20:55:09,260 INFO L226 Difference]: Without dead ends: 1716 [2022-11-02 20:55:09,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:55:09,262 INFO L413 NwaCegarLoop]: 606 mSDtfsCounter, 674 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 138 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:09,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 1091 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 291 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-11-02 20:55:09,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2022-11-02 20:55:09,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1677. [2022-11-02 20:55:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1677 states, 1218 states have (on average 1.348111658456486) internal successors, (1642), 1233 states have internal predecessors, (1642), 338 states have call successors, (338), 119 states have call predecessors, (338), 120 states have return successors, (446), 334 states have call predecessors, (446), 329 states have call successors, (446) [2022-11-02 20:55:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2426 transitions. [2022-11-02 20:55:09,384 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2426 transitions. Word has length 39 [2022-11-02 20:55:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:09,385 INFO L495 AbstractCegarLoop]: Abstraction has 1677 states and 2426 transitions. [2022-11-02 20:55:09,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:55:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2426 transitions. [2022-11-02 20:55:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:55:09,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:09,387 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:55:09,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:55:09,387 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:09,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:09,388 INFO L85 PathProgramCache]: Analyzing trace with hash 193456973, now seen corresponding path program 1 times [2022-11-02 20:55:09,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:09,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639404313] [2022-11-02 20:55:09,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:09,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:12,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:55:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:55:12,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:12,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639404313] [2022-11-02 20:55:12,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639404313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:12,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:12,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:55:12,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589931063] [2022-11-02 20:55:12,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:12,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:55:12,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:12,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:55:12,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:55:12,180 INFO L87 Difference]: Start difference. First operand 1677 states and 2426 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:55:14,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:16,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:19,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:19,175 INFO L93 Difference]: Finished difference Result 1710 states and 2471 transitions. [2022-11-02 20:55:19,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:55:19,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-11-02 20:55:19,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:19,187 INFO L225 Difference]: With dead ends: 1710 [2022-11-02 20:55:19,188 INFO L226 Difference]: Without dead ends: 1692 [2022-11-02 20:55:19,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:19,190 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 152 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 71 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:19,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1339 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 437 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-11-02 20:55:19,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2022-11-02 20:55:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1673. [2022-11-02 20:55:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1215 states have (on average 1.348148148148148) internal successors, (1638), 1230 states have internal predecessors, (1638), 337 states have call successors, (337), 119 states have call predecessors, (337), 120 states have return successors, (445), 333 states have call predecessors, (445), 328 states have call successors, (445) [2022-11-02 20:55:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2420 transitions. [2022-11-02 20:55:19,350 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2420 transitions. Word has length 40 [2022-11-02 20:55:19,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:19,351 INFO L495 AbstractCegarLoop]: Abstraction has 1673 states and 2420 transitions. [2022-11-02 20:55:19,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:55:19,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2420 transitions. [2022-11-02 20:55:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:55:19,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:19,352 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:55:19,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:55:19,353 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:19,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:19,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1037165454, now seen corresponding path program 1 times [2022-11-02 20:55:19,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:19,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100419802] [2022-11-02 20:55:19,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:19,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:21,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:55:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:55:22,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:22,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100419802] [2022-11-02 20:55:22,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100419802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:22,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:22,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:55:22,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892418652] [2022-11-02 20:55:22,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:22,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:55:22,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:22,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:55:22,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:55:22,013 INFO L87 Difference]: Start difference. First operand 1673 states and 2420 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:55:24,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:26,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:28,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:31,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:55:34,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:35,599 INFO L93 Difference]: Finished difference Result 2633 states and 4035 transitions. [2022-11-02 20:55:35,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:55:35,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-11-02 20:55:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:35,617 INFO L225 Difference]: With dead ends: 2633 [2022-11-02 20:55:35,618 INFO L226 Difference]: Without dead ends: 2625 [2022-11-02 20:55:35,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:55:35,621 INFO L413 NwaCegarLoop]: 605 mSDtfsCounter, 425 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 137 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:35,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1113 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 607 Invalid, 5 Unknown, 0 Unchecked, 13.3s Time] [2022-11-02 20:55:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2022-11-02 20:55:35,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 1815. [2022-11-02 20:55:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1317 states have (on average 1.3500379650721337) internal successors, (1778), 1336 states have internal predecessors, (1778), 365 states have call successors, (365), 128 states have call predecessors, (365), 132 states have return successors, (494), 360 states have call predecessors, (494), 356 states have call successors, (494) [2022-11-02 20:55:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2637 transitions. [2022-11-02 20:55:35,795 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2637 transitions. Word has length 43 [2022-11-02 20:55:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:35,796 INFO L495 AbstractCegarLoop]: Abstraction has 1815 states and 2637 transitions. [2022-11-02 20:55:35,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:55:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2637 transitions. [2022-11-02 20:55:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:55:35,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:35,798 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:55:35,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:55:35,798 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:35,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:35,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1937989103, now seen corresponding path program 1 times [2022-11-02 20:55:35,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:35,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089625242] [2022-11-02 20:55:35,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:35,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:39,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:55:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:55:39,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:39,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089625242] [2022-11-02 20:55:39,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089625242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:39,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:39,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:55:39,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851250534] [2022-11-02 20:55:39,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:39,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:39,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:39,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:39,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:39,304 INFO L87 Difference]: Start difference. First operand 1815 states and 2637 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:55:41,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:43,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:47,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:55:48,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:48,625 INFO L93 Difference]: Finished difference Result 1864 states and 2700 transitions. [2022-11-02 20:55:48,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:55:48,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-11-02 20:55:48,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:48,637 INFO L225 Difference]: With dead ends: 1864 [2022-11-02 20:55:48,637 INFO L226 Difference]: Without dead ends: 1832 [2022-11-02 20:55:48,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:55:48,640 INFO L413 NwaCegarLoop]: 476 mSDtfsCounter, 165 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 72 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:48,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1656 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 623 Invalid, 3 Unknown, 0 Unchecked, 9.1s Time] [2022-11-02 20:55:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2022-11-02 20:55:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1813. [2022-11-02 20:55:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1316 states have (on average 1.3487841945288754) internal successors, (1775), 1335 states have internal predecessors, (1775), 364 states have call successors, (364), 128 states have call predecessors, (364), 132 states have return successors, (493), 359 states have call predecessors, (493), 355 states have call successors, (493) [2022-11-02 20:55:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2632 transitions. [2022-11-02 20:55:48,841 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2632 transitions. Word has length 44 [2022-11-02 20:55:48,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:48,841 INFO L495 AbstractCegarLoop]: Abstraction has 1813 states and 2632 transitions. [2022-11-02 20:55:48,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:55:48,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2632 transitions. [2022-11-02 20:55:48,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:55:48,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:48,842 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:55:48,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:55:48,843 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:48,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:48,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1633946811, now seen corresponding path program 1 times [2022-11-02 20:55:48,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:48,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744605029] [2022-11-02 20:55:48,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:48,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:55:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:55:51,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:51,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744605029] [2022-11-02 20:55:51,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744605029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:51,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:51,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:55:51,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980263844] [2022-11-02 20:55:51,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:51,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:51,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:51,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:51,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:51,660 INFO L87 Difference]: Start difference. First operand 1813 states and 2632 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:55:53,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:55,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:57,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:04,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:05,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:05,059 INFO L93 Difference]: Finished difference Result 2635 states and 4032 transitions. [2022-11-02 20:56:05,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:56:05,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-11-02 20:56:05,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:05,077 INFO L225 Difference]: With dead ends: 2635 [2022-11-02 20:56:05,077 INFO L226 Difference]: Without dead ends: 2627 [2022-11-02 20:56:05,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:56:05,081 INFO L413 NwaCegarLoop]: 576 mSDtfsCounter, 1172 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 477 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:05,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 1214 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 985 Invalid, 4 Unknown, 0 Unchecked, 12.8s Time] [2022-11-02 20:56:05,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2022-11-02 20:56:05,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 1813. [2022-11-02 20:56:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1316 states have (on average 1.3480243161094225) internal successors, (1774), 1335 states have internal predecessors, (1774), 364 states have call successors, (364), 128 states have call predecessors, (364), 132 states have return successors, (493), 359 states have call predecessors, (493), 355 states have call successors, (493) [2022-11-02 20:56:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2631 transitions. [2022-11-02 20:56:05,336 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2631 transitions. Word has length 44 [2022-11-02 20:56:05,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:05,336 INFO L495 AbstractCegarLoop]: Abstraction has 1813 states and 2631 transitions. [2022-11-02 20:56:05,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:56:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2631 transitions. [2022-11-02 20:56:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:56:05,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:05,343 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:56:05,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:56:05,343 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:05,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:05,344 INFO L85 PathProgramCache]: Analyzing trace with hash -9767716, now seen corresponding path program 1 times [2022-11-02 20:56:05,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:05,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523988939] [2022-11-02 20:56:05,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:05,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:08,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:56:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:56:08,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:08,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523988939] [2022-11-02 20:56:08,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523988939] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:08,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:08,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:56:08,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803249198] [2022-11-02 20:56:08,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:08,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:56:08,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:08,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:56:08,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:56:08,963 INFO L87 Difference]: Start difference. First operand 1813 states and 2631 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:56:11,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:13,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:15,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:17,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:19,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:21,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:23,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:25,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:31,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:32,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:32,720 INFO L93 Difference]: Finished difference Result 1982 states and 2970 transitions. [2022-11-02 20:56:32,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:56:32,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-11-02 20:56:32,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:32,735 INFO L225 Difference]: With dead ends: 1982 [2022-11-02 20:56:32,735 INFO L226 Difference]: Without dead ends: 1978 [2022-11-02 20:56:32,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:56:32,738 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 91 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 75 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:32,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 2405 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1044 Invalid, 9 Unknown, 0 Unchecked, 23.4s Time] [2022-11-02 20:56:32,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2022-11-02 20:56:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1820. [2022-11-02 20:56:32,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1323 states have (on average 1.346938775510204) internal successors, (1782), 1342 states have internal predecessors, (1782), 364 states have call successors, (364), 128 states have call predecessors, (364), 132 states have return successors, (493), 359 states have call predecessors, (493), 355 states have call successors, (493) [2022-11-02 20:56:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 2639 transitions. [2022-11-02 20:56:32,922 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 2639 transitions. Word has length 45 [2022-11-02 20:56:32,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:32,923 INFO L495 AbstractCegarLoop]: Abstraction has 1820 states and 2639 transitions. [2022-11-02 20:56:32,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:56:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2639 transitions. [2022-11-02 20:56:32,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:56:32,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:32,925 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:56:32,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:56:32,925 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:32,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:32,926 INFO L85 PathProgramCache]: Analyzing trace with hash -10044546, now seen corresponding path program 1 times [2022-11-02 20:56:32,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:32,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464421412] [2022-11-02 20:56:32,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:32,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:35,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:56:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:56:35,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:35,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464421412] [2022-11-02 20:56:35,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464421412] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:35,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:35,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:56:35,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111937889] [2022-11-02 20:56:35,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:35,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:56:35,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:35,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:56:35,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:56:35,785 INFO L87 Difference]: Start difference. First operand 1820 states and 2639 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:56:37,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:40,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:42,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:46,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:56:48,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:48,969 INFO L93 Difference]: Finished difference Result 2636 states and 4032 transitions. [2022-11-02 20:56:48,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:56:48,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-11-02 20:56:48,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:48,981 INFO L225 Difference]: With dead ends: 2636 [2022-11-02 20:56:48,981 INFO L226 Difference]: Without dead ends: 2620 [2022-11-02 20:56:48,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:56:48,984 INFO L413 NwaCegarLoop]: 575 mSDtfsCounter, 1156 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 476 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:48,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 1211 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 982 Invalid, 4 Unknown, 0 Unchecked, 12.5s Time] [2022-11-02 20:56:48,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2620 states. [2022-11-02 20:56:49,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 1812. [2022-11-02 20:56:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1316 states have (on average 1.3472644376899696) internal successors, (1773), 1335 states have internal predecessors, (1773), 363 states have call successors, (363), 128 states have call predecessors, (363), 132 states have return successors, (492), 358 states have call predecessors, (492), 354 states have call successors, (492) [2022-11-02 20:56:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2628 transitions. [2022-11-02 20:56:49,174 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2628 transitions. Word has length 45 [2022-11-02 20:56:49,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:49,175 INFO L495 AbstractCegarLoop]: Abstraction has 1812 states and 2628 transitions. [2022-11-02 20:56:49,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:56:49,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2628 transitions. [2022-11-02 20:56:49,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:56:49,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:49,176 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:56:49,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:56:49,177 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:49,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:49,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1045402083, now seen corresponding path program 1 times [2022-11-02 20:56:49,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:49,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227561541] [2022-11-02 20:56:49,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:49,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:56:51,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:51,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227561541] [2022-11-02 20:56:51,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227561541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:51,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:51,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:56:51,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680944] [2022-11-02 20:56:51,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:51,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:56:51,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:51,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:56:51,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:56:51,963 INFO L87 Difference]: Start difference. First operand 1812 states and 2628 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:52,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:52,887 INFO L93 Difference]: Finished difference Result 1839 states and 2653 transitions. [2022-11-02 20:56:52,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:56:52,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-02 20:56:52,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:52,895 INFO L225 Difference]: With dead ends: 1839 [2022-11-02 20:56:52,895 INFO L226 Difference]: Without dead ends: 1815 [2022-11-02 20:56:52,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:56:52,897 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 478 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:52,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 752 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:56:52,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2022-11-02 20:56:53,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1804. [2022-11-02 20:56:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1309 states have (on average 1.3475935828877006) internal successors, (1764), 1329 states have internal predecessors, (1764), 363 states have call successors, (363), 128 states have call predecessors, (363), 131 states have return successors, (490), 356 states have call predecessors, (490), 354 states have call successors, (490) [2022-11-02 20:56:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2617 transitions. [2022-11-02 20:56:53,086 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2617 transitions. Word has length 44 [2022-11-02 20:56:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:53,086 INFO L495 AbstractCegarLoop]: Abstraction has 1804 states and 2617 transitions. [2022-11-02 20:56:53,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:53,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2617 transitions. [2022-11-02 20:56:53,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:56:53,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:53,088 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:56:53,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:56:53,088 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:53,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:53,091 INFO L85 PathProgramCache]: Analyzing trace with hash 470915374, now seen corresponding path program 1 times [2022-11-02 20:56:53,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:53,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54583908] [2022-11-02 20:56:53,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:53,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:56:55,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:55,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54583908] [2022-11-02 20:56:55,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54583908] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:55,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:55,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:56:55,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207675821] [2022-11-02 20:56:55,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:55,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:56:55,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:55,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:56:55,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:56:55,683 INFO L87 Difference]: Start difference. First operand 1804 states and 2617 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:56,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:56,668 INFO L93 Difference]: Finished difference Result 1842 states and 2658 transitions. [2022-11-02 20:56:56,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:56:56,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-02 20:56:56,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:56,677 INFO L225 Difference]: With dead ends: 1842 [2022-11-02 20:56:56,678 INFO L226 Difference]: Without dead ends: 1805 [2022-11-02 20:56:56,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:56:56,680 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 465 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:56,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 761 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:56:56,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2022-11-02 20:56:56,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1803. [2022-11-02 20:56:56,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1308 states have (on average 1.345565749235474) internal successors, (1760), 1328 states have internal predecessors, (1760), 363 states have call successors, (363), 128 states have call predecessors, (363), 131 states have return successors, (489), 356 states have call predecessors, (489), 354 states have call successors, (489) [2022-11-02 20:56:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2612 transitions. [2022-11-02 20:56:56,895 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2612 transitions. Word has length 44 [2022-11-02 20:56:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:56,896 INFO L495 AbstractCegarLoop]: Abstraction has 1803 states and 2612 transitions. [2022-11-02 20:56:56,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:56,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2612 transitions. [2022-11-02 20:56:56,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:56:56,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:56,898 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:56:56,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:56:56,898 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:56,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:56,899 INFO L85 PathProgramCache]: Analyzing trace with hash -103073746, now seen corresponding path program 1 times [2022-11-02 20:56:56,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:56,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580342951] [2022-11-02 20:56:56,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:56,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:58,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:56:58,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:58,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580342951] [2022-11-02 20:56:58,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580342951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:58,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:58,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:56:58,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39040856] [2022-11-02 20:56:58,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:58,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:58,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:58,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:58,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:58,757 INFO L87 Difference]: Start difference. First operand 1803 states and 2612 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:00,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:57:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:01,272 INFO L93 Difference]: Finished difference Result 2542 states and 3790 transitions. [2022-11-02 20:57:01,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:01,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-02 20:57:01,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:01,286 INFO L225 Difference]: With dead ends: 2542 [2022-11-02 20:57:01,286 INFO L226 Difference]: Without dead ends: 2529 [2022-11-02 20:57:01,288 INFO L412 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 [2022-11-02 20:57:01,289 INFO L413 NwaCegarLoop]: 762 mSDtfsCounter, 321 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:01,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1173 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 20:57:01,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2022-11-02 20:57:01,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 1803. [2022-11-02 20:57:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1308 states have (on average 1.3432721712538227) internal successors, (1757), 1328 states have internal predecessors, (1757), 362 states have call successors, (362), 128 states have call predecessors, (362), 132 states have return successors, (497), 356 states have call predecessors, (497), 354 states have call successors, (497) [2022-11-02 20:57:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2616 transitions. [2022-11-02 20:57:01,467 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2616 transitions. Word has length 44 [2022-11-02 20:57:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:01,468 INFO L495 AbstractCegarLoop]: Abstraction has 1803 states and 2616 transitions. [2022-11-02 20:57:01,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:01,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2616 transitions. [2022-11-02 20:57:01,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:57:01,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:01,469 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:57:01,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:57:01,470 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:01,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:01,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1553092361, now seen corresponding path program 1 times [2022-11-02 20:57:01,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:01,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218808364] [2022-11-02 20:57:01,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:01,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:57:04,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:04,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218808364] [2022-11-02 20:57:04,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218808364] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:04,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:04,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:57:04,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938735470] [2022-11-02 20:57:04,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:04,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:57:04,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:04,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:57:04,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:57:04,183 INFO L87 Difference]: Start difference. First operand 1803 states and 2616 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:06,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:57:08,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:57:10,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []