./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/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_20c2b729-8b15-48d5-b065-1cc0b2e8917c/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/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 64bit --witnessprinter.graph.data.programhash 2eef4809e0fb5b801f2479dfde07a6f5e1ac3784201f878d167f0654e03bdeae --- 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:56:40,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:56:40,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:56:40,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:56:40,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:56:40,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:56:40,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:56:40,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:56:40,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:56:40,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:56:40,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:56:40,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:56:40,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:56:40,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:56:40,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:56:40,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:56:40,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:56:40,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:56:40,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:56:40,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:56:40,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:56:40,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:56:40,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:56:40,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:56:40,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:56:40,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:56:40,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:56:40,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:56:40,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:56:40,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:56:40,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:56:40,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:56:40,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:56:40,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:56:40,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:56:40,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:56:40,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:56:40,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:56:40,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:56:40,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:56:40,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:56:40,577 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:56:40,621 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:56:40,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:56:40,622 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:56:40,623 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:56:40,624 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:56:40,624 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:56:40,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:56:40,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:56:40,625 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:56:40,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:56:40,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:56:40,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:56:40,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:56:40,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:56:40,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:56:40,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:56:40,628 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:56:40,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:56:40,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:56:40,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:56:40,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:56:40,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:56:40,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:56:40,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:56:40,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:56:40,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:56:40,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:56:40,631 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:56:40,631 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:56:40,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:56:40,632 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_20c2b729-8b15-48d5-b065-1cc0b2e8917c/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_20c2b729-8b15-48d5-b065-1cc0b2e8917c/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2eef4809e0fb5b801f2479dfde07a6f5e1ac3784201f878d167f0654e03bdeae [2022-11-02 20:56:40,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:56:40,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:56:40,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:56:40,957 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:56:40,958 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:56:40,959 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i [2022-11-02 20:56:41,036 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/bin/uautomizer-Dbtcem3rbc/data/23f6d0bcd/60fc129b8d904863a9b7cc4951012b7b/FLAGfd73a03eb [2022-11-02 20:56:42,100 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:56:42,101 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i [2022-11-02 20:56:42,152 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/bin/uautomizer-Dbtcem3rbc/data/23f6d0bcd/60fc129b8d904863a9b7cc4951012b7b/FLAGfd73a03eb [2022-11-02 20:56:42,504 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/bin/uautomizer-Dbtcem3rbc/data/23f6d0bcd/60fc129b8d904863a9b7cc4951012b7b [2022-11-02 20:56:42,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:56:42,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:56:42,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:56:42,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:56:42,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:56:42,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:56:42" (1/1) ... [2022-11-02 20:56:42,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e25b31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:42, skipping insertion in model container [2022-11-02 20:56:42,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:56:42" (1/1) ... [2022-11-02 20:56:42,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:56:42,668 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:56:44,701 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_20c2b729-8b15-48d5-b065-1cc0b2e8917c/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i[269371,269384] [2022-11-02 20:56:44,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:56:44,907 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:56:45,423 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_20c2b729-8b15-48d5-b065-1cc0b2e8917c/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i[269371,269384] [2022-11-02 20:56:45,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:56:45,564 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:56:45,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:45 WrapperNode [2022-11-02 20:56:45,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:56:45,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:56:45,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:56:45,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:56:45,576 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:56:45" (1/1) ... [2022-11-02 20:56:45,692 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:56:45" (1/1) ... [2022-11-02 20:56:45,985 INFO L138 Inliner]: procedures = 282, calls = 3066, calls flagged for inlining = 129, calls inlined = 120, statements flattened = 6764 [2022-11-02 20:56:45,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:56:45,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:56:45,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:56:45,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:56:45,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:45" (1/1) ... [2022-11-02 20:56:45,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:45" (1/1) ... [2022-11-02 20:56:46,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:45" (1/1) ... [2022-11-02 20:56:46,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:45" (1/1) ... [2022-11-02 20:56:46,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:45" (1/1) ... [2022-11-02 20:56:46,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:45" (1/1) ... [2022-11-02 20:56:46,437 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:45" (1/1) ... [2022-11-02 20:56:46,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:45" (1/1) ... [2022-11-02 20:56:46,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:56:46,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:56:46,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:56:46,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:56:46,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:45" (1/1) ... [2022-11-02 20:56:46,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:56:46,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:46,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:56:46,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:56:46,666 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2022-11-02 20:56:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_del [2022-11-02 20:56:46,667 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_del [2022-11-02 20:56:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 20:56:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:56:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure driver_remove_file [2022-11-02 20:56:46,668 INFO L138 BoogieDeclarations]: Found implementation of procedure driver_remove_file [2022-11-02 20:56:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure find_partition [2022-11-02 20:56:46,668 INFO L138 BoogieDeclarations]: Found implementation of procedure find_partition [2022-11-02 20:56:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2022-11-02 20:56:46,668 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2022-11-02 20:56:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_block_when_processing_errors [2022-11-02 20:56:46,669 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_block_when_processing_errors [2022-11-02 20:56:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2022-11-02 20:56:46,669 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2022-11-02 20:56:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-11-02 20:56:46,670 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-11-02 20:56:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:56:46,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:56:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure class_unregister [2022-11-02 20:56:46,670 INFO L138 BoogieDeclarations]: Found implementation of procedure class_unregister [2022-11-02 20:56:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-11-02 20:56:46,671 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-11-02 20:56:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 20:56:46,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 20:56:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure tape_name [2022-11-02 20:56:46,672 INFO L138 BoogieDeclarations]: Found implementation of procedure tape_name [2022-11-02 20:56:46,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-11-02 20:56:46,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-11-02 20:56:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-02 20:56:46,673 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-02 20:56:46,674 INFO L130 BoogieDeclarations]: Found specification of procedure st_int_ioctl [2022-11-02 20:56:46,674 INFO L138 BoogieDeclarations]: Found implementation of procedure st_int_ioctl [2022-11-02 20:56:46,674 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_rq_timeout [2022-11-02 20:56:46,674 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_rq_timeout [2022-11-02 20:56:46,674 INFO L130 BoogieDeclarations]: Found specification of procedure set_mode_densblk [2022-11-02 20:56:46,674 INFO L138 BoogieDeclarations]: Found implementation of procedure set_mode_densblk [2022-11-02 20:56:46,675 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-11-02 20:56:46,675 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-11-02 20:56:46,675 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_ioctl [2022-11-02 20:56:46,675 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_ioctl [2022-11-02 20:56:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:56:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_st_ref_mutex [2022-11-02 20:56:46,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_st_ref_mutex [2022-11-02 20:56:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure read_mode_page [2022-11-02 20:56:46,676 INFO L138 BoogieDeclarations]: Found implementation of procedure read_mode_page [2022-11-02 20:56:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure do_door_lock [2022-11-02 20:56:46,677 INFO L138 BoogieDeclarations]: Found implementation of procedure do_door_lock [2022-11-02 20:56:46,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:56:46,677 INFO L130 BoogieDeclarations]: Found specification of procedure put_page [2022-11-02 20:56:46,677 INFO L138 BoogieDeclarations]: Found implementation of procedure put_page [2022-11-02 20:56:46,677 INFO L130 BoogieDeclarations]: Found specification of procedure st_do_scsi [2022-11-02 20:56:46,677 INFO L138 BoogieDeclarations]: Found implementation of procedure st_do_scsi [2022-11-02 20:56:46,678 INFO L130 BoogieDeclarations]: Found specification of procedure __xadd_wrong_size [2022-11-02 20:56:46,678 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2022-11-02 20:56:46,678 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2022-11-02 20:56:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2022-11-02 20:56:46,680 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2022-11-02 20:56:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure driver_unregister [2022-11-02 20:56:46,680 INFO L138 BoogieDeclarations]: Found implementation of procedure driver_unregister [2022-11-02 20:56:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:56:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure st_release_request [2022-11-02 20:56:46,681 INFO L138 BoogieDeclarations]: Found implementation of procedure st_release_request [2022-11-02 20:56:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:56:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure remove_cdevs [2022-11-02 20:56:46,682 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_cdevs [2022-11-02 20:56:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-11-02 20:56:46,682 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-11-02 20:56:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-11-02 20:56:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-11-02 20:56:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure get_location [2022-11-02 20:56:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure get_location [2022-11-02 20:56:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure st_compression [2022-11-02 20:56:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure st_compression [2022-11-02 20:56:46,684 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_autopm_put_device [2022-11-02 20:56:46,684 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_autopm_put_device [2022-11-02 20:56:46,684 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev_region [2022-11-02 20:56:46,684 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev_region [2022-11-02 20:56:46,685 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-02 20:56:46,685 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-02 20:56:46,685 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-02 20:56:46,685 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-02 20:56:46,685 INFO L130 BoogieDeclarations]: Found specification of procedure check_tape [2022-11-02 20:56:46,685 INFO L138 BoogieDeclarations]: Found implementation of procedure check_tape [2022-11-02 20:56:46,685 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-11-02 20:56:46,686 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-11-02 20:56:46,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-11-02 20:56:46,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-11-02 20:56:46,687 INFO L130 BoogieDeclarations]: Found specification of procedure switch_partition [2022-11-02 20:56:46,687 INFO L138 BoogieDeclarations]: Found implementation of procedure switch_partition [2022-11-02 20:56:46,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock_of_scsi_tape [2022-11-02 20:56:46,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock_of_scsi_tape [2022-11-02 20:56:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 20:56:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-11-02 20:56:46,688 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-11-02 20:56:46,689 INFO L130 BoogieDeclarations]: Found specification of procedure setup_buffering [2022-11-02 20:56:46,689 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_buffering [2022-11-02 20:56:46,689 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-11-02 20:56:46,689 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-11-02 20:56:46,690 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_tape_put [2022-11-02 20:56:46,690 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_tape_put [2022-11-02 20:56:46,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 20:56:46,691 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_cmd_ioctl [2022-11-02 20:56:46,691 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_cmd_ioctl [2022-11-02 20:56:46,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:56:46,691 INFO L130 BoogieDeclarations]: Found specification of procedure create_one_cdev [2022-11-02 20:56:46,691 INFO L138 BoogieDeclarations]: Found implementation of procedure create_one_cdev [2022-11-02 20:56:46,691 INFO L130 BoogieDeclarations]: Found specification of procedure queue_dma_alignment [2022-11-02 20:56:46,692 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_dma_alignment [2022-11-02 20:56:46,692 INFO L130 BoogieDeclarations]: Found specification of procedure do_load_unload [2022-11-02 20:56:46,692 INFO L138 BoogieDeclarations]: Found implementation of procedure do_load_unload [2022-11-02 20:56:46,692 INFO L130 BoogieDeclarations]: Found specification of procedure st_flush_write_buffer [2022-11-02 20:56:46,693 INFO L138 BoogieDeclarations]: Found implementation of procedure st_flush_write_buffer [2022-11-02 20:56:46,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 20:56:46,693 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 20:56:46,693 INFO L130 BoogieDeclarations]: Found specification of procedure enlarge_buffer [2022-11-02 20:56:46,693 INFO L138 BoogieDeclarations]: Found implementation of procedure enlarge_buffer [2022-11-02 20:56:46,694 INFO L130 BoogieDeclarations]: Found specification of procedure cross_eof [2022-11-02 20:56:46,695 INFO L138 BoogieDeclarations]: Found implementation of procedure cross_eof [2022-11-02 20:56:46,697 INFO L130 BoogieDeclarations]: Found specification of procedure st_chk_result [2022-11-02 20:56:46,698 INFO L138 BoogieDeclarations]: Found implementation of procedure st_chk_result [2022-11-02 20:56:46,698 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_held [2022-11-02 20:56:46,698 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_held [2022-11-02 20:56:46,699 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 20:56:46,701 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 20:56:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure write_behind_check [2022-11-02 20:56:46,701 INFO L138 BoogieDeclarations]: Found implementation of procedure write_behind_check [2022-11-02 20:56:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:56:46,707 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-11-02 20:56:46,707 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-11-02 20:56:46,707 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2022-11-02 20:56:46,707 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2022-11-02 20:56:46,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 20:56:46,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 20:56:46,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_st_ref_mutex [2022-11-02 20:56:46,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_st_ref_mutex [2022-11-02 20:56:46,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:56:46,708 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-11-02 20:56:46,708 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-11-02 20:56:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:56:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure flush_buffer [2022-11-02 20:56:46,709 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_buffer [2022-11-02 20:56:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2022-11-02 20:56:46,709 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2022-11-02 20:56:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:56:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-11-02 20:56:46,710 INFO L130 BoogieDeclarations]: Found specification of procedure driver_create_file [2022-11-02 20:56:46,710 INFO L138 BoogieDeclarations]: Found implementation of procedure driver_create_file [2022-11-02 20:56:46,710 INFO L130 BoogieDeclarations]: Found specification of procedure release_buffering [2022-11-02 20:56:46,710 INFO L138 BoogieDeclarations]: Found implementation of procedure release_buffering [2022-11-02 20:56:46,710 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2022-11-02 20:56:46,710 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2022-11-02 20:56:46,710 INFO L130 BoogieDeclarations]: Found specification of procedure normalize_buffer [2022-11-02 20:56:46,711 INFO L138 BoogieDeclarations]: Found implementation of procedure normalize_buffer [2022-11-02 20:56:46,711 INFO L130 BoogieDeclarations]: Found specification of procedure write_mode_page [2022-11-02 20:56:46,711 INFO L138 BoogieDeclarations]: Found implementation of procedure write_mode_page [2022-11-02 20:56:46,711 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-02 20:56:46,711 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-02 20:56:46,712 INFO L130 BoogieDeclarations]: Found specification of procedure rw_checks [2022-11-02 20:56:46,712 INFO L138 BoogieDeclarations]: Found implementation of procedure rw_checks [2022-11-02 20:56:46,712 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2022-11-02 20:56:46,713 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2022-11-02 20:56:46,713 INFO L130 BoogieDeclarations]: Found specification of procedure idr_remove [2022-11-02 20:56:46,713 INFO L138 BoogieDeclarations]: Found implementation of procedure idr_remove [2022-11-02 20:56:46,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock_of_scsi_tape [2022-11-02 20:56:46,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock_of_scsi_tape [2022-11-02 20:56:46,713 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-11-02 20:56:46,713 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-11-02 20:56:46,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:56:46,714 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_autopm_get_device [2022-11-02 20:56:46,714 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_autopm_get_device [2022-11-02 20:56:46,714 INFO L130 BoogieDeclarations]: Found specification of procedure set_location [2022-11-02 20:56:46,714 INFO L138 BoogieDeclarations]: Found implementation of procedure set_location [2022-11-02 20:56:46,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:56:46,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:56:47,882 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:56:47,889 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:56:57,598 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:56:57,627 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:56:57,627 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:56:57,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:56:57 BoogieIcfgContainer [2022-11-02 20:56:57,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:56:57,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:56:57,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:56:57,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:56:57,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:56:42" (1/3) ... [2022-11-02 20:56:57,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7609e51e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:56:57, skipping insertion in model container [2022-11-02 20:56:57,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:45" (2/3) ... [2022-11-02 20:56:57,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7609e51e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:56:57, skipping insertion in model container [2022-11-02 20:56:57,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:56:57" (3/3) ... [2022-11-02 20:56:57,643 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i [2022-11-02 20:56:57,663 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:56:57,665 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:56:57,788 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:56:57,796 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;@5c6986c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:56:57,797 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:56:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 2115 states, 1690 states have (on average 1.485207100591716) internal successors, (2510), 1712 states have internal predecessors, (2510), 345 states have call successors, (345), 78 states have call predecessors, (345), 78 states have return successors, (345), 345 states have call predecessors, (345), 345 states have call successors, (345) [2022-11-02 20:56:57,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:56:57,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:57,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:57,820 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:57,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:57,828 INFO L85 PathProgramCache]: Analyzing trace with hash -652520665, now seen corresponding path program 1 times [2022-11-02 20:56:57,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:57,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038490213] [2022-11-02 20:56:57,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:57,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:58,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:56:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:58,691 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:56:58,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:58,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038490213] [2022-11-02 20:56:58,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038490213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:58,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:58,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:56:58,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097012811] [2022-11-02 20:56:58,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:58,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:58,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:58,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:58,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:58,744 INFO L87 Difference]: Start difference. First operand has 2115 states, 1690 states have (on average 1.485207100591716) internal successors, (2510), 1712 states have internal predecessors, (2510), 345 states have call successors, (345), 78 states have call predecessors, (345), 78 states have return successors, (345), 345 states have call predecessors, (345), 345 states have call successors, (345) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:59,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:59,079 INFO L93 Difference]: Finished difference Result 4222 states and 6502 transitions. [2022-11-02 20:56:59,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:59,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-11-02 20:56:59,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:59,121 INFO L225 Difference]: With dead ends: 4222 [2022-11-02 20:56:59,121 INFO L226 Difference]: Without dead ends: 2109 [2022-11-02 20:56:59,146 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:56:59,150 INFO L413 NwaCegarLoop]: 3187 mSDtfsCounter, 3183 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3183 SdHoareTripleChecker+Valid, 3187 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:59,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3183 Valid, 3187 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:56:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2022-11-02 20:56:59,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 2109. [2022-11-02 20:56:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2109 states, 1686 states have (on average 1.4839857651245552) internal successors, (2502), 1706 states have internal predecessors, (2502), 345 states have call successors, (345), 78 states have call predecessors, (345), 77 states have return successors, (337), 337 states have call predecessors, (337), 337 states have call successors, (337) [2022-11-02 20:56:59,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 3184 transitions. [2022-11-02 20:56:59,379 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 3184 transitions. Word has length 18 [2022-11-02 20:56:59,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:59,380 INFO L495 AbstractCegarLoop]: Abstraction has 2109 states and 3184 transitions. [2022-11-02 20:56:59,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:59,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 3184 transitions. [2022-11-02 20:56:59,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:56:59,382 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:59,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:59,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:56:59,388 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:59,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash 48543913, now seen corresponding path program 1 times [2022-11-02 20:56:59,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:59,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841105001] [2022-11-02 20:56:59,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:59,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:59,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:56:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:59,745 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:56:59,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:59,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841105001] [2022-11-02 20:56:59,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841105001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:59,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:59,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:56:59,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937290341] [2022-11-02 20:56:59,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:59,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:59,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:59,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:59,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:59,753 INFO L87 Difference]: Start difference. First operand 2109 states and 3184 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:59,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:59,896 INFO L93 Difference]: Finished difference Result 4211 states and 6359 transitions. [2022-11-02 20:56:59,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:59,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-11-02 20:56:59,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:59,913 INFO L225 Difference]: With dead ends: 4211 [2022-11-02 20:56:59,913 INFO L226 Difference]: Without dead ends: 2109 [2022-11-02 20:56:59,924 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:56:59,926 INFO L413 NwaCegarLoop]: 3182 mSDtfsCounter, 3177 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3177 SdHoareTripleChecker+Valid, 3182 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:59,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3177 Valid, 3182 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:56:59,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2022-11-02 20:57:00,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 2109. [2022-11-02 20:57:00,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2109 states, 1686 states have (on average 1.4833926453143536) internal successors, (2501), 1706 states have internal predecessors, (2501), 345 states have call successors, (345), 78 states have call predecessors, (345), 77 states have return successors, (337), 337 states have call predecessors, (337), 337 states have call successors, (337) [2022-11-02 20:57:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 3183 transitions. [2022-11-02 20:57:00,050 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 3183 transitions. Word has length 18 [2022-11-02 20:57:00,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:00,051 INFO L495 AbstractCegarLoop]: Abstraction has 2109 states and 3183 transitions. [2022-11-02 20:57:00,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:57:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 3183 transitions. [2022-11-02 20:57:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:57:00,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:00,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:00,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:57:00,053 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:00,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:00,053 INFO L85 PathProgramCache]: Analyzing trace with hash -344483097, now seen corresponding path program 1 times [2022-11-02 20:57:00,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:00,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301922174] [2022-11-02 20:57:00,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:00,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:00,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:57:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:00,409 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:57:00,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:00,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301922174] [2022-11-02 20:57:00,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301922174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:00,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:00,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:00,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882629959] [2022-11-02 20:57:00,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:00,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:00,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:00,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:00,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:00,414 INFO L87 Difference]: Start difference. First operand 2109 states and 3183 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:57:00,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:00,569 INFO L93 Difference]: Finished difference Result 2111 states and 3184 transitions. [2022-11-02 20:57:00,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:00,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-11-02 20:57:00,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:00,583 INFO L225 Difference]: With dead ends: 2111 [2022-11-02 20:57:00,583 INFO L226 Difference]: Without dead ends: 2108 [2022-11-02 20:57:00,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:00,587 INFO L413 NwaCegarLoop]: 3180 mSDtfsCounter, 3168 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3168 SdHoareTripleChecker+Valid, 3180 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:00,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3168 Valid, 3180 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:57:00,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2022-11-02 20:57:00,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 2108. [2022-11-02 20:57:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 1686 states have (on average 1.482799525504152) internal successors, (2500), 1705 states have internal predecessors, (2500), 344 states have call successors, (344), 78 states have call predecessors, (344), 77 states have return successors, (337), 337 states have call predecessors, (337), 337 states have call successors, (337) [2022-11-02 20:57:00,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 3181 transitions. [2022-11-02 20:57:00,714 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 3181 transitions. Word has length 18 [2022-11-02 20:57:00,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:00,715 INFO L495 AbstractCegarLoop]: Abstraction has 2108 states and 3181 transitions. [2022-11-02 20:57:00,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:57:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 3181 transitions. [2022-11-02 20:57:00,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:57:00,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:00,717 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:57:00,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:57:00,717 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:00,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:00,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2089760103, now seen corresponding path program 1 times [2022-11-02 20:57:00,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:00,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568373181] [2022-11-02 20:57:00,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:00,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:00,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:57:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:00,934 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:57:00,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:00,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568373181] [2022-11-02 20:57:00,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568373181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:00,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:00,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:00,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352680042] [2022-11-02 20:57:00,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:00,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:00,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:00,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:00,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:00,937 INFO L87 Difference]: Start difference. First operand 2108 states and 3181 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:57:01,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:01,292 INFO L93 Difference]: Finished difference Result 6200 states and 9371 transitions. [2022-11-02 20:57:01,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:01,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-11-02 20:57:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:01,323 INFO L225 Difference]: With dead ends: 6200 [2022-11-02 20:57:01,323 INFO L226 Difference]: Without dead ends: 4133 [2022-11-02 20:57:01,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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,346 INFO L413 NwaCegarLoop]: 5185 mSDtfsCounter, 3163 mSDsluCounter, 3058 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3163 SdHoareTripleChecker+Valid, 8243 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:01,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3163 Valid, 8243 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:57:01,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4133 states. [2022-11-02 20:57:01,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4133 to 4128. [2022-11-02 20:57:01,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4128 states, 3314 states have (on average 1.4846107423053712) internal successors, (4920), 3345 states have internal predecessors, (4920), 662 states have call successors, (662), 153 states have call predecessors, (662), 151 states have return successors, (657), 651 states have call predecessors, (657), 651 states have call successors, (657) [2022-11-02 20:57:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 6239 transitions. [2022-11-02 20:57:01,651 INFO L78 Accepts]: Start accepts. Automaton has 4128 states and 6239 transitions. Word has length 19 [2022-11-02 20:57:01,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:01,651 INFO L495 AbstractCegarLoop]: Abstraction has 4128 states and 6239 transitions. [2022-11-02 20:57:01,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:57:01,652 INFO L276 IsEmpty]: Start isEmpty. Operand 4128 states and 6239 transitions. [2022-11-02 20:57:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:57:01,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:01,653 INFO L195 NwaCegarLoop]: trace histogram [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,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:57:01,653 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:01,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash -358767574, now seen corresponding path program 1 times [2022-11-02 20:57:01,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:01,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679872024] [2022-11-02 20:57:01,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:01,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:01,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:57:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:01,837 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:57:01,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:01,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679872024] [2022-11-02 20:57:01,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679872024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:01,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:01,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:01,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142799139] [2022-11-02 20:57:01,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:01,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:01,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:01,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:01,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:01,840 INFO L87 Difference]: Start difference. First operand 4128 states and 6239 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:57:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:02,070 INFO L93 Difference]: Finished difference Result 4130 states and 6240 transitions. [2022-11-02 20:57:02,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:02,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-11-02 20:57:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:02,100 INFO L225 Difference]: With dead ends: 4130 [2022-11-02 20:57:02,100 INFO L226 Difference]: Without dead ends: 4127 [2022-11-02 20:57:02,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:02,105 INFO L413 NwaCegarLoop]: 3178 mSDtfsCounter, 3164 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3164 SdHoareTripleChecker+Valid, 3178 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:02,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3164 Valid, 3178 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:02,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4127 states. [2022-11-02 20:57:02,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4127 to 4127. [2022-11-02 20:57:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4127 states, 3314 states have (on average 1.484308992154496) internal successors, (4919), 3344 states have internal predecessors, (4919), 661 states have call successors, (661), 153 states have call predecessors, (661), 151 states have return successors, (657), 651 states have call predecessors, (657), 651 states have call successors, (657) [2022-11-02 20:57:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4127 states to 4127 states and 6237 transitions. [2022-11-02 20:57:02,477 INFO L78 Accepts]: Start accepts. Automaton has 4127 states and 6237 transitions. Word has length 20 [2022-11-02 20:57:02,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:02,478 INFO L495 AbstractCegarLoop]: Abstraction has 4127 states and 6237 transitions. [2022-11-02 20:57:02,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:57:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 4127 states and 6237 transitions. [2022-11-02 20:57:02,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:57:02,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:02,479 INFO L195 NwaCegarLoop]: trace histogram [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:02,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:57:02,480 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:02,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:02,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1762398140, now seen corresponding path program 1 times [2022-11-02 20:57:02,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:02,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849007196] [2022-11-02 20:57:02,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:02,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:02,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:57:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:02,714 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:57:02,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:02,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849007196] [2022-11-02 20:57:02,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849007196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:02,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:02,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:02,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393328225] [2022-11-02 20:57:02,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:02,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:02,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:02,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:02,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:02,717 INFO L87 Difference]: Start difference. First operand 4127 states and 6237 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:57:03,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:03,091 INFO L93 Difference]: Finished difference Result 4199 states and 6295 transitions. [2022-11-02 20:57:03,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:03,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2022-11-02 20:57:03,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:03,126 INFO L225 Difference]: With dead ends: 4199 [2022-11-02 20:57:03,126 INFO L226 Difference]: Without dead ends: 4178 [2022-11-02 20:57:03,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:03,132 INFO L413 NwaCegarLoop]: 3180 mSDtfsCounter, 2999 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2999 SdHoareTripleChecker+Valid, 3365 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:03,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2999 Valid, 3365 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:57:03,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4178 states. [2022-11-02 20:57:03,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4178 to 4176. [2022-11-02 20:57:03,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 3357 states have (on average 1.4766160262138814) internal successors, (4957), 3385 states have internal predecessors, (4957), 651 states have call successors, (651), 169 states have call predecessors, (651), 167 states have return successors, (649), 643 states have call predecessors, (649), 643 states have call successors, (649) [2022-11-02 20:57:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 6257 transitions. [2022-11-02 20:57:03,473 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 6257 transitions. Word has length 21 [2022-11-02 20:57:03,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:03,473 INFO L495 AbstractCegarLoop]: Abstraction has 4176 states and 6257 transitions. [2022-11-02 20:57:03,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:57:03,474 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 6257 transitions. [2022-11-02 20:57:03,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 20:57:03,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:03,483 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:03,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:57:03,484 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:03,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:03,484 INFO L85 PathProgramCache]: Analyzing trace with hash 311089182, now seen corresponding path program 1 times [2022-11-02 20:57:03,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:03,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745940527] [2022-11-02 20:57:03,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:03,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:03,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:57:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:03,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:57:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:03,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:57:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:03,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:57:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:03,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:57:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:03,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:57:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:57:03,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:03,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745940527] [2022-11-02 20:57:03,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745940527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:03,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:03,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:57:03,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009875190] [2022-11-02 20:57:03,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:03,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:57:03,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:03,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:57:03,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:57:03,882 INFO L87 Difference]: Start difference. First operand 4176 states and 6257 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:57:10,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:10,323 INFO L93 Difference]: Finished difference Result 8302 states and 12449 transitions. [2022-11-02 20:57:10,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:57:10,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2022-11-02 20:57:10,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:10,355 INFO L225 Difference]: With dead ends: 8302 [2022-11-02 20:57:10,355 INFO L226 Difference]: Without dead ends: 4179 [2022-11-02 20:57:10,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:57:10,376 INFO L413 NwaCegarLoop]: 4069 mSDtfsCounter, 4476 mSDsluCounter, 3177 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 913 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4786 SdHoareTripleChecker+Valid, 7246 SdHoareTripleChecker+Invalid, 3392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 913 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:10,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4786 Valid, 7246 Invalid, 3392 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [913 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-11-02 20:57:10,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4179 states. [2022-11-02 20:57:10,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4179 to 4176. [2022-11-02 20:57:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 3357 states have (on average 1.476020256181114) internal successors, (4955), 3385 states have internal predecessors, (4955), 651 states have call successors, (651), 169 states have call predecessors, (651), 167 states have return successors, (643), 643 states have call predecessors, (643), 640 states have call successors, (643) [2022-11-02 20:57:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 6249 transitions. [2022-11-02 20:57:10,690 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 6249 transitions. Word has length 61 [2022-11-02 20:57:10,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:10,692 INFO L495 AbstractCegarLoop]: Abstraction has 4176 states and 6249 transitions. [2022-11-02 20:57:10,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:57:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 6249 transitions. [2022-11-02 20:57:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 20:57:10,696 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:10,696 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:10,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:57:10,697 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:10,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:10,697 INFO L85 PathProgramCache]: Analyzing trace with hash -533382689, now seen corresponding path program 1 times [2022-11-02 20:57:10,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:10,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773392815] [2022-11-02 20:57:10,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:10,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:11,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:57:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:11,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:57:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:11,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:57:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:11,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:57:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:11,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:57:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:11,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:57:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:57:11,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:11,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773392815] [2022-11-02 20:57:11,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773392815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:11,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:11,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:57:11,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465761807] [2022-11-02 20:57:11,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:11,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:57:11,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:11,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:57:11,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:11,213 INFO L87 Difference]: Start difference. First operand 4176 states and 6249 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:57:22,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:22,763 INFO L93 Difference]: Finished difference Result 6230 states and 9444 transitions. [2022-11-02 20:57:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:57:22,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2022-11-02 20:57:22,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:22,798 INFO L225 Difference]: With dead ends: 6230 [2022-11-02 20:57:22,799 INFO L226 Difference]: Without dead ends: 5207 [2022-11-02 20:57:22,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:57:22,807 INFO L413 NwaCegarLoop]: 4139 mSDtfsCounter, 2802 mSDsluCounter, 10379 mSDsCounter, 0 mSdLazyCounter, 7437 mSolverCounterSat, 634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2938 SdHoareTripleChecker+Valid, 14518 SdHoareTripleChecker+Invalid, 8071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 634 IncrementalHoareTripleChecker+Valid, 7437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:22,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2938 Valid, 14518 Invalid, 8071 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [634 Valid, 7437 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2022-11-02 20:57:22,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5207 states. [2022-11-02 20:57:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5207 to 3858. [2022-11-02 20:57:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3858 states, 3079 states have (on average 1.4624878207210132) internal successors, (4503), 3105 states have internal predecessors, (4503), 612 states have call successors, (612), 168 states have call predecessors, (612), 166 states have return successors, (606), 606 states have call predecessors, (606), 603 states have call successors, (606) [2022-11-02 20:57:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 5721 transitions. [2022-11-02 20:57:23,103 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 5721 transitions. Word has length 61 [2022-11-02 20:57:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:23,103 INFO L495 AbstractCegarLoop]: Abstraction has 3858 states and 5721 transitions. [2022-11-02 20:57:23,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:57:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 5721 transitions. [2022-11-02 20:57:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 20:57:23,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:23,109 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:23,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:57:23,110 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:23,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:23,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1487077295, now seen corresponding path program 1 times [2022-11-02 20:57:23,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:23,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165453889] [2022-11-02 20:57:23,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:23,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:23,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:57:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:23,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:57:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:23,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:57:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:23,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:57:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:23,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:57:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:23,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:57:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:23,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:57:23,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:23,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165453889] [2022-11-02 20:57:23,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165453889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:23,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:23,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:57:23,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340434449] [2022-11-02 20:57:23,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:23,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:57:23,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:23,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:57:23,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:57:23,432 INFO L87 Difference]: Start difference. First operand 3858 states and 5721 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:57:28,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:57:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:34,639 INFO L93 Difference]: Finished difference Result 8734 states and 13155 transitions. [2022-11-02 20:57:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:57:34,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 63 [2022-11-02 20:57:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:34,672 INFO L225 Difference]: With dead ends: 8734 [2022-11-02 20:57:34,672 INFO L226 Difference]: Without dead ends: 4929 [2022-11-02 20:57:34,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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:57:34,692 INFO L413 NwaCegarLoop]: 3044 mSDtfsCounter, 2480 mSDsluCounter, 3440 mSDsCounter, 0 mSdLazyCounter, 4124 mSolverCounterSat, 1057 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2774 SdHoareTripleChecker+Valid, 6484 SdHoareTripleChecker+Invalid, 5181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1057 IncrementalHoareTripleChecker+Valid, 4124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:34,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2774 Valid, 6484 Invalid, 5181 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1057 Valid, 4124 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2022-11-02 20:57:34,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4929 states. [2022-11-02 20:57:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4929 to 4650. [2022-11-02 20:57:35,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4650 states, 3730 states have (on average 1.470509383378016) internal successors, (5485), 3761 states have internal predecessors, (5485), 753 states have call successors, (753), 168 states have call predecessors, (753), 166 states have return successors, (748), 748 states have call predecessors, (748), 744 states have call successors, (748) [2022-11-02 20:57:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4650 states to 4650 states and 6986 transitions. [2022-11-02 20:57:35,085 INFO L78 Accepts]: Start accepts. Automaton has 4650 states and 6986 transitions. Word has length 63 [2022-11-02 20:57:35,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:35,086 INFO L495 AbstractCegarLoop]: Abstraction has 4650 states and 6986 transitions. [2022-11-02 20:57:35,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:57:35,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4650 states and 6986 transitions. [2022-11-02 20:57:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 20:57:35,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:35,091 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:35,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:57:35,091 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:35,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:35,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1372433969, now seen corresponding path program 1 times [2022-11-02 20:57:35,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:35,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907481539] [2022-11-02 20:57:35,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:35,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:35,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:57:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:35,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:57:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:35,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:57:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:35,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:57:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:35,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:57:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:35,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:57:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:35,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:57:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:35,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 20:57:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:57:35,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:35,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907481539] [2022-11-02 20:57:35,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907481539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:35,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:35,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:57:35,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988541184] [2022-11-02 20:57:35,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:35,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:57:35,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:35,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:57:35,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:35,563 INFO L87 Difference]: Start difference. First operand 4650 states and 6986 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:57:44,697 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:57:47,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:47,933 INFO L93 Difference]: Finished difference Result 7940 states and 12018 transitions. [2022-11-02 20:57:47,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:57:47,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2022-11-02 20:57:47,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:47,966 INFO L225 Difference]: With dead ends: 7940 [2022-11-02 20:57:47,966 INFO L226 Difference]: Without dead ends: 6458 [2022-11-02 20:57:47,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:57:47,975 INFO L413 NwaCegarLoop]: 4130 mSDtfsCounter, 3706 mSDsluCounter, 9439 mSDsCounter, 0 mSdLazyCounter, 7356 mSolverCounterSat, 724 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3842 SdHoareTripleChecker+Valid, 13569 SdHoareTripleChecker+Invalid, 8081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 724 IncrementalHoareTripleChecker+Valid, 7356 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:47,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3842 Valid, 13569 Invalid, 8081 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [724 Valid, 7356 Invalid, 1 Unknown, 0 Unchecked, 11.7s Time] [2022-11-02 20:57:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6458 states. [2022-11-02 20:57:48,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6458 to 4648. [2022-11-02 20:57:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4648 states, 3728 states have (on average 1.470225321888412) internal successors, (5481), 3759 states have internal predecessors, (5481), 753 states have call successors, (753), 168 states have call predecessors, (753), 166 states have return successors, (748), 748 states have call predecessors, (748), 744 states have call successors, (748) [2022-11-02 20:57:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4648 states to 4648 states and 6982 transitions. [2022-11-02 20:57:48,451 INFO L78 Accepts]: Start accepts. Automaton has 4648 states and 6982 transitions. Word has length 78 [2022-11-02 20:57:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:48,451 INFO L495 AbstractCegarLoop]: Abstraction has 4648 states and 6982 transitions. [2022-11-02 20:57:48,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:57:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4648 states and 6982 transitions. [2022-11-02 20:57:48,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-02 20:57:48,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:48,455 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:48,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:57:48,456 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:48,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:48,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1415994438, now seen corresponding path program 1 times [2022-11-02 20:57:48,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:48,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359629360] [2022-11-02 20:57:48,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:48,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:48,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:57:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:48,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:57:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:48,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:57:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:48,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:57:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:48,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:57:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:48,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 20:57:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:48,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:57:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:48,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:57:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:48,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:57:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:48,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:57:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:48,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:57:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:48,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:57:48,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:48,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359629360] [2022-11-02 20:57:48,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359629360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:48,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:48,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:57:48,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21610160] [2022-11-02 20:57:48,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:48,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:57:48,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:48,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:57:48,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:57:48,793 INFO L87 Difference]: Start difference. First operand 4648 states and 6982 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 20:57:55,470 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:58:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:03,959 INFO L93 Difference]: Finished difference Result 11680 states and 18036 transitions. [2022-11-02 20:58:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:58:03,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 82 [2022-11-02 20:58:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:04,002 INFO L225 Difference]: With dead ends: 11680 [2022-11-02 20:58:04,003 INFO L226 Difference]: Without dead ends: 7085 [2022-11-02 20:58:04,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:58:04,021 INFO L413 NwaCegarLoop]: 3845 mSDtfsCounter, 3543 mSDsluCounter, 6440 mSDsCounter, 0 mSdLazyCounter, 5958 mSolverCounterSat, 1571 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3888 SdHoareTripleChecker+Valid, 10285 SdHoareTripleChecker+Invalid, 7530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1571 IncrementalHoareTripleChecker+Valid, 5958 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:04,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3888 Valid, 10285 Invalid, 7530 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1571 Valid, 5958 Invalid, 1 Unknown, 0 Unchecked, 14.4s Time] [2022-11-02 20:58:04,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2022-11-02 20:58:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 6315. [2022-11-02 20:58:04,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6315 states, 5114 states have (on average 1.4892452092295658) internal successors, (7616), 5144 states have internal predecessors, (7616), 1034 states have call successors, (1034), 168 states have call predecessors, (1034), 166 states have return successors, (1033), 1033 states have call predecessors, (1033), 1025 states have call successors, (1033) [2022-11-02 20:58:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6315 states to 6315 states and 9683 transitions. [2022-11-02 20:58:04,609 INFO L78 Accepts]: Start accepts. Automaton has 6315 states and 9683 transitions. Word has length 82 [2022-11-02 20:58:04,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:04,610 INFO L495 AbstractCegarLoop]: Abstraction has 6315 states and 9683 transitions. [2022-11-02 20:58:04,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 20:58:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 6315 states and 9683 transitions. [2022-11-02 20:58:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-02 20:58:04,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:04,615 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:04,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:58:04,616 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:04,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:04,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1970657750, now seen corresponding path program 1 times [2022-11-02 20:58:04,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:04,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619900242] [2022-11-02 20:58:04,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:04,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:04,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:58:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:04,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:58:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:04,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:58:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:04,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:58:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:04,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:58:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:05,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:58:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:05,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:58:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:05,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 20:58:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:05,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:58:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:05,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:58:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:58:05,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:05,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619900242] [2022-11-02 20:58:05,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619900242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:05,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:05,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:58:05,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944878367] [2022-11-02 20:58:05,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:05,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:58:05,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:05,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:58:05,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:58:05,069 INFO L87 Difference]: Start difference. First operand 6315 states and 9683 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:58:13,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:13,509 INFO L93 Difference]: Finished difference Result 6661 states and 10333 transitions. [2022-11-02 20:58:13,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:58:13,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 81 [2022-11-02 20:58:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:13,545 INFO L225 Difference]: With dead ends: 6661 [2022-11-02 20:58:13,545 INFO L226 Difference]: Without dead ends: 6658 [2022-11-02 20:58:13,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:58:13,551 INFO L413 NwaCegarLoop]: 3051 mSDtfsCounter, 2001 mSDsluCounter, 3980 mSDsCounter, 0 mSdLazyCounter, 3265 mSolverCounterSat, 892 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 7031 SdHoareTripleChecker+Invalid, 4157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 892 IncrementalHoareTripleChecker+Valid, 3265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:13,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2111 Valid, 7031 Invalid, 4157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [892 Valid, 3265 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-11-02 20:58:13,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6658 states. [2022-11-02 20:58:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6658 to 6314. [2022-11-02 20:58:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6314 states, 5114 states have (on average 1.4888541259288228) internal successors, (7614), 5143 states have internal predecessors, (7614), 1033 states have call successors, (1033), 168 states have call predecessors, (1033), 166 states have return successors, (1033), 1033 states have call predecessors, (1033), 1025 states have call successors, (1033) [2022-11-02 20:58:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6314 states to 6314 states and 9680 transitions. [2022-11-02 20:58:14,089 INFO L78 Accepts]: Start accepts. Automaton has 6314 states and 9680 transitions. Word has length 81 [2022-11-02 20:58:14,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:14,091 INFO L495 AbstractCegarLoop]: Abstraction has 6314 states and 9680 transitions. [2022-11-02 20:58:14,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:58:14,092 INFO L276 IsEmpty]: Start isEmpty. Operand 6314 states and 9680 transitions. [2022-11-02 20:58:14,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-02 20:58:14,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:14,114 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:14,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:58:14,114 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:14,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:14,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1588369404, now seen corresponding path program 1 times [2022-11-02 20:58:14,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:14,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040043311] [2022-11-02 20:58:14,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:14,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:58:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:58:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:58:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:58:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:58:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:58:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:58:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 20:58:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:58:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:58:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:58:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:58:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:58:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:58:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-02 20:58:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-02 20:58:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:58:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,676 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:58:14,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:14,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040043311] [2022-11-02 20:58:14,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040043311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:14,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:14,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:58:14,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234128458] [2022-11-02 20:58:14,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:14,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:58:14,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:14,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:58:14,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:58:14,680 INFO L87 Difference]: Start difference. First operand 6314 states and 9680 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 4 states have internal predecessors, (102), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-02 20:58:27,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:27,004 INFO L93 Difference]: Finished difference Result 13051 states and 20221 transitions. [2022-11-02 20:58:27,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:58:27,007 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 4 states have internal predecessors, (102), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2022-11-02 20:58:27,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:27,045 INFO L225 Difference]: With dead ends: 13051 [2022-11-02 20:58:27,045 INFO L226 Difference]: Without dead ends: 6778 [2022-11-02 20:58:27,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:58:27,068 INFO L413 NwaCegarLoop]: 2958 mSDtfsCounter, 3682 mSDsluCounter, 6864 mSDsCounter, 0 mSdLazyCounter, 5627 mSolverCounterSat, 2098 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3684 SdHoareTripleChecker+Valid, 9822 SdHoareTripleChecker+Invalid, 7725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2098 IncrementalHoareTripleChecker+Valid, 5627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:27,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3684 Valid, 9822 Invalid, 7725 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2098 Valid, 5627 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2022-11-02 20:58:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6778 states. [2022-11-02 20:58:27,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6778 to 6308. [2022-11-02 20:58:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6308 states, 5113 states have (on average 1.488167416389595) internal successors, (7609), 5142 states have internal predecessors, (7609), 1028 states have call successors, (1028), 168 states have call predecessors, (1028), 166 states have return successors, (1028), 1028 states have call predecessors, (1028), 1020 states have call successors, (1028) [2022-11-02 20:58:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6308 states to 6308 states and 9665 transitions. [2022-11-02 20:58:27,629 INFO L78 Accepts]: Start accepts. Automaton has 6308 states and 9665 transitions. Word has length 144 [2022-11-02 20:58:27,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:27,630 INFO L495 AbstractCegarLoop]: Abstraction has 6308 states and 9665 transitions. [2022-11-02 20:58:27,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 4 states have internal predecessors, (102), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-02 20:58:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 6308 states and 9665 transitions. [2022-11-02 20:58:27,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-11-02 20:58:27,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:27,662 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:27,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:58:27,663 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:27,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:27,664 INFO L85 PathProgramCache]: Analyzing trace with hash 240083206, now seen corresponding path program 1 times [2022-11-02 20:58:27,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:27,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695996323] [2022-11-02 20:58:27,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:27,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:58:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:58:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:58:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:58:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:58:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:58:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:58:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 20:58:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:58:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:58:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:58:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:58:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:58:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:58:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:58:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 20:58:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:58:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-02 20:58:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:58:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:58:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 20:58:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:58:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:58:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:58:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:58:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:58:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-02 20:58:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-02 20:58:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-02 20:58:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-02 20:58:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-02 20:58:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-02 20:58:28,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:28,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695996323] [2022-11-02 20:58:28,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695996323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:28,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:28,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:58:28,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272040045] [2022-11-02 20:58:28,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:28,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:58:28,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:28,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:58:28,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:58:28,778 INFO L87 Difference]: Start difference. First operand 6308 states and 9665 transitions. Second operand has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 5 states have internal predecessors, (137), 4 states have call successors, (36), 9 states have call predecessors, (36), 1 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2022-11-02 20:58:37,606 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:58:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:51,643 INFO L93 Difference]: Finished difference Result 13308 states and 20737 transitions. [2022-11-02 20:58:51,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:58:51,644 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 5 states have internal predecessors, (137), 4 states have call successors, (36), 9 states have call predecessors, (36), 1 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 239 [2022-11-02 20:58:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:51,687 INFO L225 Difference]: With dead ends: 13308 [2022-11-02 20:58:51,687 INFO L226 Difference]: Without dead ends: 7023 [2022-11-02 20:58:51,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:58:51,711 INFO L413 NwaCegarLoop]: 2917 mSDtfsCounter, 4153 mSDsluCounter, 9119 mSDsCounter, 0 mSdLazyCounter, 9674 mSolverCounterSat, 2313 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4189 SdHoareTripleChecker+Valid, 12036 SdHoareTripleChecker+Invalid, 11988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2313 IncrementalHoareTripleChecker+Valid, 9674 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:51,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4189 Valid, 12036 Invalid, 11988 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2313 Valid, 9674 Invalid, 1 Unknown, 0 Unchecked, 21.8s Time] [2022-11-02 20:58:51,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7023 states. [2022-11-02 20:58:52,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7023 to 6316. [2022-11-02 20:58:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6316 states, 5116 states have (on average 1.4859265050820953) internal successors, (7602), 5145 states have internal predecessors, (7602), 1033 states have call successors, (1033), 168 states have call predecessors, (1033), 166 states have return successors, (1033), 1033 states have call predecessors, (1033), 1025 states have call successors, (1033) [2022-11-02 20:58:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6316 states to 6316 states and 9668 transitions. [2022-11-02 20:58:52,317 INFO L78 Accepts]: Start accepts. Automaton has 6316 states and 9668 transitions. Word has length 239 [2022-11-02 20:58:52,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:52,318 INFO L495 AbstractCegarLoop]: Abstraction has 6316 states and 9668 transitions. [2022-11-02 20:58:52,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 5 states have internal predecessors, (137), 4 states have call successors, (36), 9 states have call predecessors, (36), 1 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2022-11-02 20:58:52,318 INFO L276 IsEmpty]: Start isEmpty. Operand 6316 states and 9668 transitions. [2022-11-02 20:58:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-11-02 20:58:52,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:52,344 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:52,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:58:52,345 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:52,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:52,345 INFO L85 PathProgramCache]: Analyzing trace with hash 482668504, now seen corresponding path program 1 times [2022-11-02 20:58:52,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:52,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572435320] [2022-11-02 20:58:52,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:52,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:58:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:58:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:58:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:58:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:58:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:58:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:58:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 20:58:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:58:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:58:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:58:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:58:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:58:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:58:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:58:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 20:58:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:58:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 20:58:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 20:58:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:58:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:58:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:58:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:58:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:58:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-02 20:58:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-02 20:58:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-02 20:58:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-02 20:58:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-02 20:58:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-02 20:58:53,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:53,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572435320] [2022-11-02 20:58:53,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572435320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:53,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:53,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:58:53,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525512762] [2022-11-02 20:58:53,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:53,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:58:53,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:53,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:58:53,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:58:53,167 INFO L87 Difference]: Start difference. First operand 6316 states and 9668 transitions. Second operand has 8 states, 8 states have (on average 20.0) internal successors, (160), 3 states have internal predecessors, (160), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2022-11-02 20:59:00,457 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:59:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:10,651 INFO L93 Difference]: Finished difference Result 13260 states and 20642 transitions. [2022-11-02 20:59:10,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:59:10,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 3 states have internal predecessors, (160), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 249 [2022-11-02 20:59:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:10,692 INFO L225 Difference]: With dead ends: 13260 [2022-11-02 20:59:10,692 INFO L226 Difference]: Without dead ends: 6997 [2022-11-02 20:59:10,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:59:10,714 INFO L413 NwaCegarLoop]: 2892 mSDtfsCounter, 4046 mSDsluCounter, 6163 mSDsCounter, 0 mSdLazyCounter, 5625 mSolverCounterSat, 2246 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4048 SdHoareTripleChecker+Valid, 9055 SdHoareTripleChecker+Invalid, 7872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2246 IncrementalHoareTripleChecker+Valid, 5625 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:10,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4048 Valid, 9055 Invalid, 7872 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2246 Valid, 5625 Invalid, 1 Unknown, 0 Unchecked, 16.5s Time] [2022-11-02 20:59:10,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6997 states. [2022-11-02 20:59:11,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6997 to 6320. [2022-11-02 20:59:11,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6320 states, 5120 states have (on average 1.485546875) internal successors, (7606), 5149 states have internal predecessors, (7606), 1033 states have call successors, (1033), 168 states have call predecessors, (1033), 166 states have return successors, (1033), 1033 states have call predecessors, (1033), 1025 states have call successors, (1033) [2022-11-02 20:59:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6320 states to 6320 states and 9672 transitions. [2022-11-02 20:59:11,310 INFO L78 Accepts]: Start accepts. Automaton has 6320 states and 9672 transitions. Word has length 249 [2022-11-02 20:59:11,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:11,311 INFO L495 AbstractCegarLoop]: Abstraction has 6320 states and 9672 transitions. [2022-11-02 20:59:11,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 3 states have internal predecessors, (160), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2022-11-02 20:59:11,311 INFO L276 IsEmpty]: Start isEmpty. Operand 6320 states and 9672 transitions. [2022-11-02 20:59:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-11-02 20:59:11,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:11,340 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:11,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:59:11,341 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:11,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:11,342 INFO L85 PathProgramCache]: Analyzing trace with hash -678643140, now seen corresponding path program 1 times [2022-11-02 20:59:11,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:11,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849461492] [2022-11-02 20:59:11,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:11,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:59:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:59:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:59:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:59:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:59:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:59:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:59:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 20:59:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:59:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:59:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:59:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:59:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:59:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:59:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:59:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 20:59:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:59:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 20:59:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 20:59:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-02 20:59:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:59:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:59:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:59:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:59:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:59:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:59:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:59:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-02 20:59:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-02 20:59:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-11-02 20:59:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-11-02 20:59:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-11-02 20:59:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:59:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-02 20:59:12,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:12,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849461492] [2022-11-02 20:59:12,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849461492] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:12,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462761471] [2022-11-02 20:59:12,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:12,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:12,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:12,383 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:12,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:59:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:13,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 3507 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:59:13,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 20:59:13,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-02 20:59:14,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462761471] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:14,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:14,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 12 [2022-11-02 20:59:14,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524292585] [2022-11-02 20:59:14,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:14,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:59:14,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:14,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:59:14,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:59:14,216 INFO L87 Difference]: Start difference. First operand 6320 states and 9672 transitions. Second operand has 12 states, 12 states have (on average 20.083333333333332) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (61), 7 states have call predecessors, (61), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-11-02 20:59:21,958 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:59:33,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:33,451 INFO L93 Difference]: Finished difference Result 13284 states and 20674 transitions. [2022-11-02 20:59:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:59:33,452 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.083333333333332) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (61), 7 states have call predecessors, (61), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 251 [2022-11-02 20:59:33,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:33,489 INFO L225 Difference]: With dead ends: 13284 [2022-11-02 20:59:33,489 INFO L226 Difference]: Without dead ends: 7017 [2022-11-02 20:59:33,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 566 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:59:33,508 INFO L413 NwaCegarLoop]: 2900 mSDtfsCounter, 4021 mSDsluCounter, 7656 mSDsCounter, 0 mSdLazyCounter, 7405 mSolverCounterSat, 2229 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4023 SdHoareTripleChecker+Valid, 10556 SdHoareTripleChecker+Invalid, 9635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2229 IncrementalHoareTripleChecker+Valid, 7405 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:33,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4023 Valid, 10556 Invalid, 9635 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2229 Valid, 7405 Invalid, 1 Unknown, 0 Unchecked, 18.2s Time] [2022-11-02 20:59:33,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7017 states. [2022-11-02 20:59:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7017 to 6344. [2022-11-02 20:59:34,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6344 states, 5144 states have (on average 1.4832814930015552) internal successors, (7630), 5173 states have internal predecessors, (7630), 1033 states have call successors, (1033), 168 states have call predecessors, (1033), 166 states have return successors, (1033), 1033 states have call predecessors, (1033), 1025 states have call successors, (1033) [2022-11-02 20:59:34,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6344 states to 6344 states and 9696 transitions. [2022-11-02 20:59:34,047 INFO L78 Accepts]: Start accepts. Automaton has 6344 states and 9696 transitions. Word has length 251 [2022-11-02 20:59:34,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:34,047 INFO L495 AbstractCegarLoop]: Abstraction has 6344 states and 9696 transitions. [2022-11-02 20:59:34,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.083333333333332) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (61), 7 states have call predecessors, (61), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-11-02 20:59:34,048 INFO L276 IsEmpty]: Start isEmpty. Operand 6344 states and 9696 transitions. [2022-11-02 20:59:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-11-02 20:59:34,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:34,073 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:34,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:34,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c2b729-8b15-48d5-b065-1cc0b2e8917c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:34,287 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:34,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:34,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1270159128, now seen corresponding path program 1 times [2022-11-02 20:59:34,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:34,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713242100] [2022-11-02 20:59:34,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:34,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:59:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:59:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:59:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:59:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:59:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:59:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:59:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:59:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:59:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-02 20:59:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 20:59:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:59:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:59:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:59:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 20:59:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:59:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 20:59:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:59:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:59:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 20:59:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 20:59:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:35,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:59:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:35,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:59:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:35,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:59:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:35,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:59:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:35,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:59:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:35,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:59:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:35,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:59:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:35,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-02 20:59:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:35,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-11-02 20:59:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:35,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-11-02 20:59:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:35,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-11-02 20:59:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:35,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-02 20:59:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:35,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:59:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:35,345 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-02 20:59:35,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:35,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713242100] [2022-11-02 20:59:35,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713242100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:35,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:35,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:59:35,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067858442] [2022-11-02 20:59:35,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:35,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:59:35,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:35,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:59:35,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:59:35,350 INFO L87 Difference]: Start difference. First operand 6344 states and 9696 transitions. Second operand has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 6 states have internal predecessors, (167), 4 states have call successors, (36), 7 states have call predecessors, (36), 3 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2022-11-02 20:59:46,084 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:59:48,121 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 21:00:04,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:04,878 INFO L93 Difference]: Finished difference Result 13474 states and 21219 transitions. [2022-11-02 21:00:04,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 21:00:04,879 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 6 states have internal predecessors, (167), 4 states have call successors, (36), 7 states have call predecessors, (36), 3 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 271 [2022-11-02 21:00:04,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:04,919 INFO L225 Difference]: With dead ends: 13474 [2022-11-02 21:00:04,919 INFO L226 Difference]: Without dead ends: 7146 [2022-11-02 21:00:04,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2022-11-02 21:00:04,950 INFO L413 NwaCegarLoop]: 2942 mSDtfsCounter, 3811 mSDsluCounter, 11516 mSDsCounter, 0 mSdLazyCounter, 12678 mSolverCounterSat, 2006 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3813 SdHoareTripleChecker+Valid, 14458 SdHoareTripleChecker+Invalid, 14686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2006 IncrementalHoareTripleChecker+Valid, 12678 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:04,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3813 Valid, 14458 Invalid, 14686 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2006 Valid, 12678 Invalid, 2 Unknown, 0 Unchecked, 28.3s Time] [2022-11-02 21:00:04,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7146 states. [2022-11-02 21:00:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7146 to 6408. [2022-11-02 21:00:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6408 states, 5207 states have (on average 1.4793547148069905) internal successors, (7703), 5229 states have internal predecessors, (7703), 1033 states have call successors, (1033), 167 states have call predecessors, (1033), 167 states have return successors, (1036), 1033 states have call predecessors, (1036), 1025 states have call successors, (1036) [2022-11-02 21:00:05,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6408 states to 6408 states and 9772 transitions. [2022-11-02 21:00:05,519 INFO L78 Accepts]: Start accepts. Automaton has 6408 states and 9772 transitions. Word has length 271 [2022-11-02 21:00:05,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:05,520 INFO L495 AbstractCegarLoop]: Abstraction has 6408 states and 9772 transitions. [2022-11-02 21:00:05,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 6 states have internal predecessors, (167), 4 states have call successors, (36), 7 states have call predecessors, (36), 3 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2022-11-02 21:00:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 6408 states and 9772 transitions. [2022-11-02 21:00:05,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-11-02 21:00:05,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:05,558 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:05,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:00:05,558 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:05,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:05,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1938973590, now seen corresponding path program 1 times [2022-11-02 21:00:05,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:05,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489686945] [2022-11-02 21:00:05,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:05,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:00:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 21:00:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:00:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:00:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 21:00:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 21:00:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 21:00:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 21:00:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:00:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 21:00:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 21:00:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 21:00:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 21:00:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 21:00:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 21:00:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 21:00:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 21:00:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 21:00:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 21:00:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-02 21:00:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:00:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:00:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 21:00:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:00:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:00:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:00:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:00:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-02 21:00:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-02 21:00:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-11-02 21:00:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-11-02 21:00:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-11-02 21:00:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:00:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-02 21:00:06,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:06,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489686945] [2022-11-02 21:00:06,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489686945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:06,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:06,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 21:00:06,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584652931] [2022-11-02 21:00:06,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:06,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 21:00:06,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:06,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 21:00:06,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:00:06,767 INFO L87 Difference]: Start difference. First operand 6408 states and 9772 transitions. Second operand has 11 states, 11 states have (on average 14.727272727272727) internal successors, (162), 5 states have internal predecessors, (162), 2 states have call successors, (35), 7 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33)