./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 e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be --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 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:39:51,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:39:51,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:39:51,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:39:51,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:39:51,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:39:51,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:39:51,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:39:51,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:39:51,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:39:51,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:39:51,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:39:51,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:39:51,232 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:39:51,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:39:51,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:39:51,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:39:51,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:39:51,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:39:51,256 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:39:51,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:39:51,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:39:51,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:39:51,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:39:51,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:39:51,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:39:51,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:39:51,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:39:51,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:39:51,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:39:51,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:39:51,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:39:51,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:39:51,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:39:51,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:39:51,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:39:51,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:39:51,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:39:51,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:39:51,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:39:51,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:39:51,289 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-10-21 19:39:51,337 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:39:51,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:39:51,338 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:39:51,338 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:39:51,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:39:51,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:39:51,347 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:39:51,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:39:51,347 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:39:51,347 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-21 19:39:51,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:39:51,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:39:51,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:39:51,349 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-21 19:39:51,349 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-21 19:39:51,349 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-21 19:39:51,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 19:39:51,350 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-21 19:39:51,350 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:39:51,350 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:39:51,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:39:51,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:39:51,351 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 19:39:51,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:39:51,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:39:51,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 19:39:51,352 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:39:51,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 19:39:51,352 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:39:51,354 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_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/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_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be 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-10-21 19:39:51,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:39:51,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:39:51,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:39:51,625 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:39:51,626 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:39:51,627 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/forester-heap/sll-01-2.i [2021-10-21 19:39:51,685 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/data/fea6c9d54/90168f81e7604169a48ff985357027ba/FLAGbe561e441 [2021-10-21 19:39:52,241 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:39:52,242 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i [2021-10-21 19:39:52,264 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/data/fea6c9d54/90168f81e7604169a48ff985357027ba/FLAGbe561e441 [2021-10-21 19:39:52,566 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/data/fea6c9d54/90168f81e7604169a48ff985357027ba [2021-10-21 19:39:52,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:39:52,570 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-21 19:39:52,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:39:52,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:39:52,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:39:52,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:39:52" (1/1) ... [2021-10-21 19:39:52,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b874ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:39:52, skipping insertion in model container [2021-10-21 19:39:52,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:39:52" (1/1) ... [2021-10-21 19:39:52,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:39:52,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:39:52,984 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-10-21 19:39:53,002 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-10-21 19:39:53,007 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-10-21 19:39:53,008 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-10-21 19:39:53,012 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-10-21 19:39:53,014 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-10-21 19:39:53,018 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-10-21 19:39:53,022 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-10-21 19:39:53,023 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-10-21 19:39:53,026 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-10-21 19:39:53,028 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-10-21 19:39:53,029 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-10-21 19:39:53,030 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-10-21 19:39:53,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:39:53,057 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:39:53,109 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-10-21 19:39:53,113 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-10-21 19:39:53,115 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-10-21 19:39:53,116 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-10-21 19:39:53,118 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-10-21 19:39:53,119 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-10-21 19:39:53,129 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-10-21 19:39:53,130 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-10-21 19:39:53,131 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-10-21 19:39:53,134 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-10-21 19:39:53,138 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-10-21 19:39:53,139 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-10-21 19:39:53,140 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_b15edab2-598b-4f9e-ba82-d076969a8f88/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-10-21 19:39:53,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:39:53,177 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:39:53,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:39:53 WrapperNode [2021-10-21 19:39:53,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:39:53,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:39:53,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:39:53,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:39:53,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:39:53" (1/1) ... [2021-10-21 19:39:53,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:39:53" (1/1) ... [2021-10-21 19:39:53,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:39:53" (1/1) ... [2021-10-21 19:39:53,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:39:53" (1/1) ... [2021-10-21 19:39:53,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:39:53" (1/1) ... [2021-10-21 19:39:53,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:39:53" (1/1) ... [2021-10-21 19:39:53,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:39:53" (1/1) ... [2021-10-21 19:39:53,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:39:53,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:39:53,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:39:53,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:39:53,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:39:53" (1/1) ... [2021-10-21 19:39:53,316 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:39:53,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:39:53,338 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 19:39:53,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 19:39:53,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-10-21 19:39:53,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:39:53,391 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-10-21 19:39:53,391 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-10-21 19:39:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-10-21 19:39:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-10-21 19:39:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-10-21 19:39:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-10-21 19:39:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-10-21 19:39:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-10-21 19:39:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-10-21 19:39:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-10-21 19:39:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-10-21 19:39:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-10-21 19:39:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-10-21 19:39:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-10-21 19:39:53,394 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-10-21 19:39:53,394 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-10-21 19:39:53,394 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-10-21 19:39:53,394 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-10-21 19:39:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-10-21 19:39:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-10-21 19:39:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-10-21 19:39:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-10-21 19:39:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-10-21 19:39:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-10-21 19:39:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-10-21 19:39:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-10-21 19:39:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-10-21 19:39:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-10-21 19:39:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-10-21 19:39:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-10-21 19:39:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-10-21 19:39:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-10-21 19:39:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-10-21 19:39:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-10-21 19:39:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-10-21 19:39:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-10-21 19:39:53,400 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-10-21 19:39:53,400 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-10-21 19:39:53,400 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-10-21 19:39:53,400 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-10-21 19:39:53,402 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-10-21 19:39:53,402 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-10-21 19:39:53,402 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-10-21 19:39:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-10-21 19:39:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-10-21 19:39:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-10-21 19:39:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-10-21 19:39:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-10-21 19:39:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-10-21 19:39:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-10-21 19:39:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-10-21 19:39:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-10-21 19:39:53,405 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-10-21 19:39:53,405 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-10-21 19:39:53,405 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-10-21 19:39:53,405 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-10-21 19:39:53,405 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-10-21 19:39:53,405 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-10-21 19:39:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-10-21 19:39:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-10-21 19:39:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-10-21 19:39:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-10-21 19:39:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-10-21 19:39:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-10-21 19:39:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-10-21 19:39:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-10-21 19:39:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-10-21 19:39:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-10-21 19:39:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-10-21 19:39:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-10-21 19:39:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-10-21 19:39:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-10-21 19:39:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-10-21 19:39:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-10-21 19:39:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-10-21 19:39:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-10-21 19:39:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-10-21 19:39:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-10-21 19:39:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-10-21 19:39:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-10-21 19:39:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-10-21 19:39:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-10-21 19:39:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-10-21 19:39:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-10-21 19:39:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-10-21 19:39:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-10-21 19:39:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-10-21 19:39:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-10-21 19:39:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-10-21 19:39:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-10-21 19:39:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-10-21 19:39:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-10-21 19:39:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-10-21 19:39:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-10-21 19:39:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-10-21 19:39:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-10-21 19:39:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-10-21 19:39:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-10-21 19:39:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-10-21 19:39:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-10-21 19:39:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-10-21 19:39:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-10-21 19:39:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-10-21 19:39:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-10-21 19:39:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-10-21 19:39:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-10-21 19:39:53,414 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-10-21 19:39:53,414 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-10-21 19:39:53,414 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-10-21 19:39:53,414 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-10-21 19:39:53,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:39:53,414 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-10-21 19:39:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-21 19:39:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-21 19:39:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-21 19:39:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-21 19:39:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-10-21 19:39:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 19:39:53,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:39:53,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-21 19:39:53,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-21 19:39:54,211 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:39:54,212 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-10-21 19:39:54,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:39:54 BoogieIcfgContainer [2021-10-21 19:39:54,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:39:54,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 19:39:54,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 19:39:54,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 19:39:54,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 07:39:52" (1/3) ... [2021-10-21 19:39:54,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db05413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:39:54, skipping insertion in model container [2021-10-21 19:39:54,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:39:53" (2/3) ... [2021-10-21 19:39:54,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db05413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:39:54, skipping insertion in model container [2021-10-21 19:39:54,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:39:54" (3/3) ... [2021-10-21 19:39:54,223 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2021-10-21 19:39:54,229 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 19:39:54,229 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2021-10-21 19:39:54,274 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 19:39:54,285 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-10-21 19:39:54,286 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2021-10-21 19:39:54,304 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-10-21 19:39:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-21 19:39:54,311 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:54,312 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:54,312 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:39:54,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:54,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1164341321, now seen corresponding path program 1 times [2021-10-21 19:39:54,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:54,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136850323] [2021-10-21 19:39:54,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:54,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:54,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:54,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:54,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:54,561 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136850323] [2021-10-21 19:39:54,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136850323] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:54,563 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:54,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:39:54,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434040953] [2021-10-21 19:39:54,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:39:54,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:54,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:39:54,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:39:54,597 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-10-21 19:39:55,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:55,071 INFO L93 Difference]: Finished difference Result 201 states and 212 transitions. [2021-10-21 19:39:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:39:55,073 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-10-21 19:39:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:55,086 INFO L225 Difference]: With dead ends: 201 [2021-10-21 19:39:55,087 INFO L226 Difference]: Without dead ends: 197 [2021-10-21 19:39:55,088 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:39:55,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-10-21 19:39:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2021-10-21 19:39:55,135 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-10-21 19:39:55,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2021-10-21 19:39:55,140 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 7 [2021-10-21 19:39:55,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:55,140 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2021-10-21 19:39:55,141 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-10-21 19:39:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2021-10-21 19:39:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-21 19:39:55,141 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:55,141 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:55,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 19:39:55,142 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:39:55,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:55,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1164341322, now seen corresponding path program 1 times [2021-10-21 19:39:55,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:55,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47635173] [2021-10-21 19:39:55,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:55,145 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:55,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:55,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47635173] [2021-10-21 19:39:55,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47635173] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:55,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:55,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:39:55,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730001467] [2021-10-21 19:39:55,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:39:55,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:55,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:39:55,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:39:55,278 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-10-21 19:39:55,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:55,610 INFO L93 Difference]: Finished difference Result 222 states and 234 transitions. [2021-10-21 19:39:55,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:39:55,611 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-10-21 19:39:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:55,613 INFO L225 Difference]: With dead ends: 222 [2021-10-21 19:39:55,613 INFO L226 Difference]: Without dead ends: 222 [2021-10-21 19:39:55,614 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:39:55,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-21 19:39:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2021-10-21 19:39:55,626 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-10-21 19:39:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2021-10-21 19:39:55,629 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 7 [2021-10-21 19:39:55,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:55,629 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2021-10-21 19:39:55,629 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-10-21 19:39:55,629 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2021-10-21 19:39:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-21 19:39:55,630 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:55,630 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:55,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 19:39:55,631 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:39:55,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:55,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2054455159, now seen corresponding path program 1 times [2021-10-21 19:39:55,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:55,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204199822] [2021-10-21 19:39:55,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:55,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:55,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:55,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204199822] [2021-10-21 19:39:55,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204199822] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:55,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:55,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:39:55,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660073155] [2021-10-21 19:39:55,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:39:55,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:55,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:39:55,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:39:55,728 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-10-21 19:39:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:56,000 INFO L93 Difference]: Finished difference Result 217 states and 229 transitions. [2021-10-21 19:39:56,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:39:56,001 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-10-21 19:39:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:56,004 INFO L225 Difference]: With dead ends: 217 [2021-10-21 19:39:56,004 INFO L226 Difference]: Without dead ends: 217 [2021-10-21 19:39:56,004 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:39:56,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-10-21 19:39:56,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2021-10-21 19:39:56,020 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-10-21 19:39:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2021-10-21 19:39:56,023 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 9 [2021-10-21 19:39:56,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:56,023 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2021-10-21 19:39:56,023 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-10-21 19:39:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2021-10-21 19:39:56,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-21 19:39:56,024 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:56,024 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:56,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 19:39:56,025 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:39:56,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:56,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1492111941, now seen corresponding path program 1 times [2021-10-21 19:39:56,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:56,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416135209] [2021-10-21 19:39:56,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:56,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:56,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:56,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416135209] [2021-10-21 19:39:56,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416135209] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:56,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:56,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:39:56,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323476241] [2021-10-21 19:39:56,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:39:56,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:56,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:39:56,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:39:56,179 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-10-21 19:39:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:56,509 INFO L93 Difference]: Finished difference Result 199 states and 222 transitions. [2021-10-21 19:39:56,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:39:56,509 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-10-21 19:39:56,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:56,511 INFO L225 Difference]: With dead ends: 199 [2021-10-21 19:39:56,511 INFO L226 Difference]: Without dead ends: 199 [2021-10-21 19:39:56,511 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 35.6ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:39:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-21 19:39:56,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-10-21 19:39:56,517 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-10-21 19:39:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2021-10-21 19:39:56,531 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 15 [2021-10-21 19:39:56,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:56,532 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2021-10-21 19:39:56,532 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-10-21 19:39:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2021-10-21 19:39:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-21 19:39:56,533 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:56,533 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:56,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 19:39:56,533 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:39:56,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:56,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1492111940, now seen corresponding path program 1 times [2021-10-21 19:39:56,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:56,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368722801] [2021-10-21 19:39:56,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:56,537 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:56,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:56,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368722801] [2021-10-21 19:39:56,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368722801] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:56,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:56,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:39:56,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375324874] [2021-10-21 19:39:56,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:39:56,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:56,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:39:56,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:39:56,689 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-10-21 19:39:57,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:57,029 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2021-10-21 19:39:57,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:39:57,035 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-10-21 19:39:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:57,036 INFO L225 Difference]: With dead ends: 198 [2021-10-21 19:39:57,036 INFO L226 Difference]: Without dead ends: 198 [2021-10-21 19:39:57,036 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 59.0ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:39:57,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-21 19:39:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-10-21 19:39:57,040 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-10-21 19:39:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2021-10-21 19:39:57,042 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 15 [2021-10-21 19:39:57,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:57,042 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2021-10-21 19:39:57,043 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-10-21 19:39:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2021-10-21 19:39:57,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-21 19:39:57,044 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:57,044 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:57,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 19:39:57,044 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr19ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:39:57,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:57,045 INFO L82 PathProgramCache]: Analyzing trace with hash 331044621, now seen corresponding path program 1 times [2021-10-21 19:39:57,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:57,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440026333] [2021-10-21 19:39:57,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:57,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:57,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:57,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:57,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:57,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440026333] [2021-10-21 19:39:57,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440026333] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:57,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:57,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:39:57,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438548295] [2021-10-21 19:39:57,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:39:57,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:57,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:39:57,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:39:57,128 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-10-21 19:39:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:57,340 INFO L93 Difference]: Finished difference Result 199 states and 222 transitions. [2021-10-21 19:39:57,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:39:57,341 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-10-21 19:39:57,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:57,342 INFO L225 Difference]: With dead ends: 199 [2021-10-21 19:39:57,342 INFO L226 Difference]: Without dead ends: 199 [2021-10-21 19:39:57,343 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:39:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-21 19:39:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-10-21 19:39:57,347 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-10-21 19:39:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2021-10-21 19:39:57,349 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 17 [2021-10-21 19:39:57,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:57,349 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2021-10-21 19:39:57,350 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-10-21 19:39:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2021-10-21 19:39:57,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-21 19:39:57,351 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:57,351 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:57,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 19:39:57,352 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:39:57,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:57,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1404699164, now seen corresponding path program 1 times [2021-10-21 19:39:57,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:57,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570821746] [2021-10-21 19:39:57,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:57,353 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:57,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:57,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:57,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:57,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570821746] [2021-10-21 19:39:57,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570821746] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:57,520 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:57,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:39:57,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521754071] [2021-10-21 19:39:57,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:39:57,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:57,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:39:57,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:39:57,522 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-10-21 19:39:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:58,012 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2021-10-21 19:39:58,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:39:58,012 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-10-21 19:39:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:58,014 INFO L225 Difference]: With dead ends: 199 [2021-10-21 19:39:58,014 INFO L226 Difference]: Without dead ends: 199 [2021-10-21 19:39:58,014 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 117.2ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:39:58,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-21 19:39:58,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2021-10-21 19:39:58,018 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-10-21 19:39:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2021-10-21 19:39:58,019 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 18 [2021-10-21 19:39:58,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:58,020 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2021-10-21 19:39:58,020 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-10-21 19:39:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2021-10-21 19:39:58,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-21 19:39:58,021 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:58,021 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:58,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 19:39:58,021 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:39:58,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:58,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1404699165, now seen corresponding path program 1 times [2021-10-21 19:39:58,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:58,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438179527] [2021-10-21 19:39:58,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:58,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:58,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:58,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438179527] [2021-10-21 19:39:58,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438179527] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:58,181 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:58,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:39:58,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566325542] [2021-10-21 19:39:58,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:39:58,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:58,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:39:58,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:39:58,183 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-10-21 19:39:58,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:58,743 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2021-10-21 19:39:58,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:39:58,744 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-10-21 19:39:58,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:58,745 INFO L225 Difference]: With dead ends: 198 [2021-10-21 19:39:58,745 INFO L226 Difference]: Without dead ends: 198 [2021-10-21 19:39:58,746 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 152.8ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:39:58,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-21 19:39:58,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2021-10-21 19:39:58,750 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-10-21 19:39:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2021-10-21 19:39:58,751 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 18 [2021-10-21 19:39:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:58,752 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2021-10-21 19:39:58,752 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-10-21 19:39:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2021-10-21 19:39:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-21 19:39:58,753 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:58,753 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:58,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 19:39:58,754 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr19ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:39:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:58,754 INFO L82 PathProgramCache]: Analyzing trace with hash 307937042, now seen corresponding path program 1 times [2021-10-21 19:39:58,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:58,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116931479] [2021-10-21 19:39:58,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:58,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:58,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:58,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116931479] [2021-10-21 19:39:58,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116931479] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:58,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:58,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:39:58,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816962042] [2021-10-21 19:39:58,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:39:58,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:58,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:39:58,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:39:58,863 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-10-21 19:39:59,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:59,282 INFO L93 Difference]: Finished difference Result 289 states and 319 transitions. [2021-10-21 19:39:59,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 19:39:59,283 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-10-21 19:39:59,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:59,285 INFO L225 Difference]: With dead ends: 289 [2021-10-21 19:39:59,285 INFO L226 Difference]: Without dead ends: 289 [2021-10-21 19:39:59,285 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 123.3ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:39:59,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-10-21 19:39:59,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 194. [2021-10-21 19:39:59,291 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-10-21 19:39:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2021-10-21 19:39:59,292 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 19 [2021-10-21 19:39:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:59,292 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2021-10-21 19:39:59,294 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-10-21 19:39:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2021-10-21 19:39:59,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-21 19:39:59,296 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:59,297 INFO L512 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-10-21 19:39:59,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 19:39:59,297 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:39:59,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:59,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1873843689, now seen corresponding path program 1 times [2021-10-21 19:39:59,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:59,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118016306] [2021-10-21 19:39:59,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:59,302 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:59,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:59,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:59,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118016306] [2021-10-21 19:39:59,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118016306] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:59,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:59,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:39:59,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174969155] [2021-10-21 19:39:59,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:39:59,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:59,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:39:59,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:39:59,395 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-10-21 19:39:59,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:59,716 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2021-10-21 19:39:59,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:39:59,717 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-10-21 19:39:59,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:59,719 INFO L225 Difference]: With dead ends: 290 [2021-10-21 19:39:59,719 INFO L226 Difference]: Without dead ends: 290 [2021-10-21 19:39:59,719 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.8ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:39:59,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-10-21 19:39:59,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 197. [2021-10-21 19:39:59,726 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-10-21 19:39:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2021-10-21 19:39:59,727 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 21 [2021-10-21 19:39:59,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:59,727 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2021-10-21 19:39:59,728 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-10-21 19:39:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2021-10-21 19:39:59,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-21 19:39:59,729 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:59,729 INFO L512 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-10-21 19:39:59,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 19:39:59,729 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:39:59,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:59,730 INFO L82 PathProgramCache]: Analyzing trace with hash -515815524, now seen corresponding path program 1 times [2021-10-21 19:39:59,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:59,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223598667] [2021-10-21 19:39:59,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:59,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:59,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:59,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:59,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223598667] [2021-10-21 19:39:59,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223598667] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:59,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:59,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:39:59,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350835371] [2021-10-21 19:39:59,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:39:59,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:59,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:39:59,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:39:59,798 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-10-21 19:40:00,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:00,076 INFO L93 Difference]: Finished difference Result 193 states and 214 transitions. [2021-10-21 19:40:00,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:40:00,077 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-10-21 19:40:00,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:00,078 INFO L225 Difference]: With dead ends: 193 [2021-10-21 19:40:00,078 INFO L226 Difference]: Without dead ends: 193 [2021-10-21 19:40:00,079 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:40:00,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-10-21 19:40:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2021-10-21 19:40:00,083 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-10-21 19:40:00,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 211 transitions. [2021-10-21 19:40:00,084 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 211 transitions. Word has length 23 [2021-10-21 19:40:00,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:00,084 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 211 transitions. [2021-10-21 19:40:00,085 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-10-21 19:40:00,085 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 211 transitions. [2021-10-21 19:40:00,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-21 19:40:00,085 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:00,085 INFO L512 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-10-21 19:40:00,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-21 19:40:00,086 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr21REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:00,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:00,086 INFO L82 PathProgramCache]: Analyzing trace with hash -515815523, now seen corresponding path program 1 times [2021-10-21 19:40:00,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:00,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852307592] [2021-10-21 19:40:00,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:00,087 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:00,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:00,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852307592] [2021-10-21 19:40:00,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852307592] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:00,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:00,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:40:00,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143992752] [2021-10-21 19:40:00,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:40:00,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:00,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:40:00,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:40:00,185 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-10-21 19:40:00,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:00,584 INFO L93 Difference]: Finished difference Result 249 states and 266 transitions. [2021-10-21 19:40:00,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:40:00,585 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-10-21 19:40:00,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:00,586 INFO L225 Difference]: With dead ends: 249 [2021-10-21 19:40:00,586 INFO L226 Difference]: Without dead ends: 249 [2021-10-21 19:40:00,587 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 51.7ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:40:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-10-21 19:40:00,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 212. [2021-10-21 19:40:00,591 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-10-21 19:40:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 250 transitions. [2021-10-21 19:40:00,593 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 250 transitions. Word has length 23 [2021-10-21 19:40:00,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:00,593 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 250 transitions. [2021-10-21 19:40:00,593 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-10-21 19:40:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 250 transitions. [2021-10-21 19:40:00,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-21 19:40:00,594 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:00,594 INFO L512 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-10-21 19:40:00,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-21 19:40:00,595 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr45ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:00,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:00,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1777429398, now seen corresponding path program 1 times [2021-10-21 19:40:00,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:00,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170925277] [2021-10-21 19:40:00,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:00,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:00,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:00,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170925277] [2021-10-21 19:40:00,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170925277] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:00,646 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:00,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:40:00,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99551166] [2021-10-21 19:40:00,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:40:00,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:00,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:40:00,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:40:00,648 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-10-21 19:40:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:00,891 INFO L93 Difference]: Finished difference Result 244 states and 260 transitions. [2021-10-21 19:40:00,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:40:00,891 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-10-21 19:40:00,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:00,893 INFO L225 Difference]: With dead ends: 244 [2021-10-21 19:40:00,893 INFO L226 Difference]: Without dead ends: 244 [2021-10-21 19:40:00,893 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:40:00,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-10-21 19:40:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 210. [2021-10-21 19:40:00,898 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-10-21 19:40:00,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 247 transitions. [2021-10-21 19:40:00,899 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 247 transitions. Word has length 25 [2021-10-21 19:40:00,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:00,900 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 247 transitions. [2021-10-21 19:40:00,900 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-10-21 19:40:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 247 transitions. [2021-10-21 19:40:00,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-21 19:40:00,901 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:00,901 INFO L512 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-10-21 19:40:00,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-21 19:40:00,901 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:00,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:00,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1241440350, now seen corresponding path program 1 times [2021-10-21 19:40:00,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:00,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289929715] [2021-10-21 19:40:00,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:00,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:00,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:00,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289929715] [2021-10-21 19:40:00,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289929715] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:00,979 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:00,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:40:00,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309105402] [2021-10-21 19:40:00,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:40:00,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:00,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:40:00,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:40:00,981 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-10-21 19:40:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:01,324 INFO L93 Difference]: Finished difference Result 210 states and 247 transitions. [2021-10-21 19:40:01,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:40:01,325 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-10-21 19:40:01,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:01,326 INFO L225 Difference]: With dead ends: 210 [2021-10-21 19:40:01,327 INFO L226 Difference]: Without dead ends: 210 [2021-10-21 19:40:01,327 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 58.9ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:40:01,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-21 19:40:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2021-10-21 19:40:01,339 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-10-21 19:40:01,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 246 transitions. [2021-10-21 19:40:01,341 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 246 transitions. Word has length 27 [2021-10-21 19:40:01,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:01,341 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 246 transitions. [2021-10-21 19:40:01,341 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-10-21 19:40:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 246 transitions. [2021-10-21 19:40:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-21 19:40:01,342 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:01,343 INFO L512 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-10-21 19:40:01,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-21 19:40:01,343 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:01,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:01,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1241440351, now seen corresponding path program 1 times [2021-10-21 19:40:01,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:01,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849720326] [2021-10-21 19:40:01,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:01,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:01,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:01,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849720326] [2021-10-21 19:40:01,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849720326] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:01,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:01,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:40:01,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438701016] [2021-10-21 19:40:01,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:40:01,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:01,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:40:01,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:40:01,439 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-10-21 19:40:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:01,803 INFO L93 Difference]: Finished difference Result 202 states and 239 transitions. [2021-10-21 19:40:01,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:40:01,804 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-10-21 19:40:01,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:01,806 INFO L225 Difference]: With dead ends: 202 [2021-10-21 19:40:01,806 INFO L226 Difference]: Without dead ends: 202 [2021-10-21 19:40:01,806 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 92.6ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:40:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-21 19:40:01,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 195. [2021-10-21 19:40:01,810 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-10-21 19:40:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2021-10-21 19:40:01,812 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 27 [2021-10-21 19:40:01,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:01,812 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2021-10-21 19:40:01,812 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-10-21 19:40:01,812 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2021-10-21 19:40:01,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-21 19:40:01,813 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:01,814 INFO L512 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-10-21 19:40:01,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-21 19:40:01,814 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr26ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:01,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:01,814 INFO L82 PathProgramCache]: Analyzing trace with hash -976729154, now seen corresponding path program 1 times [2021-10-21 19:40:01,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:01,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984259165] [2021-10-21 19:40:01,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:01,815 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,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-10-21 19:40:01,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:01,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984259165] [2021-10-21 19:40:01,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984259165] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:01,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:01,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:40:01,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915551499] [2021-10-21 19:40:01,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:40:01,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:01,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:40:01,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:40:01,884 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-10-21 19:40:02,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:02,167 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2021-10-21 19:40:02,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:40:02,168 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-10-21 19:40:02,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:02,169 INFO L225 Difference]: With dead ends: 198 [2021-10-21 19:40:02,170 INFO L226 Difference]: Without dead ends: 198 [2021-10-21 19:40:02,170 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 64.1ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:40:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-21 19:40:02,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2021-10-21 19:40:02,174 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-10-21 19:40:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2021-10-21 19:40:02,175 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 29 [2021-10-21 19:40:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:02,175 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2021-10-21 19:40:02,177 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-10-21 19:40:02,177 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2021-10-21 19:40:02,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-21 19:40:02,180 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:02,180 INFO L512 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-10-21 19:40:02,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-21 19:40:02,181 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr59ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:02,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:02,182 INFO L82 PathProgramCache]: Analyzing trace with hash 90529238, now seen corresponding path program 1 times [2021-10-21 19:40:02,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:02,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146379546] [2021-10-21 19:40:02,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:02,183 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:02,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:02,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146379546] [2021-10-21 19:40:02,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146379546] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:02,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:02,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:40:02,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479377758] [2021-10-21 19:40:02,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:40:02,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:02,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:40:02,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:40:02,243 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-10-21 19:40:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:02,417 INFO L93 Difference]: Finished difference Result 264 states and 315 transitions. [2021-10-21 19:40:02,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:40:02,417 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-10-21 19:40:02,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:02,419 INFO L225 Difference]: With dead ends: 264 [2021-10-21 19:40:02,419 INFO L226 Difference]: Without dead ends: 264 [2021-10-21 19:40:02,420 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:40:02,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-21 19:40:02,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 197. [2021-10-21 19:40:02,425 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-10-21 19:40:02,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 235 transitions. [2021-10-21 19:40:02,426 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 235 transitions. Word has length 31 [2021-10-21 19:40:02,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:02,428 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 235 transitions. [2021-10-21 19:40:02,428 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-10-21 19:40:02,428 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 235 transitions. [2021-10-21 19:40:02,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-21 19:40:02,429 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:02,429 INFO L512 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-10-21 19:40:02,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-21 19:40:02,430 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr48ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:02,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:02,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1488582203, now seen corresponding path program 1 times [2021-10-21 19:40:02,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:02,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980915951] [2021-10-21 19:40:02,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:02,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:02,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:02,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980915951] [2021-10-21 19:40:02,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980915951] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:02,487 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:02,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:40:02,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769520182] [2021-10-21 19:40:02,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:40:02,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:02,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:40:02,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:40:02,490 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-10-21 19:40:02,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:02,669 INFO L93 Difference]: Finished difference Result 195 states and 232 transitions. [2021-10-21 19:40:02,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:40:02,670 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-10-21 19:40:02,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:02,672 INFO L225 Difference]: With dead ends: 195 [2021-10-21 19:40:02,672 INFO L226 Difference]: Without dead ends: 195 [2021-10-21 19:40:02,673 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:40:02,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-10-21 19:40:02,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-10-21 19:40:02,677 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-10-21 19:40:02,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2021-10-21 19:40:02,679 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 32 [2021-10-21 19:40:02,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:02,679 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2021-10-21 19:40:02,679 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-10-21 19:40:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2021-10-21 19:40:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-21 19:40:02,681 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:02,681 INFO L512 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-10-21 19:40:02,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-21 19:40:02,682 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:02,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:02,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1098596299, now seen corresponding path program 1 times [2021-10-21 19:40:02,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:02,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157464640] [2021-10-21 19:40:02,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:02,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:02,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:02,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157464640] [2021-10-21 19:40:02,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157464640] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:02,848 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:02,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:40:02,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719527466] [2021-10-21 19:40:02,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:40:02,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:02,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:40:02,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:40:02,851 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-10-21 19:40:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:03,455 INFO L93 Difference]: Finished difference Result 325 states and 363 transitions. [2021-10-21 19:40:03,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-21 19:40:03,455 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-10-21 19:40:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:03,457 INFO L225 Difference]: With dead ends: 325 [2021-10-21 19:40:03,457 INFO L226 Difference]: Without dead ends: 325 [2021-10-21 19:40:03,458 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 186.8ms TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2021-10-21 19:40:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-10-21 19:40:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 228. [2021-10-21 19:40:03,463 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-10-21 19:40:03,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 270 transitions. [2021-10-21 19:40:03,465 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 270 transitions. Word has length 33 [2021-10-21 19:40:03,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:03,465 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 270 transitions. [2021-10-21 19:40:03,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-10-21 19:40:03,465 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 270 transitions. [2021-10-21 19:40:03,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-21 19:40:03,466 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:03,466 INFO L512 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-10-21 19:40:03,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-21 19:40:03,467 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr46REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:03,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:03,467 INFO L82 PathProgramCache]: Analyzing trace with hash -49345090, now seen corresponding path program 1 times [2021-10-21 19:40:03,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:03,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419679255] [2021-10-21 19:40:03,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:03,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:03,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:03,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:03,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419679255] [2021-10-21 19:40:03,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419679255] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:40:03,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187978495] [2021-10-21 19:40:03,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:03,578 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:40:03,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:40:03,583 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:40:03,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-21 19:40:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:03,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-21 19:40:03,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:40:03,873 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-10-21 19:40:03,879 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-10-21 19:40:04,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:40:04,010 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-10-21 19:40:04,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:40:04,019 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-10-21 19:40:04,456 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-10-21 19:40:04,456 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-10-21 19:40:04,468 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-10-21 19:40:04,469 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-10-21 19:40:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:04,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187978495] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:40:04,486 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:40:04,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2021-10-21 19:40:04,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914814488] [2021-10-21 19:40:04,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 19:40:04,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:04,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 19:40:04,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:40:04,488 INFO L87 Difference]: Start difference. First operand 228 states and 270 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 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-10-21 19:40:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:05,107 INFO L93 Difference]: Finished difference Result 381 states and 422 transitions. [2021-10-21 19:40:05,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-21 19:40:05,107 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 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-10-21 19:40:05,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:05,110 INFO L225 Difference]: With dead ends: 381 [2021-10-21 19:40:05,110 INFO L226 Difference]: Without dead ends: 381 [2021-10-21 19:40:05,110 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 233.5ms TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2021-10-21 19:40:05,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-10-21 19:40:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 266. [2021-10-21 19:40:05,117 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-10-21 19:40:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2021-10-21 19:40:05,118 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 35 [2021-10-21 19:40:05,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:05,119 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2021-10-21 19:40:05,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 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-10-21 19:40:05,119 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2021-10-21 19:40:05,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-21 19:40:05,120 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:05,121 INFO L512 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-10-21 19:40:05,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-21 19:40:05,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:40:05,340 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:05,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:05,340 INFO L82 PathProgramCache]: Analyzing trace with hash -824345932, now seen corresponding path program 1 times [2021-10-21 19:40:05,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:05,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047117842] [2021-10-21 19:40:05,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:05,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:05,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:05,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:05,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:05,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047117842] [2021-10-21 19:40:05,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047117842] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:05,409 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:05,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:40:05,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672868075] [2021-10-21 19:40:05,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:40:05,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:05,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:40:05,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:40:05,414 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-10-21 19:40:05,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:05,675 INFO L93 Difference]: Finished difference Result 265 states and 323 transitions. [2021-10-21 19:40:05,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:40:05,676 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-10-21 19:40:05,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:05,678 INFO L225 Difference]: With dead ends: 265 [2021-10-21 19:40:05,678 INFO L226 Difference]: Without dead ends: 265 [2021-10-21 19:40:05,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 33.1ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:40:05,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-10-21 19:40:05,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2021-10-21 19:40:05,684 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-10-21 19:40:05,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 323 transitions. [2021-10-21 19:40:05,685 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 323 transitions. Word has length 37 [2021-10-21 19:40:05,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:05,686 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 323 transitions. [2021-10-21 19:40:05,686 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-10-21 19:40:05,686 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 323 transitions. [2021-10-21 19:40:05,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-21 19:40:05,687 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:05,687 INFO L512 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-10-21 19:40:05,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-21 19:40:05,687 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:05,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:05,688 INFO L82 PathProgramCache]: Analyzing trace with hash -824345931, now seen corresponding path program 1 times [2021-10-21 19:40:05,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:05,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835006406] [2021-10-21 19:40:05,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:05,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:05,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:05,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:05,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835006406] [2021-10-21 19:40:05,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835006406] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:05,765 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:05,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:40:05,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277666108] [2021-10-21 19:40:05,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:40:05,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:05,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:40:05,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:40:05,767 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-10-21 19:40:06,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:06,040 INFO L93 Difference]: Finished difference Result 264 states and 322 transitions. [2021-10-21 19:40:06,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:40:06,043 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-10-21 19:40:06,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:06,045 INFO L225 Difference]: With dead ends: 264 [2021-10-21 19:40:06,045 INFO L226 Difference]: Without dead ends: 264 [2021-10-21 19:40:06,045 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 45.7ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:40:06,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-21 19:40:06,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2021-10-21 19:40:06,050 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-10-21 19:40:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 322 transitions. [2021-10-21 19:40:06,052 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 322 transitions. Word has length 37 [2021-10-21 19:40:06,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:06,052 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 322 transitions. [2021-10-21 19:40:06,053 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-10-21 19:40:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 322 transitions. [2021-10-21 19:40:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-21 19:40:06,055 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:06,055 INFO L512 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-10-21 19:40:06,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-21 19:40:06,056 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:06,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash 385741532, now seen corresponding path program 1 times [2021-10-21 19:40:06,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:06,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575950922] [2021-10-21 19:40:06,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:06,057 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:06,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:06,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:06,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575950922] [2021-10-21 19:40:06,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575950922] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:06,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:06,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-21 19:40:06,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429775587] [2021-10-21 19:40:06,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:40:06,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:06,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:40:06,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:40:06,265 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-10-21 19:40:07,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:07,007 INFO L93 Difference]: Finished difference Result 374 states and 421 transitions. [2021-10-21 19:40:07,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-21 19:40:07,007 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-10-21 19:40:07,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:07,010 INFO L225 Difference]: With dead ends: 374 [2021-10-21 19:40:07,010 INFO L226 Difference]: Without dead ends: 374 [2021-10-21 19:40:07,010 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 205.2ms TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-10-21 19:40:07,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-10-21 19:40:07,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 265. [2021-10-21 19:40:07,016 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-10-21 19:40:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 320 transitions. [2021-10-21 19:40:07,018 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 320 transitions. Word has length 38 [2021-10-21 19:40:07,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:07,018 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 320 transitions. [2021-10-21 19:40:07,018 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-10-21 19:40:07,018 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 320 transitions. [2021-10-21 19:40:07,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-21 19:40:07,019 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:07,019 INFO L512 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-10-21 19:40:07,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-21 19:40:07,019 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr50REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:07,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:07,020 INFO L82 PathProgramCache]: Analyzing trace with hash 385741533, now seen corresponding path program 1 times [2021-10-21 19:40:07,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:07,020 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330500473] [2021-10-21 19:40:07,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:07,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:07,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:07,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:07,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330500473] [2021-10-21 19:40:07,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330500473] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:07,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:07,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:40:07,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331815714] [2021-10-21 19:40:07,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-21 19:40:07,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:07,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-21 19:40:07,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:40:07,239 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-10-21 19:40:08,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:08,156 INFO L93 Difference]: Finished difference Result 430 states and 478 transitions. [2021-10-21 19:40:08,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-21 19:40:08,156 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-10-21 19:40:08,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:08,159 INFO L225 Difference]: With dead ends: 430 [2021-10-21 19:40:08,159 INFO L226 Difference]: Without dead ends: 430 [2021-10-21 19:40:08,159 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 312.1ms TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2021-10-21 19:40:08,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-10-21 19:40:08,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 271. [2021-10-21 19:40:08,166 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-10-21 19:40:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 327 transitions. [2021-10-21 19:40:08,167 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 327 transitions. Word has length 38 [2021-10-21 19:40:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:08,168 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 327 transitions. [2021-10-21 19:40:08,168 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-10-21 19:40:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 327 transitions. [2021-10-21 19:40:08,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-21 19:40:08,169 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:08,169 INFO L512 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-10-21 19:40:08,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-21 19:40:08,169 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:08,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:08,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2104055878, now seen corresponding path program 1 times [2021-10-21 19:40:08,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:08,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326886897] [2021-10-21 19:40:08,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:08,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:08,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:08,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:08,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:08,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326886897] [2021-10-21 19:40:08,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326886897] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:08,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:08,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:40:08,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547591621] [2021-10-21 19:40:08,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:40:08,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:08,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:40:08,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:40:08,217 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-10-21 19:40:08,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:08,382 INFO L93 Difference]: Finished difference Result 273 states and 329 transitions. [2021-10-21 19:40:08,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:40:08,384 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-10-21 19:40:08,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:08,386 INFO L225 Difference]: With dead ends: 273 [2021-10-21 19:40:08,386 INFO L226 Difference]: Without dead ends: 273 [2021-10-21 19:40:08,386 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:40:08,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-10-21 19:40:08,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-10-21 19:40:08,391 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-10-21 19:40:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 329 transitions. [2021-10-21 19:40:08,393 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 329 transitions. Word has length 39 [2021-10-21 19:40:08,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:08,394 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 329 transitions. [2021-10-21 19:40:08,394 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-10-21 19:40:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 329 transitions. [2021-10-21 19:40:08,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-21 19:40:08,395 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:08,395 INFO L512 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-10-21 19:40:08,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-21 19:40:08,395 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr64ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:08,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:08,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1003773134, now seen corresponding path program 1 times [2021-10-21 19:40:08,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:08,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073321843] [2021-10-21 19:40:08,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:08,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:08,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-21 19:40:08,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:08,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073321843] [2021-10-21 19:40:08,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073321843] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:08,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:08,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:40:08,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213493677] [2021-10-21 19:40:08,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:40:08,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:08,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:40:08,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:40:08,500 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-10-21 19:40:08,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:08,835 INFO L93 Difference]: Finished difference Result 288 states and 344 transitions. [2021-10-21 19:40:08,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:40:08,836 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-10-21 19:40:08,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:08,838 INFO L225 Difference]: With dead ends: 288 [2021-10-21 19:40:08,838 INFO L226 Difference]: Without dead ends: 288 [2021-10-21 19:40:08,838 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 85.6ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:40:08,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-10-21 19:40:08,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 282. [2021-10-21 19:40:08,844 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-10-21 19:40:08,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 338 transitions. [2021-10-21 19:40:08,846 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 338 transitions. Word has length 40 [2021-10-21 19:40:08,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:08,846 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 338 transitions. [2021-10-21 19:40:08,847 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-10-21 19:40:08,847 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 338 transitions. [2021-10-21 19:40:08,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-21 19:40:08,847 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:08,848 INFO L512 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-10-21 19:40:08,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-21 19:40:08,848 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr38REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:08,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:08,849 INFO L82 PathProgramCache]: Analyzing trace with hash 533473399, now seen corresponding path program 1 times [2021-10-21 19:40:08,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:08,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298948879] [2021-10-21 19:40:08,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:08,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:08,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:08,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:08,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298948879] [2021-10-21 19:40:08,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298948879] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:08,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:08,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:40:08,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808541211] [2021-10-21 19:40:08,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:40:08,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:08,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:40:08,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:40:08,972 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-10-21 19:40:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:09,293 INFO L93 Difference]: Finished difference Result 282 states and 338 transitions. [2021-10-21 19:40:09,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:40:09,294 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-10-21 19:40:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:09,295 INFO L225 Difference]: With dead ends: 282 [2021-10-21 19:40:09,295 INFO L226 Difference]: Without dead ends: 282 [2021-10-21 19:40:09,296 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 95.1ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:40:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-10-21 19:40:09,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2021-10-21 19:40:09,301 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-10-21 19:40:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 337 transitions. [2021-10-21 19:40:09,303 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 337 transitions. Word has length 40 [2021-10-21 19:40:09,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:09,303 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 337 transitions. [2021-10-21 19:40:09,303 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-10-21 19:40:09,303 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 337 transitions. [2021-10-21 19:40:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-21 19:40:09,304 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:09,304 INFO L512 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-10-21 19:40:09,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-21 19:40:09,304 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr39REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:09,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:09,305 INFO L82 PathProgramCache]: Analyzing trace with hash 533473400, now seen corresponding path program 1 times [2021-10-21 19:40:09,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:09,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833369799] [2021-10-21 19:40:09,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:09,305 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:09,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:09,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:09,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833369799] [2021-10-21 19:40:09,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833369799] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:09,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:09,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:40:09,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700704596] [2021-10-21 19:40:09,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:40:09,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:09,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:40:09,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:40:09,447 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-10-21 19:40:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:09,903 INFO L93 Difference]: Finished difference Result 281 states and 337 transitions. [2021-10-21 19:40:09,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:40:09,903 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-10-21 19:40:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:09,905 INFO L225 Difference]: With dead ends: 281 [2021-10-21 19:40:09,905 INFO L226 Difference]: Without dead ends: 281 [2021-10-21 19:40:09,906 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 146.8ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:40:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-10-21 19:40:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2021-10-21 19:40:09,911 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-10-21 19:40:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 336 transitions. [2021-10-21 19:40:09,913 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 336 transitions. Word has length 40 [2021-10-21 19:40:09,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:09,914 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 336 transitions. [2021-10-21 19:40:09,914 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-10-21 19:40:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 336 transitions. [2021-10-21 19:40:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-21 19:40:09,915 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:09,915 INFO L512 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-10-21 19:40:09,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-21 19:40:09,915 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr51ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:09,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:09,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1330432764, now seen corresponding path program 1 times [2021-10-21 19:40:09,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:09,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446536699] [2021-10-21 19:40:09,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:09,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:10,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:10,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:10,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446536699] [2021-10-21 19:40:10,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446536699] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:10,211 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:10,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-21 19:40:10,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131423325] [2021-10-21 19:40:10,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-21 19:40:10,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:10,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-21 19:40:10,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:40:10,213 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-10-21 19:40:11,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:11,227 INFO L93 Difference]: Finished difference Result 448 states and 489 transitions. [2021-10-21 19:40:11,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-21 19:40:11,228 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-10-21 19:40:11,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:11,232 INFO L225 Difference]: With dead ends: 448 [2021-10-21 19:40:11,233 INFO L226 Difference]: Without dead ends: 448 [2021-10-21 19:40:11,233 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 488.6ms TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2021-10-21 19:40:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-10-21 19:40:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 280. [2021-10-21 19:40:11,239 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-10-21 19:40:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 335 transitions. [2021-10-21 19:40:11,241 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 335 transitions. Word has length 40 [2021-10-21 19:40:11,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:11,242 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 335 transitions. [2021-10-21 19:40:11,242 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-10-21 19:40:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 335 transitions. [2021-10-21 19:40:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-21 19:40:11,243 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:11,243 INFO L512 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-10-21 19:40:11,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-21 19:40:11,243 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:11,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:11,244 INFO L82 PathProgramCache]: Analyzing trace with hash -930257781, now seen corresponding path program 1 times [2021-10-21 19:40:11,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:11,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152258844] [2021-10-21 19:40:11,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:11,244 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:11,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:11,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:11,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152258844] [2021-10-21 19:40:11,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152258844] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:11,335 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:11,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:40:11,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053255421] [2021-10-21 19:40:11,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:40:11,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:11,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:40:11,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:40:11,336 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-10-21 19:40:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:11,656 INFO L93 Difference]: Finished difference Result 290 states and 346 transitions. [2021-10-21 19:40:11,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 19:40:11,656 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-10-21 19:40:11,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:11,658 INFO L225 Difference]: With dead ends: 290 [2021-10-21 19:40:11,658 INFO L226 Difference]: Without dead ends: 290 [2021-10-21 19:40:11,658 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 117.3ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:40:11,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-10-21 19:40:11,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 276. [2021-10-21 19:40:11,669 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-10-21 19:40:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 330 transitions. [2021-10-21 19:40:11,671 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 330 transitions. Word has length 41 [2021-10-21 19:40:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:11,671 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 330 transitions. [2021-10-21 19:40:11,671 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-10-21 19:40:11,672 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 330 transitions. [2021-10-21 19:40:11,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-21 19:40:11,674 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:11,674 INFO L512 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-10-21 19:40:11,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-21 19:40:11,676 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr77ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:11,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:11,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1804534839, now seen corresponding path program 1 times [2021-10-21 19:40:11,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:11,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680364267] [2021-10-21 19:40:11,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:11,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:11,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:11,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-21 19:40:11,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:11,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680364267] [2021-10-21 19:40:11,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680364267] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:11,722 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:11,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:40:11,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192299636] [2021-10-21 19:40:11,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:40:11,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:11,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:40:11,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:40:11,723 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-10-21 19:40:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:11,884 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2021-10-21 19:40:11,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:40:11,884 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-10-21 19:40:11,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:11,887 INFO L225 Difference]: With dead ends: 289 [2021-10-21 19:40:11,887 INFO L226 Difference]: Without dead ends: 289 [2021-10-21 19:40:11,888 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:40:11,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-10-21 19:40:11,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 277. [2021-10-21 19:40:11,896 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-10-21 19:40:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 331 transitions. [2021-10-21 19:40:11,898 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 331 transitions. Word has length 42 [2021-10-21 19:40:11,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:11,898 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 331 transitions. [2021-10-21 19:40:11,899 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-10-21 19:40:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 331 transitions. [2021-10-21 19:40:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-21 19:40:11,905 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:11,905 INFO L512 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-10-21 19:40:11,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-21 19:40:11,906 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr54ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:11,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:11,907 INFO L82 PathProgramCache]: Analyzing trace with hash 968459560, now seen corresponding path program 1 times [2021-10-21 19:40:11,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:11,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121295722] [2021-10-21 19:40:11,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:11,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:12,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:12,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:12,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121295722] [2021-10-21 19:40:12,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121295722] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:12,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:12,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-21 19:40:12,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226884894] [2021-10-21 19:40:12,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-21 19:40:12,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:12,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-21 19:40:12,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:40:12,212 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-10-21 19:40:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:13,163 INFO L93 Difference]: Finished difference Result 428 states and 475 transitions. [2021-10-21 19:40:13,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-21 19:40:13,163 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-10-21 19:40:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:13,166 INFO L225 Difference]: With dead ends: 428 [2021-10-21 19:40:13,166 INFO L226 Difference]: Without dead ends: 428 [2021-10-21 19:40:13,166 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 471.4ms TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2021-10-21 19:40:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-10-21 19:40:13,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 277. [2021-10-21 19:40:13,172 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-10-21 19:40:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 330 transitions. [2021-10-21 19:40:13,174 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 330 transitions. Word has length 43 [2021-10-21 19:40:13,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:13,174 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 330 transitions. [2021-10-21 19:40:13,174 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-10-21 19:40:13,174 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 330 transitions. [2021-10-21 19:40:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-21 19:40:13,175 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:13,176 INFO L512 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-10-21 19:40:13,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-21 19:40:13,176 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr62REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:13,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:13,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1207787386, now seen corresponding path program 1 times [2021-10-21 19:40:13,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:13,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837021914] [2021-10-21 19:40:13,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:13,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:13,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:40:13,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:13,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837021914] [2021-10-21 19:40:13,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837021914] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:40:13,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488608680] [2021-10-21 19:40:13,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:13,326 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:40:13,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:40:13,327 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:40:13,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-21 19:40:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:13,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-21 19:40:13,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:40:13,535 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-10-21 19:40:13,540 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-10-21 19:40:13,591 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-10-21 19:40:13,592 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-10-21 19:40:13,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:40:13,600 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-10-21 19:40:14,069 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-10-21 19:40:14,069 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-10-21 19:40:14,073 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-10-21 19:40:14,074 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-10-21 19:40:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-21 19:40:14,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488608680] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:40:14,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:40:14,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2021-10-21 19:40:14,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102150704] [2021-10-21 19:40:14,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 19:40:14,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:14,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 19:40:14,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:40:14,105 INFO L87 Difference]: Start difference. First operand 277 states and 330 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 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-10-21 19:40:14,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:14,694 INFO L93 Difference]: Finished difference Result 409 states and 450 transitions. [2021-10-21 19:40:14,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-21 19:40:14,695 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 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-10-21 19:40:14,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:14,697 INFO L225 Difference]: With dead ends: 409 [2021-10-21 19:40:14,697 INFO L226 Difference]: Without dead ends: 409 [2021-10-21 19:40:14,698 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 261.9ms TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2021-10-21 19:40:14,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-10-21 19:40:14,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 301. [2021-10-21 19:40:14,704 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-10-21 19:40:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 365 transitions. [2021-10-21 19:40:14,706 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 365 transitions. Word has length 45 [2021-10-21 19:40:14,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:14,706 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 365 transitions. [2021-10-21 19:40:14,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 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-10-21 19:40:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 365 transitions. [2021-10-21 19:40:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-21 19:40:14,708 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:14,708 INFO L512 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-10-21 19:40:14,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-21 19:40:14,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:40:14,922 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr64ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:14,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:14,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1891470081, now seen corresponding path program 1 times [2021-10-21 19:40:14,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:14,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047594396] [2021-10-21 19:40:14,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:14,923 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:14,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-21 19:40:14,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:14,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047594396] [2021-10-21 19:40:14,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047594396] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:14,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:14,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:40:14,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550589773] [2021-10-21 19:40:14,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:40:14,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:14,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:40:14,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:40:14,967 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-10-21 19:40:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:15,143 INFO L93 Difference]: Finished difference Result 303 states and 365 transitions. [2021-10-21 19:40:15,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:40:15,144 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-10-21 19:40:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:15,145 INFO L225 Difference]: With dead ends: 303 [2021-10-21 19:40:15,146 INFO L226 Difference]: Without dead ends: 303 [2021-10-21 19:40:15,146 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:40:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-10-21 19:40:15,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2021-10-21 19:40:15,151 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-10-21 19:40:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 361 transitions. [2021-10-21 19:40:15,153 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 361 transitions. Word has length 45 [2021-10-21 19:40:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:15,153 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 361 transitions. [2021-10-21 19:40:15,154 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-10-21 19:40:15,154 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 361 transitions. [2021-10-21 19:40:15,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-21 19:40:15,160 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:15,160 INFO L512 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-10-21 19:40:15,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-21 19:40:15,160 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr79ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:15,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:15,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1213297892, now seen corresponding path program 1 times [2021-10-21 19:40:15,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:15,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139080795] [2021-10-21 19:40:15,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:15,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:15,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-21 19:40:15,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:15,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139080795] [2021-10-21 19:40:15,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139080795] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:40:15,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136042429] [2021-10-21 19:40:15,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:15,225 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:40:15,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:40:15,228 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:40:15,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-21 19:40:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:15,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-21 19:40:15,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:40:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-21 19:40:15,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136042429] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:40:15,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:40:15,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-10-21 19:40:15,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904328230] [2021-10-21 19:40:15,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:40:15,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:15,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:40:15,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:40:15,783 INFO L87 Difference]: Start difference. First operand 299 states and 361 transitions. Second operand has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:40:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:16,067 INFO L93 Difference]: Finished difference Result 330 states and 392 transitions. [2021-10-21 19:40:16,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:40:16,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (3), 3 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 46 [2021-10-21 19:40:16,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:16,069 INFO L225 Difference]: With dead ends: 330 [2021-10-21 19:40:16,069 INFO L226 Difference]: Without dead ends: 306 [2021-10-21 19:40:16,069 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 42.0ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:40:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-10-21 19:40:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-10-21 19:40:16,075 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-10-21 19:40:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 368 transitions. [2021-10-21 19:40:16,077 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 368 transitions. Word has length 46 [2021-10-21 19:40:16,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:16,077 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 368 transitions. [2021-10-21 19:40:16,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:40:16,077 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 368 transitions. [2021-10-21 19:40:16,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-21 19:40:16,078 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:16,078 INFO L512 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-10-21 19:40:16,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-21 19:40:16,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-10-21 19:40:16,279 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr65REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:16,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:16,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1493965183, now seen corresponding path program 1 times [2021-10-21 19:40:16,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:16,280 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440795215] [2021-10-21 19:40:16,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:16,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:16,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-21 19:40:16,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:16,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440795215] [2021-10-21 19:40:16,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440795215] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:16,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:16,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:40:16,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823893663] [2021-10-21 19:40:16,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 19:40:16,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:16,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 19:40:16,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:40:16,420 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-10-21 19:40:16,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:16,911 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2021-10-21 19:40:16,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:40:16,912 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-10-21 19:40:16,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:16,914 INFO L225 Difference]: With dead ends: 349 [2021-10-21 19:40:16,914 INFO L226 Difference]: Without dead ends: 349 [2021-10-21 19:40:16,914 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 145.3ms TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-10-21 19:40:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-10-21 19:40:16,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 313. [2021-10-21 19:40:16,922 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-10-21 19:40:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 377 transitions. [2021-10-21 19:40:16,924 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 377 transitions. Word has length 46 [2021-10-21 19:40:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:16,924 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 377 transitions. [2021-10-21 19:40:16,924 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-10-21 19:40:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 377 transitions. [2021-10-21 19:40:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-21 19:40:16,925 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:16,925 INFO L512 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-10-21 19:40:16,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-21 19:40:16,926 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr66REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:16,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:16,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1493965182, now seen corresponding path program 1 times [2021-10-21 19:40:16,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:16,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387331459] [2021-10-21 19:40:16,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:16,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:17,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-21 19:40:17,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:17,144 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387331459] [2021-10-21 19:40:17,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387331459] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:17,144 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:17,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-21 19:40:17,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019772831] [2021-10-21 19:40:17,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:40:17,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:17,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:40:17,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:40:17,147 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-10-21 19:40:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:17,725 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2021-10-21 19:40:17,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:40:17,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-10-21 19:40:17,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:17,729 INFO L225 Difference]: With dead ends: 349 [2021-10-21 19:40:17,729 INFO L226 Difference]: Without dead ends: 349 [2021-10-21 19:40:17,729 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 209.1ms TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-10-21 19:40:17,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-10-21 19:40:17,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 319. [2021-10-21 19:40:17,735 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-10-21 19:40:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 384 transitions. [2021-10-21 19:40:17,737 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 384 transitions. Word has length 46 [2021-10-21 19:40:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:17,738 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 384 transitions. [2021-10-21 19:40:17,738 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-10-21 19:40:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 384 transitions. [2021-10-21 19:40:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-21 19:40:17,739 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:17,739 INFO L512 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-10-21 19:40:17,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-21 19:40:17,739 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr57REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-10-21 19:40:17,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:17,740 INFO L82 PathProgramCache]: Analyzing trace with hash 292246064, now seen corresponding path program 1 times [2021-10-21 19:40:17,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:17,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639305183] [2021-10-21 19:40:17,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:17,741 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:40:17,758 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:40:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:40:17,803 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:40:17,803 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-21 19:40:17,804 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr57REQUIRES_VIOLATION [2021-10-21 19:40:17,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-10-21 19:40:17,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-10-21 19:40:17,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:40:17,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-10-21 19:40:17,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-10-21 19:40:17,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-10-21 19:40:17,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-10-21 19:40:17,808 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-10-21 19:40:17,808 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-10-21 19:40:17,808 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-10-21 19:40:17,808 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-10-21 19:40:17,808 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-10-21 19:40:17,808 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-10-21 19:40:17,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-10-21 19:40:17,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-10-21 19:40:17,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-10-21 19:40:17,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-10-21 19:40:17,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-10-21 19:40:17,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-10-21 19:40:17,810 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:40:17,810 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-10-21 19:40:17,810 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-10-21 19:40:17,810 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-10-21 19:40:17,810 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-10-21 19:40:17,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-10-21 19:40:17,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-10-21 19:40:17,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:40:17,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:40:17,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-10-21 19:40:17,812 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-10-21 19:40:17,812 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-10-21 19:40:17,812 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-10-21 19:40:17,812 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-10-21 19:40:17,812 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-10-21 19:40:17,812 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-10-21 19:40:17,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-10-21 19:40:17,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-10-21 19:40:17,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-10-21 19:40:17,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-10-21 19:40:17,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-10-21 19:40:17,814 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-10-21 19:40:17,814 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-10-21 19:40:17,814 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-10-21 19:40:17,814 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-10-21 19:40:17,814 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:40:17,815 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:40:17,815 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-10-21 19:40:17,815 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-10-21 19:40:17,815 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:40:17,815 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-10-21 19:40:17,815 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-10-21 19:40:17,816 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:40:17,816 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-10-21 19:40:17,816 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-10-21 19:40:17,816 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:40:17,816 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-10-21 19:40:17,817 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56REQUIRES_VIOLATION [2021-10-21 19:40:17,817 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-10-21 19:40:17,817 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:40:17,817 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-10-21 19:40:17,817 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION [2021-10-21 19:40:17,817 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION [2021-10-21 19:40:17,818 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63REQUIRES_VIOLATION [2021-10-21 19:40:17,818 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:40:17,818 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65REQUIRES_VIOLATION [2021-10-21 19:40:17,818 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION [2021-10-21 19:40:17,818 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:40:17,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68REQUIRES_VIOLATION [2021-10-21 19:40:17,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69REQUIRES_VIOLATION [2021-10-21 19:40:17,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:40:17,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:40:17,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:40:17,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:40:17,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74REQUIRES_VIOLATION [2021-10-21 19:40:17,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75REQUIRES_VIOLATION [2021-10-21 19:40:17,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr76ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:40:17,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr77ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:40:17,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr78ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:40:17,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr79ENSURES_VIOLATIONMEMORY_LEAK [2021-10-21 19:40:17,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-21 19:40:17,828 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 19:40:17,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 07:40:17 BoogieIcfgContainer [2021-10-21 19:40:17,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 19:40:17,861 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 19:40:17,862 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 19:40:17,862 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 19:40:17,862 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:39:54" (3/4) ... [2021-10-21 19:40:17,864 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-21 19:40:17,906 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 19:40:17,906 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 19:40:17,907 INFO L168 Benchmark]: Toolchain (without parser) took 25336.54 ms. Allocated memory was 104.9 MB in the beginning and 151.0 MB in the end (delta: 46.1 MB). Free memory was 71.7 MB in the beginning and 41.9 MB in the end (delta: 29.8 MB). Peak memory consumption was 74.3 MB. Max. memory is 16.1 GB. [2021-10-21 19:40:17,907 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 104.9 MB. Free memory is still 58.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:40:17,908 INFO L168 Benchmark]: CACSL2BoogieTranslator took 606.44 ms. Allocated memory is still 104.9 MB. Free memory was 71.4 MB in the beginning and 69.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-21 19:40:17,908 INFO L168 Benchmark]: Boogie Preprocessor took 127.15 ms. Allocated memory is still 104.9 MB. Free memory was 68.8 MB in the beginning and 65.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-21 19:40:17,909 INFO L168 Benchmark]: RCFGBuilder took 907.36 ms. Allocated memory was 104.9 MB in the beginning and 125.8 MB in the end (delta: 21.0 MB). Free memory was 65.7 MB in the beginning and 87.0 MB in the end (delta: -21.2 MB). Peak memory consumption was 27.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:40:17,909 INFO L168 Benchmark]: TraceAbstraction took 23645.33 ms. Allocated memory was 125.8 MB in the beginning and 151.0 MB in the end (delta: 25.2 MB). Free memory was 87.0 MB in the beginning and 45.0 MB in the end (delta: 42.0 MB). Peak memory consumption was 66.7 MB. Max. memory is 16.1 GB. [2021-10-21 19:40:17,910 INFO L168 Benchmark]: Witness Printer took 44.78 ms. Allocated memory is still 151.0 MB. Free memory was 45.0 MB in the beginning and 41.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:40:17,912 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.25 ms. Allocated memory is still 104.9 MB. Free memory is still 58.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 606.44 ms. Allocated memory is still 104.9 MB. Free memory was 71.4 MB in the beginning and 69.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 127.15 ms. Allocated memory is still 104.9 MB. Free memory was 68.8 MB in the beginning and 65.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 907.36 ms. Allocated memory was 104.9 MB in the beginning and 125.8 MB in the end (delta: 21.0 MB). Free memory was 65.7 MB in the beginning and 87.0 MB in the end (delta: -21.2 MB). Peak memory consumption was 27.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23645.33 ms. Allocated memory was 125.8 MB in the beginning and 151.0 MB in the end (delta: 25.2 MB). Free memory was 87.0 MB in the beginning and 45.0 MB in the end (delta: 42.0 MB). Peak memory consumption was 66.7 MB. Max. memory is 16.1 GB. * Witness Printer took 44.78 ms. Allocated memory is still 151.0 MB. Free memory was 45.0 MB in the beginning and 41.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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: 23553.0ms, OverallIterations: 38, TraceHistogramMax: 2, EmptinessCheckTime: 55.4ms, AutomataDifference: 15462.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5010 SDtfs, 6834 SDslu, 14758 SDs, 0 SdLazy, 16128 SolverSat, 483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9926.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 4063.1ms Time, 0.0ms 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.0ms DumpTime, AutomataMinimizationStatistics: 315.6ms AutomataMinimizationTime, 37 MinimizatonAttempts, 1401 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 108.2ms SsaConstructionTime, 553.9ms SatisfiabilityAnalysisTime, 5343.3ms InterpolantComputationTime, 1307 NumberOfCodeBlocks, 1307 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1220 ConstructedInterpolants, 3 QuantifiedInterpolants, 11356 SizeOfPredicates, 13 NumberOfNonLiveVariables, 583 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 40 InterpolantComputations, 34 PerfectInterpolantSequences, 12/19 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-10-21 19:40:17,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b15edab2-598b-4f9e-ba82-d076969a8f88/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...