./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6bee9027c6ee41df2f7df0c67f6de4e3d806cb7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 23:31:01,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 23:31:01,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 23:31:01,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 23:31:01,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 23:31:01,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 23:31:01,559 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 23:31:01,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 23:31:01,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 23:31:01,577 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 23:31:01,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 23:31:01,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 23:31:01,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 23:31:01,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 23:31:01,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 23:31:01,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 23:31:01,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 23:31:01,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 23:31:01,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 23:31:01,592 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 23:31:01,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 23:31:01,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 23:31:01,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 23:31:01,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 23:31:01,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 23:31:01,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 23:31:01,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 23:31:01,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 23:31:01,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 23:31:01,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 23:31:01,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 23:31:01,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 23:31:01,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 23:31:01,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 23:31:01,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 23:31:01,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 23:31:01,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 23:31:01,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 23:31:01,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 23:31:01,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 23:31:01,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 23:31:01,625 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2020-11-29 23:31:01,669 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 23:31:01,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 23:31:01,675 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 23:31:01,675 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 23:31:01,675 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 23:31:01,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 23:31:01,676 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 23:31:01,676 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 23:31:01,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 23:31:01,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 23:31:01,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 23:31:01,678 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-29 23:31:01,678 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-29 23:31:01,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 23:31:01,679 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-29 23:31:01,679 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 23:31:01,679 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 23:31:01,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 23:31:01,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 23:31:01,680 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 23:31:01,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 23:31:01,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 23:31:01,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 23:31:01,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 23:31:01,681 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 23:31:01,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 23:31:01,682 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 23:31:01,682 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-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/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-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer 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-memcleanup) ) 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 -> c6bee9027c6ee41df2f7df0c67f6de4e3d806cb7 [2020-11-29 23:31:01,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 23:31:01,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 23:31:01,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 23:31:01,998 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 23:31:01,999 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 23:31:02,000 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2020-11-29 23:31:02,099 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/data/ec2aa224d/8ce6beff0cde4fa39c1e3122063fbbb3/FLAG5b5d95399 [2020-11-29 23:31:02,637 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 23:31:02,638 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2020-11-29 23:31:02,665 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/data/ec2aa224d/8ce6beff0cde4fa39c1e3122063fbbb3/FLAG5b5d95399 [2020-11-29 23:31:02,915 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/data/ec2aa224d/8ce6beff0cde4fa39c1e3122063fbbb3 [2020-11-29 23:31:02,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 23:31:02,919 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-29 23:31:02,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 23:31:02,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 23:31:02,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 23:31:02,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:31:02" (1/1) ... [2020-11-29 23:31:02,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bce2e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:02, skipping insertion in model container [2020-11-29 23:31:02,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:31:02" (1/1) ... [2020-11-29 23:31:02,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 23:31:02,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 23:31:03,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:31:03,285 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 23:31:03,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:31:03,397 INFO L208 MainTranslator]: Completed translation [2020-11-29 23:31:03,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:03 WrapperNode [2020-11-29 23:31:03,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 23:31:03,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 23:31:03,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 23:31:03,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 23:31:03,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:03" (1/1) ... [2020-11-29 23:31:03,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:03" (1/1) ... [2020-11-29 23:31:03,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:03" (1/1) ... [2020-11-29 23:31:03,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:03" (1/1) ... [2020-11-29 23:31:03,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:03" (1/1) ... [2020-11-29 23:31:03,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:03" (1/1) ... [2020-11-29 23:31:03,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:03" (1/1) ... [2020-11-29 23:31:03,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 23:31:03,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 23:31:03,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 23:31:03,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 23:31:03,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 23:31:03,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-29 23:31:03,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 23:31:03,584 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-29 23:31:03,584 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-29 23:31:03,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-29 23:31:03,585 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-11-29 23:31:03,585 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2020-11-29 23:31:03,586 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-29 23:31:03,586 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-29 23:31:03,586 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-29 23:31:03,586 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-29 23:31:03,587 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-29 23:31:03,587 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-29 23:31:03,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 23:31:03,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-29 23:31:03,588 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-29 23:31:03,588 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-29 23:31:03,590 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-29 23:31:03,590 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-29 23:31:03,590 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-29 23:31:03,590 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-29 23:31:03,590 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-29 23:31:03,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-29 23:31:03,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-29 23:31:03,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-29 23:31:03,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-29 23:31:03,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-29 23:31:03,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-29 23:31:03,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-29 23:31:03,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-29 23:31:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-29 23:31:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-29 23:31:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-29 23:31:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-29 23:31:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-29 23:31:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-29 23:31:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-29 23:31:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-29 23:31:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-29 23:31:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-29 23:31:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-29 23:31:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-29 23:31:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-29 23:31:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-29 23:31:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-29 23:31:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-29 23:31:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-29 23:31:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-29 23:31:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-29 23:31:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-29 23:31:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-29 23:31:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-29 23:31:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-29 23:31:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-29 23:31:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-29 23:31:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-29 23:31:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-29 23:31:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-29 23:31:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-29 23:31:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-29 23:31:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-29 23:31:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-29 23:31:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-29 23:31:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-29 23:31:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-29 23:31:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-29 23:31:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-29 23:31:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-29 23:31:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-29 23:31:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-29 23:31:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-29 23:31:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-11-29 23:31:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-29 23:31:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-29 23:31:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-29 23:31:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-29 23:31:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-29 23:31:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-29 23:31:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-29 23:31:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-29 23:31:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-29 23:31:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-29 23:31:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-29 23:31:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-29 23:31:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-29 23:31:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-29 23:31:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-29 23:31:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-29 23:31:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-29 23:31:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-29 23:31:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-29 23:31:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-29 23:31:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-29 23:31:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-29 23:31:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-29 23:31:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-29 23:31:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-29 23:31:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-29 23:31:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-29 23:31:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-29 23:31:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-29 23:31:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-29 23:31:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-29 23:31:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-29 23:31:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-29 23:31:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-29 23:31:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-29 23:31:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-29 23:31:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-29 23:31:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-29 23:31:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-29 23:31:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-29 23:31:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-29 23:31:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-29 23:31:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-29 23:31:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-29 23:31:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-29 23:31:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-29 23:31:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-29 23:31:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-11-29 23:31:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2020-11-29 23:31:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-29 23:31:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 23:31:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-29 23:31:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-29 23:31:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-29 23:31:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-29 23:31:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 23:31:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-29 23:31:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 23:31:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 23:31:03,993 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-11-29 23:31:04,365 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 23:31:04,370 INFO L298 CfgBuilder]: Removed 3 assume(true) statements. [2020-11-29 23:31:04,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:31:04 BoogieIcfgContainer [2020-11-29 23:31:04,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 23:31:04,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 23:31:04,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 23:31:04,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 23:31:04,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 11:31:02" (1/3) ... [2020-11-29 23:31:04,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47476868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:31:04, skipping insertion in model container [2020-11-29 23:31:04,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:03" (2/3) ... [2020-11-29 23:31:04,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47476868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:31:04, skipping insertion in model container [2020-11-29 23:31:04,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:31:04" (3/3) ... [2020-11-29 23:31:04,385 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2020-11-29 23:31:04,400 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 23:31:04,405 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2020-11-29 23:31:04,416 INFO L253 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2020-11-29 23:31:04,441 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 23:31:04,441 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-29 23:31:04,442 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 23:31:04,442 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 23:31:04,442 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 23:31:04,442 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 23:31:04,442 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 23:31:04,442 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 23:31:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2020-11-29 23:31:04,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 23:31:04,467 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:04,467 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:31:04,468 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-29 23:31:04,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:04,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1623618837, now seen corresponding path program 1 times [2020-11-29 23:31:04,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:04,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405093401] [2020-11-29 23:31:04,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:04,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:31:04,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405093401] [2020-11-29 23:31:04,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:31:04,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:31:04,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261071044] [2020-11-29 23:31:04,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 23:31:04,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:04,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 23:31:04,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 23:31:04,747 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 4 states. [2020-11-29 23:31:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:05,217 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2020-11-29 23:31:05,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 23:31:05,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-29 23:31:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:05,229 INFO L225 Difference]: With dead ends: 156 [2020-11-29 23:31:05,229 INFO L226 Difference]: Without dead ends: 147 [2020-11-29 23:31:05,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 23:31:05,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-11-29 23:31:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 110. [2020-11-29 23:31:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-11-29 23:31:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2020-11-29 23:31:05,296 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 11 [2020-11-29 23:31:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:05,297 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2020-11-29 23:31:05,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 23:31:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2020-11-29 23:31:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 23:31:05,298 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:05,298 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:31:05,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 23:31:05,301 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-29 23:31:05,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:05,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1623618838, now seen corresponding path program 1 times [2020-11-29 23:31:05,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:05,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011934570] [2020-11-29 23:31:05,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:05,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:31:05,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011934570] [2020-11-29 23:31:05,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:31:05,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:31:05,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895843246] [2020-11-29 23:31:05,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 23:31:05,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:05,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 23:31:05,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 23:31:05,461 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 4 states. [2020-11-29 23:31:05,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:05,859 INFO L93 Difference]: Finished difference Result 142 states and 159 transitions. [2020-11-29 23:31:05,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 23:31:05,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-29 23:31:05,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:05,861 INFO L225 Difference]: With dead ends: 142 [2020-11-29 23:31:05,861 INFO L226 Difference]: Without dead ends: 142 [2020-11-29 23:31:05,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 23:31:05,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-29 23:31:05,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 105. [2020-11-29 23:31:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-11-29 23:31:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 129 transitions. [2020-11-29 23:31:05,873 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 129 transitions. Word has length 11 [2020-11-29 23:31:05,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:05,874 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 129 transitions. [2020-11-29 23:31:05,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 23:31:05,874 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 129 transitions. [2020-11-29 23:31:05,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 23:31:05,875 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:05,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:31:05,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 23:31:05,876 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-29 23:31:05,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:05,880 INFO L82 PathProgramCache]: Analyzing trace with hash -713826160, now seen corresponding path program 1 times [2020-11-29 23:31:05,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:05,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819886171] [2020-11-29 23:31:05,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:05,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:06,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:31:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:31:06,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819886171] [2020-11-29 23:31:06,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:31:06,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 23:31:06,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881286823] [2020-11-29 23:31:06,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 23:31:06,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:06,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 23:31:06,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-29 23:31:06,049 INFO L87 Difference]: Start difference. First operand 105 states and 129 transitions. Second operand 7 states. [2020-11-29 23:31:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:06,474 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2020-11-29 23:31:06,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 23:31:06,475 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-11-29 23:31:06,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:06,476 INFO L225 Difference]: With dead ends: 103 [2020-11-29 23:31:06,476 INFO L226 Difference]: Without dead ends: 100 [2020-11-29 23:31:06,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-11-29 23:31:06,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-11-29 23:31:06,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 86. [2020-11-29 23:31:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-29 23:31:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2020-11-29 23:31:06,484 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 14 [2020-11-29 23:31:06,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:06,484 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2020-11-29 23:31:06,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 23:31:06,484 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2020-11-29 23:31:06,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 23:31:06,485 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:06,485 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:31:06,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 23:31:06,485 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-29 23:31:06,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:06,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1424889429, now seen corresponding path program 1 times [2020-11-29 23:31:06,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:06,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275747544] [2020-11-29 23:31:06,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:06,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:31:06,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275747544] [2020-11-29 23:31:06,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:31:06,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 23:31:06,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025604143] [2020-11-29 23:31:06,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 23:31:06,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:06,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 23:31:06,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 23:31:06,575 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 4 states. [2020-11-29 23:31:06,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:06,786 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2020-11-29 23:31:06,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 23:31:06,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-29 23:31:06,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:06,788 INFO L225 Difference]: With dead ends: 97 [2020-11-29 23:31:06,788 INFO L226 Difference]: Without dead ends: 97 [2020-11-29 23:31:06,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 23:31:06,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-11-29 23:31:06,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2020-11-29 23:31:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-11-29 23:31:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2020-11-29 23:31:06,797 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 20 [2020-11-29 23:31:06,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:06,797 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2020-11-29 23:31:06,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 23:31:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2020-11-29 23:31:06,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-29 23:31:06,798 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:06,798 INFO L422 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] [2020-11-29 23:31:06,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 23:31:06,799 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-29 23:31:06,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:06,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1016601636, now seen corresponding path program 1 times [2020-11-29 23:31:06,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:06,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431638431] [2020-11-29 23:31:06,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:06,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:06,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:31:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:31:07,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431638431] [2020-11-29 23:31:07,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:31:07,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 23:31:07,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077063993] [2020-11-29 23:31:07,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 23:31:07,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:07,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 23:31:07,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-29 23:31:07,005 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 9 states. [2020-11-29 23:31:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:07,452 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2020-11-29 23:31:07,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 23:31:07,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-11-29 23:31:07,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:07,453 INFO L225 Difference]: With dead ends: 96 [2020-11-29 23:31:07,453 INFO L226 Difference]: Without dead ends: 96 [2020-11-29 23:31:07,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:31:07,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-11-29 23:31:07,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2020-11-29 23:31:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-11-29 23:31:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2020-11-29 23:31:07,460 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 26 [2020-11-29 23:31:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:07,460 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2020-11-29 23:31:07,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 23:31:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2020-11-29 23:31:07,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-29 23:31:07,461 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:07,461 INFO L422 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] [2020-11-29 23:31:07,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 23:31:07,462 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-29 23:31:07,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:07,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1016601637, now seen corresponding path program 1 times [2020-11-29 23:31:07,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:07,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124019803] [2020-11-29 23:31:07,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:07,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:07,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:31:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:31:07,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124019803] [2020-11-29 23:31:07,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222654570] [2020-11-29 23:31:07,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 23:31:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:07,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 23:31:07,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:31:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:31:07,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:31:07,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2020-11-29 23:31:07,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555435975] [2020-11-29 23:31:07,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 23:31:07,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:07,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 23:31:07,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-29 23:31:07,943 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand 9 states. [2020-11-29 23:31:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:08,409 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2020-11-29 23:31:08,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 23:31:08,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-11-29 23:31:08,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:08,410 INFO L225 Difference]: With dead ends: 108 [2020-11-29 23:31:08,411 INFO L226 Difference]: Without dead ends: 105 [2020-11-29 23:31:08,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-11-29 23:31:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-11-29 23:31:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2020-11-29 23:31:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-29 23:31:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2020-11-29 23:31:08,417 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 26 [2020-11-29 23:31:08,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:08,417 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2020-11-29 23:31:08,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 23:31:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2020-11-29 23:31:08,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-29 23:31:08,424 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:08,424 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:31:08,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-11-29 23:31:08,647 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-29 23:31:08,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:08,647 INFO L82 PathProgramCache]: Analyzing trace with hash -872929728, now seen corresponding path program 1 times [2020-11-29 23:31:08,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:08,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148309600] [2020-11-29 23:31:08,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:08,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:31:08,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148309600] [2020-11-29 23:31:08,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223987850] [2020-11-29 23:31:08,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 23:31:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:09,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-29 23:31:09,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:31:09,087 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-29 23:31:09,088 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:09,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:09,097 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:09,097 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 23:31:09,172 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:09,172 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 28 [2020-11-29 23:31:09,173 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:09,203 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2020-11-29 23:31:09,204 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 23:31:09,204 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2020-11-29 23:31:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:31:09,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:31:09,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2020-11-29 23:31:09,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84895515] [2020-11-29 23:31:09,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 23:31:09,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:09,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 23:31:09,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-29 23:31:09,237 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand 9 states. [2020-11-29 23:31:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:09,628 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2020-11-29 23:31:09,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 23:31:09,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2020-11-29 23:31:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:09,630 INFO L225 Difference]: With dead ends: 91 [2020-11-29 23:31:09,630 INFO L226 Difference]: Without dead ends: 91 [2020-11-29 23:31:09,630 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-29 23:31:09,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-29 23:31:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-11-29 23:31:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-11-29 23:31:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2020-11-29 23:31:09,645 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 32 [2020-11-29 23:31:09,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:09,649 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2020-11-29 23:31:09,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 23:31:09,649 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2020-11-29 23:31:09,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-29 23:31:09,650 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:09,650 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:31:09,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 23:31:09,851 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-29 23:31:09,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:09,852 INFO L82 PathProgramCache]: Analyzing trace with hash 603691449, now seen corresponding path program 2 times [2020-11-29 23:31:09,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:09,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042607353] [2020-11-29 23:31:09,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:09,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:09,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:31:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:31:10,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042607353] [2020-11-29 23:31:10,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787069081] [2020-11-29 23:31:10,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 23:31:10,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 23:31:10,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 23:31:10,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 23:31:10,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:31:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:31:10,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:31:10,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2020-11-29 23:31:10,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145884693] [2020-11-29 23:31:10,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 23:31:10,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:10,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 23:31:10,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-29 23:31:10,383 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 11 states. [2020-11-29 23:31:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:10,997 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2020-11-29 23:31:10,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 23:31:10,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2020-11-29 23:31:10,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:10,999 INFO L225 Difference]: With dead ends: 119 [2020-11-29 23:31:10,999 INFO L226 Difference]: Without dead ends: 116 [2020-11-29 23:31:11,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2020-11-29 23:31:11,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-11-29 23:31:11,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 104. [2020-11-29 23:31:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-29 23:31:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2020-11-29 23:31:11,005 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 38 [2020-11-29 23:31:11,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:11,005 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2020-11-29 23:31:11,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 23:31:11,005 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2020-11-29 23:31:11,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-29 23:31:11,007 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:11,007 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:31:11,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 23:31:11,208 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-29 23:31:11,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:11,208 INFO L82 PathProgramCache]: Analyzing trace with hash -222202587, now seen corresponding path program 1 times [2020-11-29 23:31:11,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:11,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438674828] [2020-11-29 23:31:11,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:11,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:11,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:31:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:11,542 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:31:11,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438674828] [2020-11-29 23:31:11,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840251067] [2020-11-29 23:31:11,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 23:31:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:11,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-29 23:31:11,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:31:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:31:11,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:31:11,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2020-11-29 23:31:11,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490162813] [2020-11-29 23:31:11,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 23:31:11,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:11,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 23:31:11,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-11-29 23:31:11,759 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand 11 states. [2020-11-29 23:31:12,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:12,068 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2020-11-29 23:31:12,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 23:31:12,068 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2020-11-29 23:31:12,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:12,070 INFO L225 Difference]: With dead ends: 132 [2020-11-29 23:31:12,070 INFO L226 Difference]: Without dead ends: 129 [2020-11-29 23:31:12,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2020-11-29 23:31:12,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-29 23:31:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2020-11-29 23:31:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-11-29 23:31:12,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2020-11-29 23:31:12,078 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 52 [2020-11-29 23:31:12,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:12,080 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2020-11-29 23:31:12,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 23:31:12,081 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2020-11-29 23:31:12,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-29 23:31:12,091 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:12,091 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:31:12,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 23:31:12,303 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-29 23:31:12,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:12,303 INFO L82 PathProgramCache]: Analyzing trace with hash -710767347, now seen corresponding path program 2 times [2020-11-29 23:31:12,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:12,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41446772] [2020-11-29 23:31:12,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:12,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:12,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:31:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:31:12,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41446772] [2020-11-29 23:31:12,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568258302] [2020-11-29 23:31:12,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 23:31:12,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 23:31:12,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 23:31:12,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 23:31:12,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:31:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:31:12,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:31:12,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2020-11-29 23:31:12,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101173503] [2020-11-29 23:31:12,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 23:31:12,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:12,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 23:31:12,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:31:12,901 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand 12 states. [2020-11-29 23:31:13,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:13,307 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2020-11-29 23:31:13,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 23:31:13,308 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2020-11-29 23:31:13,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:13,309 INFO L225 Difference]: With dead ends: 145 [2020-11-29 23:31:13,309 INFO L226 Difference]: Without dead ends: 142 [2020-11-29 23:31:13,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2020-11-29 23:31:13,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-29 23:31:13,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 130. [2020-11-29 23:31:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-11-29 23:31:13,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2020-11-29 23:31:13,317 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 65 [2020-11-29 23:31:13,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:13,319 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2020-11-29 23:31:13,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 23:31:13,319 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2020-11-29 23:31:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-29 23:31:13,325 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:13,325 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:31:13,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-11-29 23:31:13,551 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-29 23:31:13,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:13,551 INFO L82 PathProgramCache]: Analyzing trace with hash 108891685, now seen corresponding path program 3 times [2020-11-29 23:31:13,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:13,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043105149] [2020-11-29 23:31:13,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:13,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:13,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:31:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-11-29 23:31:13,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043105149] [2020-11-29 23:31:13,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:31:13,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 23:31:13,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971782024] [2020-11-29 23:31:13,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 23:31:13,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:13,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 23:31:13,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-29 23:31:13,866 INFO L87 Difference]: Start difference. First operand 130 states and 145 transitions. Second operand 9 states. [2020-11-29 23:31:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:14,362 INFO L93 Difference]: Finished difference Result 164 states and 185 transitions. [2020-11-29 23:31:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 23:31:14,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-11-29 23:31:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:14,364 INFO L225 Difference]: With dead ends: 164 [2020-11-29 23:31:14,364 INFO L226 Difference]: Without dead ends: 164 [2020-11-29 23:31:14,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:31:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-11-29 23:31:14,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2020-11-29 23:31:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-11-29 23:31:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 178 transitions. [2020-11-29 23:31:14,370 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 178 transitions. Word has length 78 [2020-11-29 23:31:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:14,370 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 178 transitions. [2020-11-29 23:31:14,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 23:31:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2020-11-29 23:31:14,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-29 23:31:14,377 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:14,377 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:31:14,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 23:31:14,380 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-29 23:31:14,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:14,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1392676980, now seen corresponding path program 1 times [2020-11-29 23:31:14,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:14,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336980960] [2020-11-29 23:31:14,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:14,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:14,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:31:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-11-29 23:31:14,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336980960] [2020-11-29 23:31:14,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:31:14,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 23:31:14,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15906673] [2020-11-29 23:31:14,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 23:31:14,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:14,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 23:31:14,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-29 23:31:14,692 INFO L87 Difference]: Start difference. First operand 156 states and 178 transitions. Second operand 9 states. [2020-11-29 23:31:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:15,096 INFO L93 Difference]: Finished difference Result 161 states and 182 transitions. [2020-11-29 23:31:15,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 23:31:15,097 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2020-11-29 23:31:15,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:15,098 INFO L225 Difference]: With dead ends: 161 [2020-11-29 23:31:15,098 INFO L226 Difference]: Without dead ends: 161 [2020-11-29 23:31:15,099 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:31:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-11-29 23:31:15,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2020-11-29 23:31:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-11-29 23:31:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 177 transitions. [2020-11-29 23:31:15,104 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 177 transitions. Word has length 82 [2020-11-29 23:31:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:15,105 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 177 transitions. [2020-11-29 23:31:15,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 23:31:15,105 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 177 transitions. [2020-11-29 23:31:15,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-29 23:31:15,106 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:15,106 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:31:15,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 23:31:15,106 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-29 23:31:15,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:15,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1468486517, now seen corresponding path program 1 times [2020-11-29 23:31:15,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:15,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028703730] [2020-11-29 23:31:15,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:15,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:15,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:31:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-11-29 23:31:15,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028703730] [2020-11-29 23:31:15,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146080892] [2020-11-29 23:31:15,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 23:31:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:15,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 46 conjunts are in the unsatisfiable core [2020-11-29 23:31:15,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:31:15,909 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-29 23:31:15,910 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:15,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:15,916 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:15,916 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 23:31:15,971 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:15,971 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2020-11-29 23:31:15,972 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:15,974 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:15,974 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:15,974 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-11-29 23:31:15,982 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2020-11-29 23:31:15,982 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:15,988 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:15,989 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:15,989 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-11-29 23:31:16,018 INFO L384 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 26 treesize of output 21 [2020-11-29 23:31:16,038 INFO L350 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2020-11-29 23:31:16,038 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 29 treesize of output 33 [2020-11-29 23:31:16,039 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:16,056 INFO L625 ElimStorePlain]: treesize reduction 13, result has 56.7 percent of original size [2020-11-29 23:31:16,056 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:16,064 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:16,064 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:16,064 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:21 [2020-11-29 23:31:16,136 INFO L350 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2020-11-29 23:31:16,136 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2020-11-29 23:31:16,137 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:16,150 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:16,151 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:16,152 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2020-11-29 23:31:16,206 INFO L350 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2020-11-29 23:31:16,206 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 23 [2020-11-29 23:31:16,207 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:16,213 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:16,213 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:16,213 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:21 [2020-11-29 23:31:16,244 INFO L350 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2020-11-29 23:31:16,244 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 23 [2020-11-29 23:31:16,245 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:16,258 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:16,258 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:16,259 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:21 [2020-11-29 23:31:16,277 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-11-29 23:31:16,278 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2020-11-29 23:31:16,278 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:16,286 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:16,287 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:16,287 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:17 [2020-11-29 23:31:16,437 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-11-29 23:31:16,437 INFO L384 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 24 treesize of output 10 [2020-11-29 23:31:16,439 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:16,440 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:16,440 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:16,441 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:3 [2020-11-29 23:31:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-29 23:31:16,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:31:16,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2020-11-29 23:31:16,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969444241] [2020-11-29 23:31:16,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-29 23:31:16,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:16,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-29 23:31:16,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2020-11-29 23:31:16,457 INFO L87 Difference]: Start difference. First operand 156 states and 177 transitions. Second operand 22 states. [2020-11-29 23:31:17,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:17,445 INFO L93 Difference]: Finished difference Result 161 states and 181 transitions. [2020-11-29 23:31:17,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-29 23:31:17,445 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2020-11-29 23:31:17,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:17,446 INFO L225 Difference]: With dead ends: 161 [2020-11-29 23:31:17,446 INFO L226 Difference]: Without dead ends: 161 [2020-11-29 23:31:17,447 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 87 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2020-11-29 23:31:17,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-11-29 23:31:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2020-11-29 23:31:17,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-11-29 23:31:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 176 transitions. [2020-11-29 23:31:17,452 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 176 transitions. Word has length 88 [2020-11-29 23:31:17,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:17,452 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 176 transitions. [2020-11-29 23:31:17,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-29 23:31:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 176 transitions. [2020-11-29 23:31:17,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-29 23:31:17,453 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:17,453 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:31:17,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 23:31:17,654 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-29 23:31:17,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:17,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1744307152, now seen corresponding path program 1 times [2020-11-29 23:31:17,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:17,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173236129] [2020-11-29 23:31:17,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:17,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:17,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:31:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-11-29 23:31:18,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173236129] [2020-11-29 23:31:18,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608920831] [2020-11-29 23:31:18,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 23:31:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:18,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 49 conjunts are in the unsatisfiable core [2020-11-29 23:31:18,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:31:18,435 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-29 23:31:18,435 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:18,440 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:18,441 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:18,441 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 23:31:18,491 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:18,491 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2020-11-29 23:31:18,491 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:18,495 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:18,496 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:18,496 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2020-11-29 23:31:18,526 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 23:31:18,527 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:18,533 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:18,534 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:18,534 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-11-29 23:31:18,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 23:31:18,578 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-11-29 23:31:18,579 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:18,587 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:18,595 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:18,595 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2020-11-29 23:31:18,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 23:31:18,607 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-11-29 23:31:18,608 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:18,615 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:18,615 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:18,615 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2020-11-29 23:31:18,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 23:31:18,625 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-11-29 23:31:18,625 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:18,633 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:18,633 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:18,634 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2020-11-29 23:31:18,647 INFO L384 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 29 treesize of output 13 [2020-11-29 23:31:18,648 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:18,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:18,658 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:18,658 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:13 [2020-11-29 23:31:18,828 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-29 23:31:18,829 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:18,831 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:18,831 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:18,831 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-11-29 23:31:18,850 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-29 23:31:18,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:31:18,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2020-11-29 23:31:18,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545918512] [2020-11-29 23:31:18,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-29 23:31:18,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:18,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-29 23:31:18,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2020-11-29 23:31:18,852 INFO L87 Difference]: Start difference. First operand 156 states and 176 transitions. Second operand 24 states. [2020-11-29 23:31:19,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:19,949 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2020-11-29 23:31:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-29 23:31:19,955 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2020-11-29 23:31:19,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:19,956 INFO L225 Difference]: With dead ends: 161 [2020-11-29 23:31:19,956 INFO L226 Difference]: Without dead ends: 161 [2020-11-29 23:31:19,957 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2020-11-29 23:31:19,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-11-29 23:31:19,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2020-11-29 23:31:19,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-11-29 23:31:19,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2020-11-29 23:31:19,962 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 90 [2020-11-29 23:31:19,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:19,962 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2020-11-29 23:31:19,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-29 23:31:19,962 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2020-11-29 23:31:19,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-29 23:31:19,964 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:19,964 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:31:20,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-11-29 23:31:20,179 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-29 23:31:20,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:20,179 INFO L82 PathProgramCache]: Analyzing trace with hash -724764429, now seen corresponding path program 1 times [2020-11-29 23:31:20,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:20,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969996508] [2020-11-29 23:31:20,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:20,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:20,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:31:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-11-29 23:31:20,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969996508] [2020-11-29 23:31:20,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390435903] [2020-11-29 23:31:20,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 23:31:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:20,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 46 conjunts are in the unsatisfiable core [2020-11-29 23:31:20,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:31:20,811 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-29 23:31:20,811 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:20,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:20,816 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:20,816 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 23:31:20,864 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:20,864 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2020-11-29 23:31:20,865 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:20,870 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:20,870 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:20,870 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2020-11-29 23:31:20,904 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2020-11-29 23:31:20,905 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:20,913 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:20,913 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:20,913 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2020-11-29 23:31:20,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 23:31:20,943 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2020-11-29 23:31:20,944 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:20,952 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:20,952 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:20,952 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2020-11-29 23:31:21,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 23:31:21,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 23:31:21,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 23:31:21,004 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2020-11-29 23:31:21,004 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:21,014 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:21,015 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:21,015 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2020-11-29 23:31:21,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 23:31:21,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 23:31:21,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 23:31:21,032 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-29 23:31:21,033 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:21,045 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:21,045 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:21,045 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2020-11-29 23:31:21,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 23:31:21,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 23:31:21,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 23:31:21,058 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-29 23:31:21,059 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:21,068 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:21,069 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:21,069 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2020-11-29 23:31:21,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 23:31:21,100 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-29 23:31:21,101 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:21,122 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:21,131 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:21,131 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:23 [2020-11-29 23:31:21,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 23:31:21,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 23:31:21,438 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 23:31:21,440 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:31:21,441 INFO L384 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 24 treesize of output 13 [2020-11-29 23:31:21,442 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:31:21,459 INFO L625 ElimStorePlain]: treesize reduction 3, result has 81.3 percent of original size [2020-11-29 23:31:21,461 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:31:21,461 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:3 [2020-11-29 23:31:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-29 23:31:21,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:31:21,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2020-11-29 23:31:21,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061467067] [2020-11-29 23:31:21,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-29 23:31:21,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:21,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-29 23:31:21,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2020-11-29 23:31:21,499 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand 24 states. [2020-11-29 23:31:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:23,966 INFO L93 Difference]: Finished difference Result 161 states and 179 transitions. [2020-11-29 23:31:23,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-29 23:31:23,967 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 91 [2020-11-29 23:31:23,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:23,968 INFO L225 Difference]: With dead ends: 161 [2020-11-29 23:31:23,968 INFO L226 Difference]: Without dead ends: 161 [2020-11-29 23:31:23,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=212, Invalid=1270, Unknown=0, NotChecked=0, Total=1482 [2020-11-29 23:31:23,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-11-29 23:31:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2020-11-29 23:31:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-11-29 23:31:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 174 transitions. [2020-11-29 23:31:23,974 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 174 transitions. Word has length 91 [2020-11-29 23:31:23,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:23,975 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 174 transitions. [2020-11-29 23:31:23,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-29 23:31:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 174 transitions. [2020-11-29 23:31:23,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-29 23:31:23,976 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:23,976 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:31:24,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-11-29 23:31:24,177 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-29 23:31:24,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:24,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1598496843, now seen corresponding path program 1 times [2020-11-29 23:31:24,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:24,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104334661] [2020-11-29 23:31:24,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:31:24,253 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:31:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:31:24,337 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:31:24,396 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:31:24,397 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 23:31:24,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-29 23:31:24,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 11:31:24 BoogieIcfgContainer [2020-11-29 23:31:24,494 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 23:31:24,494 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 23:31:24,494 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 23:31:24,494 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 23:31:24,495 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:31:04" (3/4) ... [2020-11-29 23:31:24,497 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 23:31:24,565 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_12ebc774-b4bf-43cc-a244-df8cb26aa468/bin/uautomizer/witness.graphml [2020-11-29 23:31:24,566 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 23:31:24,567 INFO L168 Benchmark]: Toolchain (without parser) took 21647.46 ms. Allocated memory was 96.5 MB in the beginning and 333.4 MB in the end (delta: 237.0 MB). Free memory was 64.9 MB in the beginning and 241.3 MB in the end (delta: -176.4 MB). Peak memory consumption was 60.6 MB. Max. memory is 16.1 GB. [2020-11-29 23:31:24,567 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 79.7 MB. Free memory was 51.1 MB in the beginning and 51.1 MB in the end (delta: 29.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 23:31:24,567 INFO L168 Benchmark]: CACSL2BoogieTranslator took 477.75 ms. Allocated memory is still 96.5 MB. Free memory was 64.4 MB in the beginning and 61.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 23:31:24,568 INFO L168 Benchmark]: Boogie Preprocessor took 102.00 ms. Allocated memory is still 96.5 MB. Free memory was 61.8 MB in the beginning and 58.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 23:31:24,568 INFO L168 Benchmark]: RCFGBuilder took 864.78 ms. Allocated memory is still 96.5 MB. Free memory was 58.9 MB in the beginning and 44.5 MB in the end (delta: 14.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 16.1 GB. [2020-11-29 23:31:24,569 INFO L168 Benchmark]: TraceAbstraction took 20119.53 ms. Allocated memory was 96.5 MB in the beginning and 333.4 MB in the end (delta: 237.0 MB). Free memory was 44.0 MB in the beginning and 247.6 MB in the end (delta: -203.7 MB). Peak memory consumption was 35.1 MB. Max. memory is 16.1 GB. [2020-11-29 23:31:24,569 INFO L168 Benchmark]: Witness Printer took 71.70 ms. Allocated memory is still 333.4 MB. Free memory was 247.6 MB in the beginning and 241.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-29 23:31:24,571 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.28 ms. Allocated memory is still 79.7 MB. Free memory was 51.1 MB in the beginning and 51.1 MB in the end (delta: 29.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 477.75 ms. Allocated memory is still 96.5 MB. Free memory was 64.4 MB in the beginning and 61.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 102.00 ms. Allocated memory is still 96.5 MB. Free memory was 61.8 MB in the beginning and 58.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 864.78 ms. Allocated memory is still 96.5 MB. Free memory was 58.9 MB in the beginning and 44.5 MB in the end (delta: 14.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20119.53 ms. Allocated memory was 96.5 MB in the beginning and 333.4 MB in the end (delta: 237.0 MB). Free memory was 44.0 MB in the beginning and 247.6 MB in the end (delta: -203.7 MB). Peak memory consumption was 35.1 MB. Max. memory is 16.1 GB. * Witness Printer took 71.70 ms. Allocated memory is still 333.4 MB. Free memory was 247.6 MB in the beginning and 241.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L599] const int len = 5; VAL [len=5] [L600] CALL, EXPR dll_create(len) VAL [\old(len)=5] [L579] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L588] new_head->next = head VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L590] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L580] COND FALSE !(len > 0) VAL [\old(len)=5, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L596] return head; VAL [\old(len)=5, \result={-5:0}, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L600] RET, EXPR dll_create(len) VAL [dll_create(len)={-5:0}, len=5] [L600] DLL head = dll_create(len); [L601] head->next VAL [head={-5:0}, head->next={-4:0}, len=5] [L601] COND TRUE head->next [L602] EXPR head->data_0 VAL [head={-5:0}, head->data_0=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, len=5] [L602] EXPR head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L616] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "dll_nullified-1.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 111 locations, 35 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.9s, OverallIterations: 16, TraceHistogramMax: 5, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1037 SDtfs, 1412 SDslu, 5091 SDs, 0 SdLazy, 5384 SolverSat, 291 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 512 SyntacticMatches, 12 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 172 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1298 NumberOfCodeBlocks, 1298 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1183 ConstructedInterpolants, 11 QuantifiedInterpolants, 381188 SizeOfPredicates, 79 NumberOfNonLiveVariables, 2738 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 965/1339 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! Received shutdown request...