./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-13 17:45:34,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 17:45:34,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 17:45:34,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 17:45:34,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 17:45:34,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 17:45:34,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 17:45:34,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 17:45:34,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 17:45:34,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 17:45:34,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 17:45:34,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 17:45:34,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 17:45:34,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 17:45:34,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 17:45:34,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 17:45:34,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 17:45:34,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 17:45:34,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 17:45:34,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 17:45:35,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 17:45:35,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 17:45:35,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 17:45:35,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 17:45:35,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 17:45:35,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 17:45:35,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 17:45:35,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 17:45:35,013 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 17:45:35,014 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 17:45:35,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 17:45:35,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 17:45:35,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 17:45:35,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 17:45:35,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 17:45:35,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 17:45:35,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 17:45:35,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 17:45:35,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 17:45:35,023 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 17:45:35,024 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 17:45:35,025 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-13 17:45:35,050 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 17:45:35,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 17:45:35,051 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-13 17:45:35,052 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-13 17:45:35,053 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-13 17:45:35,053 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-13 17:45:35,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-13 17:45:35,054 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-13 17:45:35,055 INFO L138 SettingsManager]: * Use SBE=true [2021-11-13 17:45:35,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 17:45:35,056 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 17:45:35,056 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-13 17:45:35,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-13 17:45:35,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 17:45:35,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 17:45:35,058 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-13 17:45:35,058 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-13 17:45:35,058 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-13 17:45:35,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-13 17:45:35,059 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-13 17:45:35,060 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 17:45:35,060 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 17:45:35,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 17:45:35,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-13 17:45:35,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-13 17:45:35,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 17:45:35,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 17:45:35,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-13 17:45:35,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-13 17:45:35,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-13 17:45:35,064 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 17:45:35,064 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_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/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_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2021-11-13 17:45:35,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 17:45:35,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 17:45:35,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 17:45:35,381 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 17:45:35,382 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 17:45:35,383 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/../../sv-benchmarks/c/forester-heap/sll-01-2.i [2021-11-13 17:45:35,450 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/data/2f06eab22/593f1867fbac426bb4cdc560f3d6f90f/FLAGebbadc081 [2021-11-13 17:45:36,011 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 17:45:36,020 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i [2021-11-13 17:45:36,047 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/data/2f06eab22/593f1867fbac426bb4cdc560f3d6f90f/FLAGebbadc081 [2021-11-13 17:45:36,290 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/data/2f06eab22/593f1867fbac426bb4cdc560f3d6f90f [2021-11-13 17:45:36,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 17:45:36,294 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-11-13 17:45:36,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 17:45:36,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 17:45:36,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 17:45:36,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 05:45:36" (1/1) ... [2021-11-13 17:45:36,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@475f9225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:45:36, skipping insertion in model container [2021-11-13 17:45:36,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 05:45:36" (1/1) ... [2021-11-13 17:45:36,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 17:45:36,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 17:45:36,655 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-11-13 17:45:36,663 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-11-13 17:45:36,666 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-11-13 17:45:36,667 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-11-13 17:45:36,671 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-11-13 17:45:36,673 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-11-13 17:45:36,676 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-11-13 17:45:36,678 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-11-13 17:45:36,679 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-11-13 17:45:36,681 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-11-13 17:45:36,683 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-11-13 17:45:36,685 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-11-13 17:45:36,686 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-11-13 17:45:36,693 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 17:45:36,703 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 17:45:36,744 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-11-13 17:45:36,747 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-11-13 17:45:36,750 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-11-13 17:45:36,751 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-11-13 17:45:36,754 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-11-13 17:45:36,756 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-11-13 17:45:36,758 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-11-13 17:45:36,760 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-11-13 17:45:36,761 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-11-13 17:45:36,767 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-11-13 17:45:36,769 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-11-13 17:45:36,774 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-11-13 17:45:36,775 WARN L228 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_63eaa473-d468-4585-b80d-cc3b561a6de5/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-11-13 17:45:36,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 17:45:36,820 INFO L208 MainTranslator]: Completed translation [2021-11-13 17:45:36,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:45:36 WrapperNode [2021-11-13 17:45:36,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 17:45:36,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 17:45:36,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 17:45:36,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 17:45:36,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:45:36" (1/1) ... [2021-11-13 17:45:36,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:45:36" (1/1) ... [2021-11-13 17:45:36,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:45:36" (1/1) ... [2021-11-13 17:45:36,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:45:36" (1/1) ... [2021-11-13 17:45:36,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:45:36" (1/1) ... [2021-11-13 17:45:36,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:45:36" (1/1) ... [2021-11-13 17:45:36,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:45:36" (1/1) ... [2021-11-13 17:45:36,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 17:45:36,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 17:45:36,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 17:45:36,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 17:45:36,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:45:36" (1/1) ... [2021-11-13 17:45:36,940 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 17:45:36,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:45:36,979 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-13 17:45:37,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-13 17:45:37,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-11-13 17:45:37,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 17:45:37,043 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-11-13 17:45:37,044 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-11-13 17:45:37,044 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-11-13 17:45:37,044 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-11-13 17:45:37,044 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-11-13 17:45:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-11-13 17:45:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-11-13 17:45:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-11-13 17:45:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-11-13 17:45:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-11-13 17:45:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-11-13 17:45:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-11-13 17:45:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-11-13 17:45:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-11-13 17:45:37,047 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-11-13 17:45:37,047 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-11-13 17:45:37,047 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-11-13 17:45:37,047 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-11-13 17:45:37,047 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-11-13 17:45:37,048 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-11-13 17:45:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-11-13 17:45:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-11-13 17:45:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-11-13 17:45:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-11-13 17:45:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-11-13 17:45:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-11-13 17:45:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-11-13 17:45:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-11-13 17:45:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-11-13 17:45:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-11-13 17:45:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-11-13 17:45:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-11-13 17:45:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-11-13 17:45:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-11-13 17:45:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-11-13 17:45:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-11-13 17:45:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-11-13 17:45:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-11-13 17:45:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-11-13 17:45:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-11-13 17:45:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-11-13 17:45:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-11-13 17:45:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-11-13 17:45:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-11-13 17:45:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-11-13 17:45:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-11-13 17:45:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-11-13 17:45:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-11-13 17:45:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-11-13 17:45:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-11-13 17:45:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-11-13 17:45:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-11-13 17:45:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-11-13 17:45:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-11-13 17:45:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-11-13 17:45:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-11-13 17:45:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-11-13 17:45:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-11-13 17:45:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-11-13 17:45:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-11-13 17:45:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-11-13 17:45:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-11-13 17:45:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-11-13 17:45:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-11-13 17:45:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-11-13 17:45:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-11-13 17:45:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-11-13 17:45:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-11-13 17:45:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-11-13 17:45:37,060 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-11-13 17:45:37,060 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-11-13 17:45:37,060 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-11-13 17:45:37,060 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-11-13 17:45:37,060 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-11-13 17:45:37,060 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-11-13 17:45:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-11-13 17:45:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-11-13 17:45:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-11-13 17:45:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-11-13 17:45:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-11-13 17:45:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-11-13 17:45:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-11-13 17:45:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-11-13 17:45:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-11-13 17:45:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-11-13 17:45:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-11-13 17:45:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-11-13 17:45:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-11-13 17:45:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-11-13 17:45:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-11-13 17:45:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-11-13 17:45:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-11-13 17:45:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-11-13 17:45:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-11-13 17:45:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-11-13 17:45:37,075 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-11-13 17:45:37,075 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-11-13 17:45:37,075 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-11-13 17:45:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-11-13 17:45:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-11-13 17:45:37,078 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-11-13 17:45:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-11-13 17:45:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-11-13 17:45:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-11-13 17:45:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-11-13 17:45:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-11-13 17:45:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-11-13 17:45:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-11-13 17:45:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-11-13 17:45:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-11-13 17:45:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 17:45:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-11-13 17:45:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-13 17:45:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-13 17:45:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-13 17:45:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-13 17:45:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-11-13 17:45:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-13 17:45:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 17:45:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-13 17:45:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-13 17:45:37,989 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 17:45:37,990 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-11-13 17:45:37,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:45:37 BoogieIcfgContainer [2021-11-13 17:45:37,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 17:45:37,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-13 17:45:37,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-13 17:45:38,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-13 17:45:38,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 05:45:36" (1/3) ... [2021-11-13 17:45:38,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f081c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 05:45:38, skipping insertion in model container [2021-11-13 17:45:38,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:45:36" (2/3) ... [2021-11-13 17:45:38,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f081c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 05:45:38, skipping insertion in model container [2021-11-13 17:45:38,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:45:37" (3/3) ... [2021-11-13 17:45:38,004 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2021-11-13 17:45:38,011 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-13 17:45:38,012 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2021-11-13 17:45:38,066 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-13 17:45:38,074 INFO L339 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-13 17:45:38,075 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2021-11-13 17:45:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 115 states have (on average 2.1652173913043478) internal successors, (249), 195 states have internal predecessors, (249), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-13 17:45:38,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-13 17:45:38,114 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:38,115 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:38,115 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:38,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1164341321, now seen corresponding path program 1 times [2021-11-13 17:45:38,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:38,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528408030] [2021-11-13 17:45:38,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:38,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:38,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:38,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:38,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528408030] [2021-11-13 17:45:38,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528408030] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:38,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:38,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 17:45:38,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62075119] [2021-11-13 17:45:38,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:38,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:45:38,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:38,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:45:38,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:45:38,471 INFO L87 Difference]: Start difference. First operand has 200 states, 115 states have (on average 2.1652173913043478) internal successors, (249), 195 states have internal predecessors, (249), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 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) [2021-11-13 17:45:39,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:39,059 INFO L93 Difference]: Finished difference Result 201 states and 212 transitions. [2021-11-13 17:45:39,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:45:39,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 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 7 [2021-11-13 17:45:39,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:39,075 INFO L225 Difference]: With dead ends: 201 [2021-11-13 17:45:39,075 INFO L226 Difference]: Without dead ends: 197 [2021-11-13 17:45:39,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:45:39,082 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 187 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 391.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.52ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 474.40ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:39,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 133 Invalid, 302 Unknown, 0 Unchecked, 23.52ms Time], IncrementalHoareTripleChecker [15 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 474.40ms Time] [2021-11-13 17:45:39,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-11-13 17:45:39,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2021-11-13 17:45:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 117 states have (on average 1.7264957264957266) internal successors, (202), 188 states have internal predecessors, (202), 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) [2021-11-13 17:45:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2021-11-13 17:45:39,149 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 7 [2021-11-13 17:45:39,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:39,150 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2021-11-13 17:45:39,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 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) [2021-11-13 17:45:39,150 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2021-11-13 17:45:39,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-13 17:45:39,151 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:39,151 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:39,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-13 17:45:39,152 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:39,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:39,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1164341322, now seen corresponding path program 1 times [2021-11-13 17:45:39,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:39,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550338651] [2021-11-13 17:45:39,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:39,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:39,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:39,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:39,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:39,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550338651] [2021-11-13 17:45:39,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550338651] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:39,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:39,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 17:45:39,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417599085] [2021-11-13 17:45:39,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:39,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:45:39,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:39,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:45:39,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:45:39,259 INFO L87 Difference]: Start difference. First operand 192 states and 205 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 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) [2021-11-13 17:45:39,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:39,678 INFO L93 Difference]: Finished difference Result 222 states and 234 transitions. [2021-11-13 17:45:39,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:45:39,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 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 7 [2021-11-13 17:45:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:39,681 INFO L225 Difference]: With dead ends: 222 [2021-11-13 17:45:39,681 INFO L226 Difference]: Without dead ends: 222 [2021-11-13 17:45:39,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:45:39,684 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 178 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 315.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.22ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 390.26ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:39,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 157 Invalid, 286 Unknown, 0 Unchecked, 6.22ms Time], IncrementalHoareTripleChecker [13 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 390.26ms Time] [2021-11-13 17:45:39,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-11-13 17:45:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2021-11-13 17:45:39,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 134 states have (on average 1.664179104477612) internal successors, (223), 198 states have internal predecessors, (223), 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) [2021-11-13 17:45:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2021-11-13 17:45:39,705 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 7 [2021-11-13 17:45:39,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:39,706 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2021-11-13 17:45:39,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 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) [2021-11-13 17:45:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2021-11-13 17:45:39,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-13 17:45:39,707 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:39,707 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:39,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-13 17:45:39,708 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:39,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:39,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2054455159, now seen corresponding path program 1 times [2021-11-13 17:45:39,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:39,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871301689] [2021-11-13 17:45:39,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:39,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:39,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:39,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:39,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871301689] [2021-11-13 17:45:39,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871301689] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:39,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:39,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:45:39,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196855774] [2021-11-13 17:45:39,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:39,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:45:39,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:39,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:45:39,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:45:39,850 INFO L87 Difference]: Start difference. First operand 202 states and 226 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 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) [2021-11-13 17:45:40,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:40,171 INFO L93 Difference]: Finished difference Result 217 states and 229 transitions. [2021-11-13 17:45:40,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:45:40,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 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 9 [2021-11-13 17:45:40,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:40,174 INFO L225 Difference]: With dead ends: 217 [2021-11-13 17:45:40,174 INFO L226 Difference]: Without dead ends: 217 [2021-11-13 17:45:40,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:45:40,178 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 175 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 247.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.54ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 301.96ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:40,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 209 Invalid, 219 Unknown, 0 Unchecked, 4.54ms Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 301.96ms Time] [2021-11-13 17:45:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-11-13 17:45:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2021-11-13 17:45:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 196 states have internal predecessors, (220), 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) [2021-11-13 17:45:40,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2021-11-13 17:45:40,215 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 9 [2021-11-13 17:45:40,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:40,219 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2021-11-13 17:45:40,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 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) [2021-11-13 17:45:40,219 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2021-11-13 17:45:40,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-13 17:45:40,220 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:40,222 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:40,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-13 17:45:40,223 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:40,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:40,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1492111941, now seen corresponding path program 1 times [2021-11-13 17:45:40,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:40,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941554288] [2021-11-13 17:45:40,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:40,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:40,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:40,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:40,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941554288] [2021-11-13 17:45:40,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941554288] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:40,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:40,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 17:45:40,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951755248] [2021-11-13 17:45:40,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:40,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 17:45:40,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:40,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 17:45:40,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-13 17:45:40,390 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 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) [2021-11-13 17:45:40,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:40,800 INFO L93 Difference]: Finished difference Result 199 states and 222 transitions. [2021-11-13 17:45:40,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-13 17:45:40,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 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 15 [2021-11-13 17:45:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:40,802 INFO L225 Difference]: With dead ends: 199 [2021-11-13 17:45:40,803 INFO L226 Difference]: Without dead ends: 199 [2021-11-13 17:45:40,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-13 17:45:40,812 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 4 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 301.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.04ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 362.66ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:40,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 552 Invalid, 384 Unknown, 0 Unchecked, 6.04ms Time], IncrementalHoareTripleChecker [2 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 362.66ms Time] [2021-11-13 17:45:40,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-11-13 17:45:40,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-11-13 17:45:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 195 states have internal predecessors, (219), 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) [2021-11-13 17:45:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2021-11-13 17:45:40,835 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 15 [2021-11-13 17:45:40,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:40,835 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2021-11-13 17:45:40,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 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) [2021-11-13 17:45:40,836 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2021-11-13 17:45:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-13 17:45:40,836 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:40,837 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:40,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-13 17:45:40,837 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:40,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:40,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1492111940, now seen corresponding path program 1 times [2021-11-13 17:45:40,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:40,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930812100] [2021-11-13 17:45:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:40,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:41,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:41,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:41,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930812100] [2021-11-13 17:45:41,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930812100] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:41,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:41,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 17:45:41,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194573248] [2021-11-13 17:45:41,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:41,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 17:45:41,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:41,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 17:45:41,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-13 17:45:41,059 INFO L87 Difference]: Start difference. First operand 199 states and 222 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 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) [2021-11-13 17:45:41,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:41,484 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2021-11-13 17:45:41,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-13 17:45:41,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 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 15 [2021-11-13 17:45:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:41,486 INFO L225 Difference]: With dead ends: 198 [2021-11-13 17:45:41,486 INFO L226 Difference]: Without dead ends: 198 [2021-11-13 17:45:41,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-13 17:45:41,488 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 2 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 310.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.78ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 373.83ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:41,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 563 Invalid, 370 Unknown, 0 Unchecked, 7.78ms Time], IncrementalHoareTripleChecker [2 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 373.83ms Time] [2021-11-13 17:45:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-13 17:45:41,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-11-13 17:45:41,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.6390977443609023) internal successors, (218), 194 states have internal predecessors, (218), 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) [2021-11-13 17:45:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2021-11-13 17:45:41,497 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 15 [2021-11-13 17:45:41,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:41,497 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2021-11-13 17:45:41,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 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) [2021-11-13 17:45:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2021-11-13 17:45:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-13 17:45:41,498 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:41,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:41,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-13 17:45:41,499 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr19ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:41,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:41,500 INFO L85 PathProgramCache]: Analyzing trace with hash 331044621, now seen corresponding path program 1 times [2021-11-13 17:45:41,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:41,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899494034] [2021-11-13 17:45:41,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:41,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:41,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:41,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:41,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:41,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899494034] [2021-11-13 17:45:41,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899494034] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:41,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:41,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:45:41,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312812119] [2021-11-13 17:45:41,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:41,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:45:41,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:41,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:45:41,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:45:41,594 INFO L87 Difference]: Start difference. First operand 198 states and 221 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 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) [2021-11-13 17:45:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:41,859 INFO L93 Difference]: Finished difference Result 199 states and 222 transitions. [2021-11-13 17:45:41,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:45:41,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 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 17 [2021-11-13 17:45:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:41,862 INFO L225 Difference]: With dead ends: 199 [2021-11-13 17:45:41,862 INFO L226 Difference]: Without dead ends: 199 [2021-11-13 17:45:41,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:45:41,869 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 195.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.09ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 247.09ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:41,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 367 Invalid, 195 Unknown, 0 Unchecked, 5.09ms Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 247.09ms Time] [2021-11-13 17:45:41,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-11-13 17:45:41,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-11-13 17:45:41,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 195 states have internal predecessors, (219), 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) [2021-11-13 17:45:41,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2021-11-13 17:45:41,877 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 17 [2021-11-13 17:45:41,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:41,878 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2021-11-13 17:45:41,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 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) [2021-11-13 17:45:41,879 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2021-11-13 17:45:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-13 17:45:41,880 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:41,881 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:41,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-13 17:45:41,881 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:41,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:41,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1404699164, now seen corresponding path program 1 times [2021-11-13 17:45:41,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:41,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914713067] [2021-11-13 17:45:41,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:41,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:42,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:42,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:42,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914713067] [2021-11-13 17:45:42,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914713067] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:42,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:42,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-13 17:45:42,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387923778] [2021-11-13 17:45:42,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:42,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 17:45:42,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:42,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 17:45:42,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-13 17:45:42,114 INFO L87 Difference]: Start difference. First operand 199 states and 222 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 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) [2021-11-13 17:45:42,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:42,717 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2021-11-13 17:45:42,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:45:42,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 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 [2021-11-13 17:45:42,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:42,720 INFO L225 Difference]: With dead ends: 199 [2021-11-13 17:45:42,720 INFO L226 Difference]: Without dead ends: 199 [2021-11-13 17:45:42,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-11-13 17:45:42,721 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 171 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 416.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.02ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 499.19ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:42,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 703 Invalid, 611 Unknown, 0 Unchecked, 8.02ms Time], IncrementalHoareTripleChecker [13 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 499.19ms Time] [2021-11-13 17:45:42,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-11-13 17:45:42,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2021-11-13 17:45:42,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.626865671641791) internal successors, (218), 194 states have internal predecessors, (218), 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) [2021-11-13 17:45:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2021-11-13 17:45:42,730 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 18 [2021-11-13 17:45:42,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:42,731 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2021-11-13 17:45:42,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 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) [2021-11-13 17:45:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2021-11-13 17:45:42,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-13 17:45:42,733 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:42,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:42,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-13 17:45:42,733 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:42,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1404699165, now seen corresponding path program 1 times [2021-11-13 17:45:42,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:42,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997866891] [2021-11-13 17:45:42,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:42,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:42,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:42,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:42,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997866891] [2021-11-13 17:45:42,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997866891] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:42,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:42,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-13 17:45:42,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816544751] [2021-11-13 17:45:42,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:42,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 17:45:42,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:42,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 17:45:42,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-13 17:45:42,946 INFO L87 Difference]: Start difference. First operand 198 states and 221 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 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) [2021-11-13 17:45:43,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:43,679 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2021-11-13 17:45:43,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:45:43,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 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 [2021-11-13 17:45:43,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:43,681 INFO L225 Difference]: With dead ends: 198 [2021-11-13 17:45:43,681 INFO L226 Difference]: Without dead ends: 198 [2021-11-13 17:45:43,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-11-13 17:45:43,683 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 168 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 486.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.25ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 615.56ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:43,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 614 Invalid, 696 Unknown, 0 Unchecked, 9.25ms Time], IncrementalHoareTripleChecker [13 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 615.56ms Time] [2021-11-13 17:45:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-13 17:45:43,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2021-11-13 17:45:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 134 states have (on average 1.6194029850746268) internal successors, (217), 193 states have internal predecessors, (217), 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) [2021-11-13 17:45:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2021-11-13 17:45:43,694 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 18 [2021-11-13 17:45:43,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:43,694 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2021-11-13 17:45:43,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 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) [2021-11-13 17:45:43,695 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2021-11-13 17:45:43,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-13 17:45:43,696 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:43,696 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:43,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-13 17:45:43,696 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr19ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:43,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:43,697 INFO L85 PathProgramCache]: Analyzing trace with hash 307937042, now seen corresponding path program 1 times [2021-11-13 17:45:43,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:43,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296204576] [2021-11-13 17:45:43,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:43,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:43,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:43,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:43,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296204576] [2021-11-13 17:45:43,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296204576] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:43,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:43,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-13 17:45:43,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369430781] [2021-11-13 17:45:43,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:43,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-13 17:45:43,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:43,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-13 17:45:43,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-13 17:45:43,832 INFO L87 Difference]: Start difference. First operand 197 states and 220 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 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) [2021-11-13 17:45:44,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:44,359 INFO L93 Difference]: Finished difference Result 289 states and 319 transitions. [2021-11-13 17:45:44,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-13 17:45:44,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 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 [2021-11-13 17:45:44,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:44,361 INFO L225 Difference]: With dead ends: 289 [2021-11-13 17:45:44,362 INFO L226 Difference]: Without dead ends: 289 [2021-11-13 17:45:44,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-13 17:45:44,363 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 109 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 333.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.16ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 408.94ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:44,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 873 Invalid, 403 Unknown, 0 Unchecked, 7.16ms Time], IncrementalHoareTripleChecker [5 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 408.94ms Time] [2021-11-13 17:45:44,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-11-13 17:45:44,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 194. [2021-11-13 17:45:44,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 132 states have (on average 1.621212121212121) internal successors, (214), 190 states have internal predecessors, (214), 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) [2021-11-13 17:45:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2021-11-13 17:45:44,371 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 19 [2021-11-13 17:45:44,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:44,372 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2021-11-13 17:45:44,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 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) [2021-11-13 17:45:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2021-11-13 17:45:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-13 17:45:44,373 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:44,373 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:44,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-13 17:45:44,374 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:44,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:44,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1873843689, now seen corresponding path program 1 times [2021-11-13 17:45:44,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:44,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640862761] [2021-11-13 17:45:44,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:44,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:44,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:44,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:44,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:44,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640862761] [2021-11-13 17:45:44,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640862761] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:44,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:44,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 17:45:44,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787787883] [2021-11-13 17:45:44,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:44,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 17:45:44,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:44,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 17:45:44,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-13 17:45:44,455 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 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) [2021-11-13 17:45:44,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:44,854 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2021-11-13 17:45:44,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 17:45:44,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 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 [2021-11-13 17:45:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:44,857 INFO L225 Difference]: With dead ends: 290 [2021-11-13 17:45:44,857 INFO L226 Difference]: Without dead ends: 290 [2021-11-13 17:45:44,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-13 17:45:44,858 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 106 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 280.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.15ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 350.71ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:44,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 615 Invalid, 302 Unknown, 0 Unchecked, 6.15ms Time], IncrementalHoareTripleChecker [2 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 350.71ms Time] [2021-11-13 17:45:44,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-11-13 17:45:44,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 197. [2021-11-13 17:45:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 135 states have (on average 1.6074074074074074) internal successors, (217), 193 states have internal predecessors, (217), 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) [2021-11-13 17:45:44,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2021-11-13 17:45:44,878 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 21 [2021-11-13 17:45:44,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:44,878 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2021-11-13 17:45:44,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 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) [2021-11-13 17:45:44,879 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2021-11-13 17:45:44,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-13 17:45:44,880 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:44,880 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:44,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-13 17:45:44,880 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:44,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:44,881 INFO L85 PathProgramCache]: Analyzing trace with hash -515815524, now seen corresponding path program 1 times [2021-11-13 17:45:44,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:44,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795331375] [2021-11-13 17:45:44,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:44,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:44,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:44,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:44,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795331375] [2021-11-13 17:45:44,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795331375] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:44,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:44,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:45:44,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476625268] [2021-11-13 17:45:44,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:44,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 17:45:44,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:44,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 17:45:44,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 17:45:44,961 INFO L87 Difference]: Start difference. First operand 197 states and 220 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 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) [2021-11-13 17:45:45,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:45,318 INFO L93 Difference]: Finished difference Result 193 states and 214 transitions. [2021-11-13 17:45:45,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 17:45:45,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 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 23 [2021-11-13 17:45:45,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:45,320 INFO L225 Difference]: With dead ends: 193 [2021-11-13 17:45:45,320 INFO L226 Difference]: Without dead ends: 193 [2021-11-13 17:45:45,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-13 17:45:45,322 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 257 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 272.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.15ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 329.21ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:45,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 129 Invalid, 317 Unknown, 0 Unchecked, 5.15ms Time], IncrementalHoareTripleChecker [24 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 329.21ms Time] [2021-11-13 17:45:45,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-11-13 17:45:45,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2021-11-13 17:45:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 184 states have internal predecessors, (208), 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) [2021-11-13 17:45:45,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 211 transitions. [2021-11-13 17:45:45,331 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 211 transitions. Word has length 23 [2021-11-13 17:45:45,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:45,331 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 211 transitions. [2021-11-13 17:45:45,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 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) [2021-11-13 17:45:45,332 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 211 transitions. [2021-11-13 17:45:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-13 17:45:45,333 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:45,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:45,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-13 17:45:45,333 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr21REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:45,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:45,334 INFO L85 PathProgramCache]: Analyzing trace with hash -515815523, now seen corresponding path program 1 times [2021-11-13 17:45:45,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:45,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755399097] [2021-11-13 17:45:45,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:45,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:45,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:45,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:45,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755399097] [2021-11-13 17:45:45,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755399097] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:45,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:45,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 17:45:45,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086042832] [2021-11-13 17:45:45,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:45,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 17:45:45,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:45,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:45:45,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:45:45,454 INFO L87 Difference]: Start difference. First operand 188 states and 211 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 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) [2021-11-13 17:45:45,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:45,930 INFO L93 Difference]: Finished difference Result 249 states and 266 transitions. [2021-11-13 17:45:45,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 17:45:45,930 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 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 23 [2021-11-13 17:45:45,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:45,932 INFO L225 Difference]: With dead ends: 249 [2021-11-13 17:45:45,933 INFO L226 Difference]: Without dead ends: 249 [2021-11-13 17:45:45,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-13 17:45:45,934 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 258 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 365.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.24ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 436.95ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:45,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 301 Invalid, 485 Unknown, 0 Unchecked, 6.24ms Time], IncrementalHoareTripleChecker [16 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 436.95ms Time] [2021-11-13 17:45:45,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-11-13 17:45:45,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 212. [2021-11-13 17:45:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 208 states have internal predecessors, (247), 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) [2021-11-13 17:45:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 250 transitions. [2021-11-13 17:45:45,943 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 250 transitions. Word has length 23 [2021-11-13 17:45:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:45,944 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 250 transitions. [2021-11-13 17:45:45,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 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) [2021-11-13 17:45:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 250 transitions. [2021-11-13 17:45:45,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-13 17:45:45,945 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:45,945 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:45,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-13 17:45:45,946 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr45ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:45,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:45,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1777429398, now seen corresponding path program 1 times [2021-11-13 17:45:45,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:45,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193150488] [2021-11-13 17:45:45,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:45,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:45,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:46,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:46,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193150488] [2021-11-13 17:45:46,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193150488] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:46,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:46,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 17:45:46,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664613603] [2021-11-13 17:45:46,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:46,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 17:45:46,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:46,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 17:45:46,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 17:45:46,007 INFO L87 Difference]: Start difference. First operand 212 states and 250 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 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) [2021-11-13 17:45:46,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:46,339 INFO L93 Difference]: Finished difference Result 244 states and 260 transitions. [2021-11-13 17:45:46,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 17:45:46,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 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 25 [2021-11-13 17:45:46,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:46,342 INFO L225 Difference]: With dead ends: 244 [2021-11-13 17:45:46,343 INFO L226 Difference]: Without dead ends: 244 [2021-11-13 17:45:46,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-13 17:45:46,344 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 235 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 252.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.10ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 307.23ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:46,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 286 Invalid, 271 Unknown, 0 Unchecked, 5.10ms Time], IncrementalHoareTripleChecker [4 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 307.23ms Time] [2021-11-13 17:45:46,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-11-13 17:45:46,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 210. [2021-11-13 17:45:46,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 160 states have (on average 1.525) internal successors, (244), 206 states have internal predecessors, (244), 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) [2021-11-13 17:45:46,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 247 transitions. [2021-11-13 17:45:46,361 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 247 transitions. Word has length 25 [2021-11-13 17:45:46,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:46,365 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 247 transitions. [2021-11-13 17:45:46,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 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) [2021-11-13 17:45:46,365 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 247 transitions. [2021-11-13 17:45:46,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-13 17:45:46,373 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:46,374 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:46,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-13 17:45:46,374 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:46,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:46,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1241440350, now seen corresponding path program 1 times [2021-11-13 17:45:46,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:46,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071920813] [2021-11-13 17:45:46,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:46,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:46,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:46,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:46,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071920813] [2021-11-13 17:45:46,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071920813] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:46,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:46,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 17:45:46,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856205502] [2021-11-13 17:45:46,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:46,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 17:45:46,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:46,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:45:46,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:45:46,496 INFO L87 Difference]: Start difference. First operand 210 states and 247 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 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) [2021-11-13 17:45:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:46,945 INFO L93 Difference]: Finished difference Result 210 states and 247 transitions. [2021-11-13 17:45:46,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:45:46,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 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 27 [2021-11-13 17:45:46,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:46,947 INFO L225 Difference]: With dead ends: 210 [2021-11-13 17:45:46,947 INFO L226 Difference]: Without dead ends: 210 [2021-11-13 17:45:46,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-13 17:45:46,949 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 104 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 322.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.52ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 389.13ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:46,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 463 Invalid, 473 Unknown, 0 Unchecked, 5.52ms Time], IncrementalHoareTripleChecker [6 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 389.13ms Time] [2021-11-13 17:45:46,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-11-13 17:45:46,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2021-11-13 17:45:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 160 states have (on average 1.51875) internal successors, (243), 205 states have internal predecessors, (243), 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) [2021-11-13 17:45:46,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 246 transitions. [2021-11-13 17:45:46,957 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 246 transitions. Word has length 27 [2021-11-13 17:45:46,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:46,957 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 246 transitions. [2021-11-13 17:45:46,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 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) [2021-11-13 17:45:46,958 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 246 transitions. [2021-11-13 17:45:46,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-13 17:45:46,958 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:46,959 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:46,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-13 17:45:46,959 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:46,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:46,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1241440351, now seen corresponding path program 1 times [2021-11-13 17:45:46,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:46,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532828705] [2021-11-13 17:45:46,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:46,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:47,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:47,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:47,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532828705] [2021-11-13 17:45:47,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532828705] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:47,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:47,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 17:45:47,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113488363] [2021-11-13 17:45:47,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:47,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 17:45:47,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:47,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:45:47,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:45:47,066 INFO L87 Difference]: Start difference. First operand 209 states and 246 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 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) [2021-11-13 17:45:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:47,510 INFO L93 Difference]: Finished difference Result 202 states and 239 transitions. [2021-11-13 17:45:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-13 17:45:47,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 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 27 [2021-11-13 17:45:47,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:47,513 INFO L225 Difference]: With dead ends: 202 [2021-11-13 17:45:47,513 INFO L226 Difference]: Without dead ends: 202 [2021-11-13 17:45:47,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-11-13 17:45:47,514 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 41 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 293.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.16ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 354.22ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:47,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 530 Invalid, 438 Unknown, 0 Unchecked, 5.16ms Time], IncrementalHoareTripleChecker [11 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 354.22ms Time] [2021-11-13 17:45:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-13 17:45:47,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 195. [2021-11-13 17:45:47,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 155 states have (on average 1.4709677419354839) internal successors, (228), 191 states have internal predecessors, (228), 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) [2021-11-13 17:45:47,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2021-11-13 17:45:47,522 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 27 [2021-11-13 17:45:47,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:47,523 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2021-11-13 17:45:47,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 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) [2021-11-13 17:45:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2021-11-13 17:45:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-13 17:45:47,524 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:47,524 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:47,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-13 17:45:47,525 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr26ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:47,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:47,525 INFO L85 PathProgramCache]: Analyzing trace with hash -976729154, now seen corresponding path program 1 times [2021-11-13 17:45:47,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:47,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333094762] [2021-11-13 17:45:47,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:47,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:47,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:47,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:47,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:47,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333094762] [2021-11-13 17:45:47,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333094762] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:47,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:47,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 17:45:47,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783432161] [2021-11-13 17:45:47,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:47,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 17:45:47,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:47,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:45:47,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:45:47,639 INFO L87 Difference]: Start difference. First operand 195 states and 231 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 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) [2021-11-13 17:45:47,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:47,968 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2021-11-13 17:45:47,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-13 17:45:47,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 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 29 [2021-11-13 17:45:47,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:47,970 INFO L225 Difference]: With dead ends: 198 [2021-11-13 17:45:47,970 INFO L226 Difference]: Without dead ends: 198 [2021-11-13 17:45:47,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-11-13 17:45:47,972 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 38 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 219.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.77ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 267.08ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:47,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 637 Invalid, 302 Unknown, 0 Unchecked, 5.77ms Time], IncrementalHoareTripleChecker [2 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 267.08ms Time] [2021-11-13 17:45:47,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-13 17:45:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2021-11-13 17:45:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 187 states have internal predecessors, (224), 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) [2021-11-13 17:45:47,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2021-11-13 17:45:47,980 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 29 [2021-11-13 17:45:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:47,981 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2021-11-13 17:45:47,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 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) [2021-11-13 17:45:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2021-11-13 17:45:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-13 17:45:47,982 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:47,982 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:47,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-13 17:45:47,983 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr59ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:47,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:47,984 INFO L85 PathProgramCache]: Analyzing trace with hash 90529238, now seen corresponding path program 1 times [2021-11-13 17:45:47,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:47,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095461915] [2021-11-13 17:45:47,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:47,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:48,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:48,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:48,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:48,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095461915] [2021-11-13 17:45:48,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095461915] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:48,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:48,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:45:48,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641710412] [2021-11-13 17:45:48,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:48,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:45:48,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:48,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:45:48,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:45:48,042 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 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) [2021-11-13 17:45:48,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:48,258 INFO L93 Difference]: Finished difference Result 264 states and 315 transitions. [2021-11-13 17:45:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:45:48,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 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 31 [2021-11-13 17:45:48,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:48,261 INFO L225 Difference]: With dead ends: 264 [2021-11-13 17:45:48,261 INFO L226 Difference]: Without dead ends: 264 [2021-11-13 17:45:48,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:45:48,262 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 50 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 166.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.93ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 201.55ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:48,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 300 Invalid, 168 Unknown, 0 Unchecked, 2.93ms Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 201.55ms Time] [2021-11-13 17:45:48,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-11-13 17:45:48,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 197. [2021-11-13 17:45:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 159 states have (on average 1.4591194968553458) internal successors, (232), 193 states have internal predecessors, (232), 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) [2021-11-13 17:45:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 235 transitions. [2021-11-13 17:45:48,271 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 235 transitions. Word has length 31 [2021-11-13 17:45:48,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:48,272 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 235 transitions. [2021-11-13 17:45:48,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 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) [2021-11-13 17:45:48,272 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 235 transitions. [2021-11-13 17:45:48,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-13 17:45:48,273 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:48,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:48,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-13 17:45:48,274 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr48ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:48,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:48,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1488582203, now seen corresponding path program 1 times [2021-11-13 17:45:48,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:48,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659680533] [2021-11-13 17:45:48,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:48,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:48,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:48,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:48,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659680533] [2021-11-13 17:45:48,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659680533] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:48,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:48,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:45:48,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022430805] [2021-11-13 17:45:48,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:48,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:45:48,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:48,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:45:48,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:45:48,343 INFO L87 Difference]: Start difference. First operand 197 states and 235 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 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) [2021-11-13 17:45:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:48,523 INFO L93 Difference]: Finished difference Result 195 states and 232 transitions. [2021-11-13 17:45:48,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:45:48,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 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 32 [2021-11-13 17:45:48,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:48,526 INFO L225 Difference]: With dead ends: 195 [2021-11-13 17:45:48,526 INFO L226 Difference]: Without dead ends: 195 [2021-11-13 17:45:48,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:45:48,527 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 20 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 136.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.21ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 170.46ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:48,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 269 Invalid, 173 Unknown, 0 Unchecked, 2.21ms Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 170.46ms Time] [2021-11-13 17:45:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-11-13 17:45:48,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-11-13 17:45:48,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 158 states have (on average 1.4493670886075949) internal successors, (229), 191 states have internal predecessors, (229), 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) [2021-11-13 17:45:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2021-11-13 17:45:48,536 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 32 [2021-11-13 17:45:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:48,536 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2021-11-13 17:45:48,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 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) [2021-11-13 17:45:48,537 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2021-11-13 17:45:48,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-13 17:45:48,538 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:48,538 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:48,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-13 17:45:48,538 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:48,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:48,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1098596299, now seen corresponding path program 1 times [2021-11-13 17:45:48,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:48,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81013619] [2021-11-13 17:45:48,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:48,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:48,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:48,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:48,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:48,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81013619] [2021-11-13 17:45:48,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81013619] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:48,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:48,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-13 17:45:48,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301726028] [2021-11-13 17:45:48,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:48,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-13 17:45:48,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:48,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-13 17:45:48,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-13 17:45:48,743 INFO L87 Difference]: Start difference. First operand 195 states and 232 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 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) [2021-11-13 17:45:49,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:49,449 INFO L93 Difference]: Finished difference Result 325 states and 363 transitions. [2021-11-13 17:45:49,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-13 17:45:49,450 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 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 33 [2021-11-13 17:45:49,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:49,452 INFO L225 Difference]: With dead ends: 325 [2021-11-13 17:45:49,452 INFO L226 Difference]: Without dead ends: 325 [2021-11-13 17:45:49,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2021-11-13 17:45:49,454 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 408 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 446.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.65ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 541.01ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:49,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [408 Valid, 861 Invalid, 572 Unknown, 0 Unchecked, 7.65ms Time], IncrementalHoareTripleChecker [17 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 541.01ms Time] [2021-11-13 17:45:49,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-11-13 17:45:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 228. [2021-11-13 17:45:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 191 states have (on average 1.3979057591623036) internal successors, (267), 224 states have internal predecessors, (267), 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) [2021-11-13 17:45:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 270 transitions. [2021-11-13 17:45:49,464 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 270 transitions. Word has length 33 [2021-11-13 17:45:49,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:49,464 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 270 transitions. [2021-11-13 17:45:49,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 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) [2021-11-13 17:45:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 270 transitions. [2021-11-13 17:45:49,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-13 17:45:49,466 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:49,466 INFO L514 BasicCegarLoop]: 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] [2021-11-13 17:45:49,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-13 17:45:49,467 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr46REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:49,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:49,467 INFO L85 PathProgramCache]: Analyzing trace with hash -49345090, now seen corresponding path program 1 times [2021-11-13 17:45:49,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:49,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148319977] [2021-11-13 17:45:49,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:49,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:49,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:49,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:49,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148319977] [2021-11-13 17:45:49,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148319977] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:45:49,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877002486] [2021-11-13 17:45:49,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:49,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:45:49,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:45:49,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:45:49,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-13 17:45:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:49,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-13 17:45:49,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:45:49,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-13 17:45:49,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-13 17:45:50,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:45:50,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-13 17:45:50,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:45:50,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-13 17:45:50,612 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-11-13 17:45:50,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 40 [2021-11-13 17:45:50,638 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-11-13 17:45:50,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 22 [2021-11-13 17:45:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:50,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:45:52,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2021-11-13 17:45:52,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2021-11-13 17:45:52,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2021-11-13 17:45:52,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2021-11-13 17:45:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:52,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877002486] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:45:52,589 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:45:52,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 14 [2021-11-13 17:45:52,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995752577] [2021-11-13 17:45:52,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:45:52,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-13 17:45:52,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:52,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-13 17:45:52,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-13 17:45:52,593 INFO L87 Difference]: Start difference. First operand 228 states and 270 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:45:53,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:53,458 INFO L93 Difference]: Finished difference Result 381 states and 422 transitions. [2021-11-13 17:45:53,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-13 17:45:53,459 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-11-13 17:45:53,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:53,462 INFO L225 Difference]: With dead ends: 381 [2021-11-13 17:45:53,462 INFO L226 Difference]: Without dead ends: 381 [2021-11-13 17:45:53,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2021-11-13 17:45:53,463 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 581 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 530.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.70ms SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 634.08ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:53,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [581 Valid, 935 Invalid, 662 Unknown, 0 Unchecked, 10.70ms Time], IncrementalHoareTripleChecker [50 Valid, 574 Invalid, 0 Unknown, 38 Unchecked, 634.08ms Time] [2021-11-13 17:45:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-13 17:45:53,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 266. [2021-11-13 17:45:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 229 states have (on average 1.4017467248908297) internal successors, (321), 262 states have internal predecessors, (321), 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) [2021-11-13 17:45:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2021-11-13 17:45:53,496 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 35 [2021-11-13 17:45:53,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:53,496 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2021-11-13 17:45:53,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:45:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2021-11-13 17:45:53,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-13 17:45:53,498 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:53,498 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:53,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-13 17:45:53,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:45:53,699 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:53,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:53,700 INFO L85 PathProgramCache]: Analyzing trace with hash -824345932, now seen corresponding path program 1 times [2021-11-13 17:45:53,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:53,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452033967] [2021-11-13 17:45:53,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:53,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:53,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:53,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:53,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452033967] [2021-11-13 17:45:53,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452033967] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:53,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:53,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 17:45:53,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945702471] [2021-11-13 17:45:53,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:53,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 17:45:53,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:53,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 17:45:53,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-13 17:45:53,793 INFO L87 Difference]: Start difference. First operand 266 states and 324 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 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) [2021-11-13 17:45:54,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:54,145 INFO L93 Difference]: Finished difference Result 265 states and 323 transitions. [2021-11-13 17:45:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-13 17:45:54,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-11-13 17:45:54,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:54,148 INFO L225 Difference]: With dead ends: 265 [2021-11-13 17:45:54,148 INFO L226 Difference]: Without dead ends: 265 [2021-11-13 17:45:54,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-13 17:45:54,150 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 4 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 258.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.25ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 316.73ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:54,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 442 Invalid, 319 Unknown, 0 Unchecked, 4.25ms Time], IncrementalHoareTripleChecker [2 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 316.73ms Time] [2021-11-13 17:45:54,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-11-13 17:45:54,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2021-11-13 17:45:54,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 229 states have (on average 1.3973799126637554) internal successors, (320), 261 states have internal predecessors, (320), 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) [2021-11-13 17:45:54,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 323 transitions. [2021-11-13 17:45:54,161 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 323 transitions. Word has length 37 [2021-11-13 17:45:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:54,161 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 323 transitions. [2021-11-13 17:45:54,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 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) [2021-11-13 17:45:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 323 transitions. [2021-11-13 17:45:54,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-13 17:45:54,163 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:54,163 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:54,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-13 17:45:54,164 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:54,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:54,164 INFO L85 PathProgramCache]: Analyzing trace with hash -824345931, now seen corresponding path program 1 times [2021-11-13 17:45:54,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:54,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141199759] [2021-11-13 17:45:54,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:54,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:54,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:54,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:54,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:54,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141199759] [2021-11-13 17:45:54,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141199759] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:54,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:54,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 17:45:54,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592878733] [2021-11-13 17:45:54,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:54,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 17:45:54,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:54,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 17:45:54,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-13 17:45:54,266 INFO L87 Difference]: Start difference. First operand 265 states and 323 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 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) [2021-11-13 17:45:54,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:54,652 INFO L93 Difference]: Finished difference Result 264 states and 322 transitions. [2021-11-13 17:45:54,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-13 17:45:54,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-11-13 17:45:54,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:54,655 INFO L225 Difference]: With dead ends: 264 [2021-11-13 17:45:54,655 INFO L226 Difference]: Without dead ends: 264 [2021-11-13 17:45:54,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-13 17:45:54,656 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 2 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 272.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.29ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 338.51ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:54,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 445 Invalid, 313 Unknown, 0 Unchecked, 4.29ms Time], IncrementalHoareTripleChecker [2 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 338.51ms Time] [2021-11-13 17:45:54,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-11-13 17:45:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2021-11-13 17:45:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 229 states have (on average 1.3930131004366813) internal successors, (319), 260 states have internal predecessors, (319), 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) [2021-11-13 17:45:54,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 322 transitions. [2021-11-13 17:45:54,666 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 322 transitions. Word has length 37 [2021-11-13 17:45:54,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:54,667 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 322 transitions. [2021-11-13 17:45:54,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 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) [2021-11-13 17:45:54,667 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 322 transitions. [2021-11-13 17:45:54,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-13 17:45:54,668 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:54,668 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:54,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-13 17:45:54,669 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:54,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:54,669 INFO L85 PathProgramCache]: Analyzing trace with hash 385741532, now seen corresponding path program 1 times [2021-11-13 17:45:54,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:54,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516051569] [2021-11-13 17:45:54,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:54,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:54,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:54,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:54,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516051569] [2021-11-13 17:45:54,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516051569] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:54,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:54,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-13 17:45:54,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752991271] [2021-11-13 17:45:54,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:54,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-13 17:45:54,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:54,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-13 17:45:54,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-13 17:45:54,881 INFO L87 Difference]: Start difference. First operand 264 states and 322 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 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) [2021-11-13 17:45:55,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:55,768 INFO L93 Difference]: Finished difference Result 374 states and 421 transitions. [2021-11-13 17:45:55,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-13 17:45:55,769 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-11-13 17:45:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:55,771 INFO L225 Difference]: With dead ends: 374 [2021-11-13 17:45:55,772 INFO L226 Difference]: Without dead ends: 374 [2021-11-13 17:45:55,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-11-13 17:45:55,773 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 522 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 560.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.49ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 672.36ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:55,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [522 Valid, 805 Invalid, 801 Unknown, 0 Unchecked, 10.49ms Time], IncrementalHoareTripleChecker [32 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 672.36ms Time] [2021-11-13 17:45:55,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-11-13 17:45:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 265. [2021-11-13 17:45:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 232 states have (on average 1.3663793103448276) internal successors, (317), 261 states have internal predecessors, (317), 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) [2021-11-13 17:45:55,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 320 transitions. [2021-11-13 17:45:55,785 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 320 transitions. Word has length 38 [2021-11-13 17:45:55,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:55,786 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 320 transitions. [2021-11-13 17:45:55,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 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) [2021-11-13 17:45:55,786 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 320 transitions. [2021-11-13 17:45:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-13 17:45:55,787 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:55,787 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:55,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-13 17:45:55,788 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr50REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:55,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:55,792 INFO L85 PathProgramCache]: Analyzing trace with hash 385741533, now seen corresponding path program 1 times [2021-11-13 17:45:55,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:55,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458486394] [2021-11-13 17:45:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:55,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:56,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:56,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:56,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:56,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458486394] [2021-11-13 17:45:56,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458486394] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:56,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:56,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-13 17:45:56,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683201465] [2021-11-13 17:45:56,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:56,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-13 17:45:56,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:56,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-13 17:45:56,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-13 17:45:56,105 INFO L87 Difference]: Start difference. First operand 265 states and 320 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 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) [2021-11-13 17:45:57,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:57,289 INFO L93 Difference]: Finished difference Result 430 states and 478 transitions. [2021-11-13 17:45:57,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-13 17:45:57,290 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-11-13 17:45:57,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:57,294 INFO L225 Difference]: With dead ends: 430 [2021-11-13 17:45:57,295 INFO L226 Difference]: Without dead ends: 430 [2021-11-13 17:45:57,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2021-11-13 17:45:57,297 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 471 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 722.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.07ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 901.71ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:57,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [471 Valid, 1102 Invalid, 1131 Unknown, 0 Unchecked, 12.07ms Time], IncrementalHoareTripleChecker [28 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 901.71ms Time] [2021-11-13 17:45:57,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-11-13 17:45:57,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 271. [2021-11-13 17:45:57,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 238 states have (on average 1.361344537815126) internal successors, (324), 267 states have internal predecessors, (324), 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) [2021-11-13 17:45:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 327 transitions. [2021-11-13 17:45:57,309 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 327 transitions. Word has length 38 [2021-11-13 17:45:57,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:57,310 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 327 transitions. [2021-11-13 17:45:57,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 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) [2021-11-13 17:45:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 327 transitions. [2021-11-13 17:45:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-13 17:45:57,311 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:57,311 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:57,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-13 17:45:57,312 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:57,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:57,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2104055878, now seen corresponding path program 1 times [2021-11-13 17:45:57,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:57,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363059706] [2021-11-13 17:45:57,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:57,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:57,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:57,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:57,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363059706] [2021-11-13 17:45:57,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363059706] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:57,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:57,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:45:57,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753797281] [2021-11-13 17:45:57,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:57,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:45:57,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:57,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:45:57,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:45:57,402 INFO L87 Difference]: Start difference. First operand 271 states and 327 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 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) [2021-11-13 17:45:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:57,605 INFO L93 Difference]: Finished difference Result 273 states and 329 transitions. [2021-11-13 17:45:57,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:45:57,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-11-13 17:45:57,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:57,609 INFO L225 Difference]: With dead ends: 273 [2021-11-13 17:45:57,610 INFO L226 Difference]: Without dead ends: 273 [2021-11-13 17:45:57,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:45:57,611 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 155.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.05ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 192.30ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:57,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 158 Unknown, 0 Unchecked, 2.05ms Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 192.30ms Time] [2021-11-13 17:45:57,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-11-13 17:45:57,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-11-13 17:45:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 240 states have (on average 1.3583333333333334) internal successors, (326), 269 states have internal predecessors, (326), 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) [2021-11-13 17:45:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 329 transitions. [2021-11-13 17:45:57,622 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 329 transitions. Word has length 39 [2021-11-13 17:45:57,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:57,622 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 329 transitions. [2021-11-13 17:45:57,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 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) [2021-11-13 17:45:57,623 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 329 transitions. [2021-11-13 17:45:57,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-13 17:45:57,624 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:57,624 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:57,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-13 17:45:57,624 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr64ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:57,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:57,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1003773134, now seen corresponding path program 1 times [2021-11-13 17:45:57,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:57,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94730039] [2021-11-13 17:45:57,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:57,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:57,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-13 17:45:57,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:57,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94730039] [2021-11-13 17:45:57,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94730039] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:57,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:57,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-13 17:45:57,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617834728] [2021-11-13 17:45:57,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:57,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-13 17:45:57,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:57,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-13 17:45:57,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-13 17:45:57,748 INFO L87 Difference]: Start difference. First operand 273 states and 329 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 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) [2021-11-13 17:45:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:58,163 INFO L93 Difference]: Finished difference Result 288 states and 344 transitions. [2021-11-13 17:45:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:45:58,164 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-11-13 17:45:58,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:58,165 INFO L225 Difference]: With dead ends: 288 [2021-11-13 17:45:58,166 INFO L226 Difference]: Without dead ends: 288 [2021-11-13 17:45:58,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-13 17:45:58,170 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 49 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 275.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.96ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 341.71ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:58,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 660 Invalid, 380 Unknown, 0 Unchecked, 3.96ms Time], IncrementalHoareTripleChecker [9 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 341.71ms Time] [2021-11-13 17:45:58,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-11-13 17:45:58,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 282. [2021-11-13 17:45:58,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 249 states have (on average 1.3453815261044177) internal successors, (335), 278 states have internal predecessors, (335), 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) [2021-11-13 17:45:58,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 338 transitions. [2021-11-13 17:45:58,185 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 338 transitions. Word has length 40 [2021-11-13 17:45:58,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:58,186 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 338 transitions. [2021-11-13 17:45:58,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 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) [2021-11-13 17:45:58,187 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 338 transitions. [2021-11-13 17:45:58,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-13 17:45:58,187 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:58,188 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:58,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-13 17:45:58,188 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr38REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:58,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:58,189 INFO L85 PathProgramCache]: Analyzing trace with hash 533473399, now seen corresponding path program 1 times [2021-11-13 17:45:58,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:58,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066686884] [2021-11-13 17:45:58,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:58,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:58,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:58,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:58,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066686884] [2021-11-13 17:45:58,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066686884] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:58,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:58,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-13 17:45:58,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756559848] [2021-11-13 17:45:58,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:58,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 17:45:58,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:58,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 17:45:58,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-13 17:45:58,363 INFO L87 Difference]: Start difference. First operand 282 states and 338 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 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) [2021-11-13 17:45:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:58,811 INFO L93 Difference]: Finished difference Result 282 states and 338 transitions. [2021-11-13 17:45:58,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:45:58,812 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-11-13 17:45:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:58,814 INFO L225 Difference]: With dead ends: 282 [2021-11-13 17:45:58,814 INFO L226 Difference]: Without dead ends: 282 [2021-11-13 17:45:58,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-11-13 17:45:58,815 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 82 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 280.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.65ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 352.80ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:58,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 427 Invalid, 420 Unknown, 0 Unchecked, 3.65ms Time], IncrementalHoareTripleChecker [12 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 352.80ms Time] [2021-11-13 17:45:58,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-11-13 17:45:58,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2021-11-13 17:45:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 249 states have (on average 1.3413654618473896) internal successors, (334), 277 states have internal predecessors, (334), 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) [2021-11-13 17:45:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 337 transitions. [2021-11-13 17:45:58,860 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 337 transitions. Word has length 40 [2021-11-13 17:45:58,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:58,860 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 337 transitions. [2021-11-13 17:45:58,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 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) [2021-11-13 17:45:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 337 transitions. [2021-11-13 17:45:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-13 17:45:58,861 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:58,862 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:58,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-13 17:45:58,862 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr39REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:58,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:58,863 INFO L85 PathProgramCache]: Analyzing trace with hash 533473400, now seen corresponding path program 1 times [2021-11-13 17:45:58,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:58,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533501395] [2021-11-13 17:45:58,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:58,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:59,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:45:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:59,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:59,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:59,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533501395] [2021-11-13 17:45:59,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533501395] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:45:59,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:45:59,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-13 17:45:59,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885239266] [2021-11-13 17:45:59,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:45:59,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 17:45:59,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:45:59,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 17:45:59,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-13 17:45:59,035 INFO L87 Difference]: Start difference. First operand 281 states and 337 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 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) [2021-11-13 17:45:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:45:59,613 INFO L93 Difference]: Finished difference Result 281 states and 337 transitions. [2021-11-13 17:45:59,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:45:59,614 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-11-13 17:45:59,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:45:59,616 INFO L225 Difference]: With dead ends: 281 [2021-11-13 17:45:59,617 INFO L226 Difference]: Without dead ends: 281 [2021-11-13 17:45:59,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-11-13 17:45:59,624 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 76 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 377.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.62ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 457.13ms IncrementalHoareTripleChecker+Time [2021-11-13 17:45:59,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 577 Invalid, 562 Unknown, 0 Unchecked, 4.62ms Time], IncrementalHoareTripleChecker [12 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 457.13ms Time] [2021-11-13 17:45:59,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-11-13 17:45:59,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2021-11-13 17:45:59,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 249 states have (on average 1.3373493975903614) internal successors, (333), 276 states have internal predecessors, (333), 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) [2021-11-13 17:45:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 336 transitions. [2021-11-13 17:45:59,645 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 336 transitions. Word has length 40 [2021-11-13 17:45:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:45:59,646 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 336 transitions. [2021-11-13 17:45:59,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 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) [2021-11-13 17:45:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 336 transitions. [2021-11-13 17:45:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-13 17:45:59,647 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:45:59,647 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:45:59,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-13 17:45:59,648 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr51ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:45:59,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:59,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1330432764, now seen corresponding path program 1 times [2021-11-13 17:45:59,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:59,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62622680] [2021-11-13 17:45:59,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:59,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:00,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:46:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:46:00,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:46:00,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62622680] [2021-11-13 17:46:00,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62622680] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:46:00,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:46:00,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-13 17:46:00,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324998935] [2021-11-13 17:46:00,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:46:00,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-13 17:46:00,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:46:00,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-13 17:46:00,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-13 17:46:00,060 INFO L87 Difference]: Start difference. First operand 280 states and 336 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 1 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) [2021-11-13 17:46:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:46:01,429 INFO L93 Difference]: Finished difference Result 448 states and 489 transitions. [2021-11-13 17:46:01,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-13 17:46:01,430 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-11-13 17:46:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:46:01,433 INFO L225 Difference]: With dead ends: 448 [2021-11-13 17:46:01,433 INFO L226 Difference]: Without dead ends: 448 [2021-11-13 17:46:01,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2021-11-13 17:46:01,435 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 631 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 716.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.91ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 855.92ms IncrementalHoareTripleChecker+Time [2021-11-13 17:46:01,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 1328 Invalid, 1070 Unknown, 0 Unchecked, 9.91ms Time], IncrementalHoareTripleChecker [35 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 855.92ms Time] [2021-11-13 17:46:01,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-11-13 17:46:01,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 280. [2021-11-13 17:46:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 249 states have (on average 1.3333333333333333) internal successors, (332), 276 states have internal predecessors, (332), 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) [2021-11-13 17:46:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 335 transitions. [2021-11-13 17:46:01,447 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 335 transitions. Word has length 40 [2021-11-13 17:46:01,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:46:01,447 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 335 transitions. [2021-11-13 17:46:01,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 1 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) [2021-11-13 17:46:01,448 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 335 transitions. [2021-11-13 17:46:01,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-13 17:46:01,449 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:46:01,449 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:46:01,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-13 17:46:01,449 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:46:01,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:46:01,450 INFO L85 PathProgramCache]: Analyzing trace with hash -930257781, now seen corresponding path program 1 times [2021-11-13 17:46:01,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:46:01,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712358208] [2021-11-13 17:46:01,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:46:01,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:46:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:01,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:46:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:46:01,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:46:01,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712358208] [2021-11-13 17:46:01,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712358208] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:46:01,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:46:01,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-13 17:46:01,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963593462] [2021-11-13 17:46:01,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:46:01,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-13 17:46:01,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:46:01,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-13 17:46:01,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-13 17:46:01,576 INFO L87 Difference]: Start difference. First operand 280 states and 335 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 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) [2021-11-13 17:46:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:46:01,959 INFO L93 Difference]: Finished difference Result 290 states and 346 transitions. [2021-11-13 17:46:01,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-13 17:46:01,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 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 41 [2021-11-13 17:46:01,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:46:01,961 INFO L225 Difference]: With dead ends: 290 [2021-11-13 17:46:01,961 INFO L226 Difference]: Without dead ends: 290 [2021-11-13 17:46:01,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-13 17:46:01,963 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 33 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 201.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.77ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 253.60ms IncrementalHoareTripleChecker+Time [2021-11-13 17:46:01,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 470 Invalid, 312 Unknown, 0 Unchecked, 2.77ms Time], IncrementalHoareTripleChecker [9 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 253.60ms Time] [2021-11-13 17:46:01,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-11-13 17:46:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 276. [2021-11-13 17:46:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 246 states have (on average 1.329268292682927) internal successors, (327), 272 states have internal predecessors, (327), 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) [2021-11-13 17:46:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 330 transitions. [2021-11-13 17:46:01,973 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 330 transitions. Word has length 41 [2021-11-13 17:46:01,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:46:01,974 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 330 transitions. [2021-11-13 17:46:01,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 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) [2021-11-13 17:46:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 330 transitions. [2021-11-13 17:46:01,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-13 17:46:01,975 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:46:01,976 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:46:01,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-13 17:46:01,976 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr77ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:46:01,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:46:01,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1804534839, now seen corresponding path program 1 times [2021-11-13 17:46:01,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:46:01,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225595844] [2021-11-13 17:46:01,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:46:01,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:46:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:02,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:46:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:02,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-13 17:46:02,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:46:02,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225595844] [2021-11-13 17:46:02,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225595844] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:46:02,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:46:02,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 17:46:02,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760090019] [2021-11-13 17:46:02,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:46:02,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:46:02,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:46:02,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:46:02,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:46:02,031 INFO L87 Difference]: Start difference. First operand 276 states and 330 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 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) [2021-11-13 17:46:02,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:46:02,221 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2021-11-13 17:46:02,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:46:02,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 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 42 [2021-11-13 17:46:02,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:46:02,222 INFO L225 Difference]: With dead ends: 289 [2021-11-13 17:46:02,222 INFO L226 Difference]: Without dead ends: 289 [2021-11-13 17:46:02,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:46:02,223 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 97 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 149.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.78ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 181.54ms IncrementalHoareTripleChecker+Time [2021-11-13 17:46:02,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 158 Invalid, 181 Unknown, 0 Unchecked, 1.78ms Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 181.54ms Time] [2021-11-13 17:46:02,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-11-13 17:46:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 277. [2021-11-13 17:46:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 247 states have (on average 1.3279352226720649) internal successors, (328), 273 states have internal predecessors, (328), 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) [2021-11-13 17:46:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 331 transitions. [2021-11-13 17:46:02,231 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 331 transitions. Word has length 42 [2021-11-13 17:46:02,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:46:02,231 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 331 transitions. [2021-11-13 17:46:02,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 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) [2021-11-13 17:46:02,232 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 331 transitions. [2021-11-13 17:46:02,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-13 17:46:02,233 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:46:02,233 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:46:02,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-13 17:46:02,233 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr54ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:46:02,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:46:02,234 INFO L85 PathProgramCache]: Analyzing trace with hash 968459560, now seen corresponding path program 1 times [2021-11-13 17:46:02,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:46:02,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999416771] [2021-11-13 17:46:02,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:46:02,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:46:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:02,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:46:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:02,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:46:02,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:46:02,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999416771] [2021-11-13 17:46:02,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999416771] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:46:02,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:46:02,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-13 17:46:02,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288246927] [2021-11-13 17:46:02,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:46:02,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-13 17:46:02,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:46:02,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-13 17:46:02,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-13 17:46:02,617 INFO L87 Difference]: Start difference. First operand 277 states and 331 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 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) [2021-11-13 17:46:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:46:03,875 INFO L93 Difference]: Finished difference Result 428 states and 475 transitions. [2021-11-13 17:46:03,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-13 17:46:03,876 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2021-11-13 17:46:03,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:46:03,878 INFO L225 Difference]: With dead ends: 428 [2021-11-13 17:46:03,879 INFO L226 Difference]: Without dead ends: 428 [2021-11-13 17:46:03,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2021-11-13 17:46:03,880 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 719 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 670.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.30ms SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 807.33ms IncrementalHoareTripleChecker+Time [2021-11-13 17:46:03,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [719 Valid, 1108 Invalid, 994 Unknown, 0 Unchecked, 9.30ms Time], IncrementalHoareTripleChecker [43 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 807.33ms Time] [2021-11-13 17:46:03,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-11-13 17:46:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 277. [2021-11-13 17:46:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 247 states have (on average 1.3238866396761133) internal successors, (327), 273 states have internal predecessors, (327), 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) [2021-11-13 17:46:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 330 transitions. [2021-11-13 17:46:03,892 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 330 transitions. Word has length 43 [2021-11-13 17:46:03,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:46:03,892 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 330 transitions. [2021-11-13 17:46:03,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 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) [2021-11-13 17:46:03,893 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 330 transitions. [2021-11-13 17:46:03,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-13 17:46:03,894 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:46:03,894 INFO L514 BasicCegarLoop]: 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] [2021-11-13 17:46:03,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-13 17:46:03,894 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr62REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:46:03,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:46:03,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1207787386, now seen corresponding path program 1 times [2021-11-13 17:46:03,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:46:03,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864860701] [2021-11-13 17:46:03,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:46:03,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:46:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:04,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:46:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:04,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:46:04,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:46:04,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864860701] [2021-11-13 17:46:04,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864860701] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:46:04,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821385383] [2021-11-13 17:46:04,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:46:04,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:46:04,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:46:04,096 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:46:04,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-13 17:46:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:04,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-13 17:46:04,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:46:04,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-13 17:46:04,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-13 17:46:04,327 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-13 17:46:04,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-11-13 17:46:04,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:46:04,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-13 17:46:04,762 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-13 17:46:04,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2021-11-13 17:46:04,769 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-13 17:46:04,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2021-11-13 17:46:04,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-13 17:46:04,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:46:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-13 17:46:05,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821385383] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:46:05,111 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:46:05,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 11 [2021-11-13 17:46:05,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615664138] [2021-11-13 17:46:05,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:46:05,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-13 17:46:05,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:46:05,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-13 17:46:05,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-13 17:46:05,113 INFO L87 Difference]: Start difference. First operand 277 states and 330 transitions. Second operand has 11 states, 11 states have (on average 9.0) internal successors, (99), 10 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:46:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:46:06,082 INFO L93 Difference]: Finished difference Result 409 states and 450 transitions. [2021-11-13 17:46:06,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-13 17:46:06,083 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 10 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-11-13 17:46:06,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:46:06,085 INFO L225 Difference]: With dead ends: 409 [2021-11-13 17:46:06,086 INFO L226 Difference]: Without dead ends: 409 [2021-11-13 17:46:06,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2021-11-13 17:46:06,087 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 223 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 550.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.37ms SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 653.19ms IncrementalHoareTripleChecker+Time [2021-11-13 17:46:06,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 1033 Invalid, 742 Unknown, 0 Unchecked, 7.37ms Time], IncrementalHoareTripleChecker [31 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 653.19ms Time] [2021-11-13 17:46:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-11-13 17:46:06,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 301. [2021-11-13 17:46:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 271 states have (on average 1.3357933579335792) internal successors, (362), 297 states have internal predecessors, (362), 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) [2021-11-13 17:46:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 365 transitions. [2021-11-13 17:46:06,098 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 365 transitions. Word has length 45 [2021-11-13 17:46:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:46:06,098 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 365 transitions. [2021-11-13 17:46:06,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 10 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:46:06,099 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 365 transitions. [2021-11-13 17:46:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-13 17:46:06,100 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:46:06,100 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:46:06,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-13 17:46:06,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-11-13 17:46:06,328 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr64ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:46:06,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:46:06,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1891470081, now seen corresponding path program 1 times [2021-11-13 17:46:06,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:46:06,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905097224] [2021-11-13 17:46:06,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:46:06,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:46:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:06,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:46:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:06,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-13 17:46:06,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:46:06,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905097224] [2021-11-13 17:46:06,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905097224] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:46:06,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:46:06,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:46:06,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644839339] [2021-11-13 17:46:06,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:46:06,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:46:06,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:46:06,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:46:06,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:46:06,392 INFO L87 Difference]: Start difference. First operand 301 states and 365 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 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) [2021-11-13 17:46:06,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:46:06,631 INFO L93 Difference]: Finished difference Result 303 states and 365 transitions. [2021-11-13 17:46:06,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:46:06,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-11-13 17:46:06,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:46:06,634 INFO L225 Difference]: With dead ends: 303 [2021-11-13 17:46:06,634 INFO L226 Difference]: Without dead ends: 303 [2021-11-13 17:46:06,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:46:06,635 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 88 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 188.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.38ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 227.73ms IncrementalHoareTripleChecker+Time [2021-11-13 17:46:06,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 172 Invalid, 198 Unknown, 0 Unchecked, 2.38ms Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 227.73ms Time] [2021-11-13 17:46:06,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-11-13 17:46:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2021-11-13 17:46:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 270 states have (on average 1.325925925925926) internal successors, (358), 295 states have internal predecessors, (358), 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) [2021-11-13 17:46:06,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 361 transitions. [2021-11-13 17:46:06,650 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 361 transitions. Word has length 45 [2021-11-13 17:46:06,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:46:06,650 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 361 transitions. [2021-11-13 17:46:06,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 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) [2021-11-13 17:46:06,651 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 361 transitions. [2021-11-13 17:46:06,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-13 17:46:06,652 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:46:06,652 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:46:06,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-13 17:46:06,653 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr79ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:46:06,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:46:06,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1213297892, now seen corresponding path program 1 times [2021-11-13 17:46:06,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:46:06,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157384431] [2021-11-13 17:46:06,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:46:06,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:46:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:06,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:46:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-13 17:46:06,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:46:06,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157384431] [2021-11-13 17:46:06,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157384431] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:46:06,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553711345] [2021-11-13 17:46:06,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:46:06,727 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:46:06,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:46:06,728 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:46:06,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-13 17:46:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:06,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-13 17:46:06,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:46:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-13 17:46:07,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:46:07,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-13 17:46:07,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553711345] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:46:07,444 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:46:07,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-13 17:46:07,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284642866] [2021-11-13 17:46:07,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:46:07,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-13 17:46:07,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:46:07,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-13 17:46:07,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-13 17:46:07,450 INFO L87 Difference]: Start difference. First operand 299 states and 361 transitions. Second operand has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:46:07,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:46:07,585 INFO L93 Difference]: Finished difference Result 330 states and 392 transitions. [2021-11-13 17:46:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 17:46:07,585 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-11-13 17:46:07,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:46:07,588 INFO L225 Difference]: With dead ends: 330 [2021-11-13 17:46:07,589 INFO L226 Difference]: Without dead ends: 306 [2021-11-13 17:46:07,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-13 17:46:07,591 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 2 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 98.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.58ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 125.19ms IncrementalHoareTripleChecker+Time [2021-11-13 17:46:07,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 595 Invalid, 182 Unknown, 0 Unchecked, 2.58ms Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 63 Unchecked, 125.19ms Time] [2021-11-13 17:46:07,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-11-13 17:46:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-11-13 17:46:07,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 277 states have (on average 1.3176895306859207) internal successors, (365), 302 states have internal predecessors, (365), 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) [2021-11-13 17:46:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 368 transitions. [2021-11-13 17:46:07,611 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 368 transitions. Word has length 46 [2021-11-13 17:46:07,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:46:07,611 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 368 transitions. [2021-11-13 17:46:07,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:46:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 368 transitions. [2021-11-13 17:46:07,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-13 17:46:07,613 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:46:07,613 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:46:07,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-13 17:46:07,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-11-13 17:46:07,840 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr65REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:46:07,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:46:07,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1493965183, now seen corresponding path program 1 times [2021-11-13 17:46:07,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:46:07,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774886059] [2021-11-13 17:46:07,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:46:07,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:46:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:08,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:46:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-13 17:46:08,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:46:08,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774886059] [2021-11-13 17:46:08,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774886059] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:46:08,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:46:08,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-13 17:46:08,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735960726] [2021-11-13 17:46:08,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:46:08,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-13 17:46:08,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:46:08,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-13 17:46:08,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-13 17:46:08,020 INFO L87 Difference]: Start difference. First operand 306 states and 368 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 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) [2021-11-13 17:46:08,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:46:08,635 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2021-11-13 17:46:08,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-13 17:46:08,636 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 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 46 [2021-11-13 17:46:08,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:46:08,638 INFO L225 Difference]: With dead ends: 349 [2021-11-13 17:46:08,638 INFO L226 Difference]: Without dead ends: 349 [2021-11-13 17:46:08,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-11-13 17:46:08,640 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 469 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 401.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.95ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 485.10ms IncrementalHoareTripleChecker+Time [2021-11-13 17:46:08,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 473 Invalid, 569 Unknown, 0 Unchecked, 6.95ms Time], IncrementalHoareTripleChecker [30 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 485.10ms Time] [2021-11-13 17:46:08,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-11-13 17:46:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 313. [2021-11-13 17:46:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 284 states have (on average 1.3169014084507042) internal successors, (374), 309 states have internal predecessors, (374), 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) [2021-11-13 17:46:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 377 transitions. [2021-11-13 17:46:08,650 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 377 transitions. Word has length 46 [2021-11-13 17:46:08,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:46:08,651 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 377 transitions. [2021-11-13 17:46:08,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 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) [2021-11-13 17:46:08,651 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 377 transitions. [2021-11-13 17:46:08,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-13 17:46:08,652 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:46:08,652 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:46:08,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-13 17:46:08,653 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr66REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:46:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:46:08,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1493965182, now seen corresponding path program 1 times [2021-11-13 17:46:08,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:46:08,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362541104] [2021-11-13 17:46:08,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:46:08,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:46:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:08,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:46:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:46:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-13 17:46:08,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:46:08,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362541104] [2021-11-13 17:46:08,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362541104] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:46:08,892 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:46:08,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-13 17:46:08,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986548403] [2021-11-13 17:46:08,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:46:08,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-13 17:46:08,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:46:08,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-13 17:46:08,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-13 17:46:08,895 INFO L87 Difference]: Start difference. First operand 313 states and 377 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 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) [2021-11-13 17:46:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:46:09,724 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2021-11-13 17:46:09,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-13 17:46:09,725 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 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 46 [2021-11-13 17:46:09,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:46:09,727 INFO L225 Difference]: With dead ends: 349 [2021-11-13 17:46:09,728 INFO L226 Difference]: Without dead ends: 349 [2021-11-13 17:46:09,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-11-13 17:46:09,729 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 292 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 553.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.12ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 655.68ms IncrementalHoareTripleChecker+Time [2021-11-13 17:46:09,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 698 Invalid, 777 Unknown, 0 Unchecked, 8.12ms Time], IncrementalHoareTripleChecker [20 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 655.68ms Time] [2021-11-13 17:46:09,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-11-13 17:46:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 319. [2021-11-13 17:46:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 290 states have (on average 1.313793103448276) internal successors, (381), 315 states have internal predecessors, (381), 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) [2021-11-13 17:46:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 384 transitions. [2021-11-13 17:46:09,741 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 384 transitions. Word has length 46 [2021-11-13 17:46:09,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:46:09,742 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 384 transitions. [2021-11-13 17:46:09,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 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) [2021-11-13 17:46:09,747 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 384 transitions. [2021-11-13 17:46:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-13 17:46:09,748 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:46:09,748 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:46:09,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-13 17:46:09,749 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr57REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-13 17:46:09,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:46:09,750 INFO L85 PathProgramCache]: Analyzing trace with hash 292246064, now seen corresponding path program 1 times [2021-11-13 17:46:09,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:46:09,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204860442] [2021-11-13 17:46:09,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:46:09,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:46:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:46:09,775 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 17:46:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:46:09,844 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 17:46:09,844 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-13 17:46:09,846 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr57REQUIRES_VIOLATION (79 of 80 remaining) [2021-11-13 17:46:09,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION (78 of 80 remaining) [2021-11-13 17:46:09,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION (77 of 80 remaining) [2021-11-13 17:46:09,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2ASSERT_VIOLATIONMEMORY_LEAK (76 of 80 remaining) [2021-11-13 17:46:09,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION (75 of 80 remaining) [2021-11-13 17:46:09,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION (74 of 80 remaining) [2021-11-13 17:46:09,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION (73 of 80 remaining) [2021-11-13 17:46:09,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION (72 of 80 remaining) [2021-11-13 17:46:09,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION (71 of 80 remaining) [2021-11-13 17:46:09,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION (70 of 80 remaining) [2021-11-13 17:46:09,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION (69 of 80 remaining) [2021-11-13 17:46:09,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION (68 of 80 remaining) [2021-11-13 17:46:09,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION (67 of 80 remaining) [2021-11-13 17:46:09,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION (66 of 80 remaining) [2021-11-13 17:46:09,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION (65 of 80 remaining) [2021-11-13 17:46:09,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION (64 of 80 remaining) [2021-11-13 17:46:09,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION (63 of 80 remaining) [2021-11-13 17:46:09,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION (62 of 80 remaining) [2021-11-13 17:46:09,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION (61 of 80 remaining) [2021-11-13 17:46:09,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION (60 of 80 remaining) [2021-11-13 17:46:09,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19ASSERT_VIOLATIONMEMORY_LEAK (59 of 80 remaining) [2021-11-13 17:46:09,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION (58 of 80 remaining) [2021-11-13 17:46:09,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION (57 of 80 remaining) [2021-11-13 17:46:09,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION (56 of 80 remaining) [2021-11-13 17:46:09,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION (55 of 80 remaining) [2021-11-13 17:46:09,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION (54 of 80 remaining) [2021-11-13 17:46:09,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION (53 of 80 remaining) [2021-11-13 17:46:09,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26ASSERT_VIOLATIONMEMORY_LEAK (52 of 80 remaining) [2021-11-13 17:46:09,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27ASSERT_VIOLATIONMEMORY_LEAK (51 of 80 remaining) [2021-11-13 17:46:09,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION (50 of 80 remaining) [2021-11-13 17:46:09,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION (49 of 80 remaining) [2021-11-13 17:46:09,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION (48 of 80 remaining) [2021-11-13 17:46:09,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION (47 of 80 remaining) [2021-11-13 17:46:09,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION (46 of 80 remaining) [2021-11-13 17:46:09,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION (45 of 80 remaining) [2021-11-13 17:46:09,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION (44 of 80 remaining) [2021-11-13 17:46:09,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION (43 of 80 remaining) [2021-11-13 17:46:09,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION (42 of 80 remaining) [2021-11-13 17:46:09,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION (41 of 80 remaining) [2021-11-13 17:46:09,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION (40 of 80 remaining) [2021-11-13 17:46:09,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION (39 of 80 remaining) [2021-11-13 17:46:09,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION (38 of 80 remaining) [2021-11-13 17:46:09,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION (37 of 80 remaining) [2021-11-13 17:46:09,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION (36 of 80 remaining) [2021-11-13 17:46:09,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION (35 of 80 remaining) [2021-11-13 17:46:09,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44ASSERT_VIOLATIONMEMORY_LEAK (34 of 80 remaining) [2021-11-13 17:46:09,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45ASSERT_VIOLATIONMEMORY_LEAK (33 of 80 remaining) [2021-11-13 17:46:09,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION (32 of 80 remaining) [2021-11-13 17:46:09,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION (31 of 80 remaining) [2021-11-13 17:46:09,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48ASSERT_VIOLATIONMEMORY_LEAK (30 of 80 remaining) [2021-11-13 17:46:09,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION (29 of 80 remaining) [2021-11-13 17:46:09,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION (28 of 80 remaining) [2021-11-13 17:46:09,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51ASSERT_VIOLATIONMEMORY_LEAK (27 of 80 remaining) [2021-11-13 17:46:09,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION (26 of 80 remaining) [2021-11-13 17:46:09,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION (25 of 80 remaining) [2021-11-13 17:46:09,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54ASSERT_VIOLATIONMEMORY_LEAK (24 of 80 remaining) [2021-11-13 17:46:09,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION (23 of 80 remaining) [2021-11-13 17:46:09,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56REQUIRES_VIOLATION (22 of 80 remaining) [2021-11-13 17:46:09,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION (21 of 80 remaining) [2021-11-13 17:46:09,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59ASSERT_VIOLATIONMEMORY_LEAK (20 of 80 remaining) [2021-11-13 17:46:09,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION (19 of 80 remaining) [2021-11-13 17:46:09,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION (18 of 80 remaining) [2021-11-13 17:46:09,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION (17 of 80 remaining) [2021-11-13 17:46:09,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63REQUIRES_VIOLATION (16 of 80 remaining) [2021-11-13 17:46:09,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64ASSERT_VIOLATIONMEMORY_LEAK (15 of 80 remaining) [2021-11-13 17:46:09,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65REQUIRES_VIOLATION (14 of 80 remaining) [2021-11-13 17:46:09,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION (13 of 80 remaining) [2021-11-13 17:46:09,869 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67ASSERT_VIOLATIONMEMORY_LEAK (12 of 80 remaining) [2021-11-13 17:46:09,869 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68REQUIRES_VIOLATION (11 of 80 remaining) [2021-11-13 17:46:09,869 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69REQUIRES_VIOLATION (10 of 80 remaining) [2021-11-13 17:46:09,869 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70ASSERT_VIOLATIONMEMORY_LEAK (9 of 80 remaining) [2021-11-13 17:46:09,870 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71ASSERT_VIOLATIONMEMORY_FREE (8 of 80 remaining) [2021-11-13 17:46:09,870 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72ASSERT_VIOLATIONMEMORY_FREE (7 of 80 remaining) [2021-11-13 17:46:09,870 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73ASSERT_VIOLATIONMEMORY_FREE (6 of 80 remaining) [2021-11-13 17:46:09,870 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74REQUIRES_VIOLATION (5 of 80 remaining) [2021-11-13 17:46:09,871 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75REQUIRES_VIOLATION (4 of 80 remaining) [2021-11-13 17:46:09,871 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr76ASSERT_VIOLATIONMEMORY_FREE (3 of 80 remaining) [2021-11-13 17:46:09,871 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr77ASSERT_VIOLATIONMEMORY_FREE (2 of 80 remaining) [2021-11-13 17:46:09,871 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr78ASSERT_VIOLATIONMEMORY_FREE (1 of 80 remaining) [2021-11-13 17:46:09,872 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr79ENSURES_VIOLATIONMEMORY_LEAK (0 of 80 remaining) [2021-11-13 17:46:09,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-13 17:46:09,876 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:46:09,884 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-13 17:46:09,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 05:46:09 BoogieIcfgContainer [2021-11-13 17:46:09,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-13 17:46:09,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-13 17:46:09,962 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-13 17:46:09,962 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-13 17:46:09,963 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:45:37" (3/4) ... [2021-11-13 17:46:09,965 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-13 17:46:10,034 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/witness.graphml [2021-11-13 17:46:10,035 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-13 17:46:10,041 INFO L158 Benchmark]: Toolchain (without parser) took 33741.50ms. Allocated memory was 98.6MB in the beginning and 163.6MB in the end (delta: 65.0MB). Free memory was 76.7MB in the beginning and 69.2MB in the end (delta: 7.5MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. [2021-11-13 17:46:10,041 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 81.8MB. Free memory was 56.2MB in the beginning and 56.2MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 17:46:10,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.41ms. Allocated memory is still 98.6MB. Free memory was 76.6MB in the beginning and 57.4MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-11-13 17:46:10,044 INFO L158 Benchmark]: Boogie Preprocessor took 97.79ms. Allocated memory is still 98.6MB. Free memory was 57.4MB in the beginning and 53.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 17:46:10,045 INFO L158 Benchmark]: RCFGBuilder took 1072.23ms. Allocated memory is still 98.6MB. Free memory was 53.9MB in the beginning and 67.2MB in the end (delta: -13.3MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2021-11-13 17:46:10,046 INFO L158 Benchmark]: TraceAbstraction took 31965.49ms. Allocated memory was 98.6MB in the beginning and 163.6MB in the end (delta: 65.0MB). Free memory was 66.8MB in the beginning and 71.3MB in the end (delta: -4.5MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2021-11-13 17:46:10,047 INFO L158 Benchmark]: Witness Printer took 73.56ms. Allocated memory is still 163.6MB. Free memory was 71.3MB in the beginning and 69.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 17:46:10,048 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 81.8MB. Free memory was 56.2MB in the beginning and 56.2MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.41ms. Allocated memory is still 98.6MB. Free memory was 76.6MB in the beginning and 57.4MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.79ms. Allocated memory is still 98.6MB. Free memory was 57.4MB in the beginning and 53.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1072.23ms. Allocated memory is still 98.6MB. Free memory was 53.9MB in the beginning and 67.2MB in the end (delta: -13.3MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31965.49ms. Allocated memory was 98.6MB in the beginning and 163.6MB in the end (delta: 65.0MB). Free memory was 66.8MB in the beginning and 71.3MB in the end (delta: -4.5MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. * Witness Printer took 73.56ms. Allocated memory is still 163.6MB. Free memory was 71.3MB in the beginning and 69.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1040]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) VAL [list={-1:0}] [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) VAL [list={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->next = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->inner = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1028] EXPR end->inner VAL [end={-1:0}, end->inner={-2:0}, len=0, list={-1:0}] [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1036] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1038] inner = inner->inner [L1039] COND TRUE len == 1 VAL [end={-1:0}, inner={0:0}, len=1, list={-1:0}] [L1040] inner->inner - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 203 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 31.8s, OverallIterations: 38, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6852 SdHoareTripleChecker+Valid, 15474.09ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6852 mSDsluCounter, 20283 SdHoareTripleChecker+Invalid, 12716.93ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 101 IncrementalHoareTripleChecker+Unchecked, 15273 mSDsCounter, 474 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16163 IncrementalHoareTripleChecker+Invalid, 16738 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 474 mSolverCounterUnsat, 5010 mSDtfsCounter, 16163 mSolverCounterSat, 236.72ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 719 GetRequests, 339 SyntacticMatches, 3 SemanticMatches, 377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=319occurred in iteration=37, InterpolantAutomatonStates: 351, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 37 MinimizatonAttempts, 1401 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 1307 NumberOfCodeBlocks, 1307 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1343 ConstructedInterpolants, 20 QuantifiedInterpolants, 12689 SizeOfPredicates, 16 NumberOfNonLiveVariables, 583 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 43 InterpolantComputations, 34 PerfectInterpolantSequences, 16/26 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-13 17:46:10,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63eaa473-d468-4585-b80d-cc3b561a6de5/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)