./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/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 d9f9c3b0fdd5428a38e0eab9236fadbdbb3aa880 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.1.25-f470102 [2019-12-07 18:09:28,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:09:28,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:09:28,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:09:28,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:09:28,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:09:28,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:09:28,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:09:28,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:09:28,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:09:28,442 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:09:28,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:09:28,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:09:28,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:09:28,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:09:28,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:09:28,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:09:28,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:09:28,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:09:28,449 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:09:28,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:09:28,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:09:28,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:09:28,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:09:28,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:09:28,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:09:28,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:09:28,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:09:28,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:09:28,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:09:28,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:09:28,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:09:28,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:09:28,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:09:28,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:09:28,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:09:28,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:09:28,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:09:28,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:09:28,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:09:28,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:09:28,459 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-12-07 18:09:28,469 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:09:28,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:09:28,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:09:28,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:09:28,470 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:09:28,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:09:28,470 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:09:28,470 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:09:28,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:09:28,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:09:28,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:09:28,471 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 18:09:28,471 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 18:09:28,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:09:28,471 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 18:09:28,471 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:09:28,471 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:09:28,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:09:28,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:09:28,472 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:09:28,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:09:28,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:09:28,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:09:28,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:09:28,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:09:28,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:09:28,473 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:09:28,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_caceacf9-2252-4db1-904c-1a76d893af52/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 -> d9f9c3b0fdd5428a38e0eab9236fadbdbb3aa880 [2019-12-07 18:09:28,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:09:28,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:09:28,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:09:28,581 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:09:28,581 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:09:28,582 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2019-12-07 18:09:28,618 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/data/b06de6c30/9a386f16b55746b29053624636ca1d1a/FLAG85bb4600b [2019-12-07 18:09:29,129 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:09:29,129 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2019-12-07 18:09:29,137 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/data/b06de6c30/9a386f16b55746b29053624636ca1d1a/FLAG85bb4600b [2019-12-07 18:09:29,651 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/data/b06de6c30/9a386f16b55746b29053624636ca1d1a [2019-12-07 18:09:29,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:09:29,655 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 18:09:29,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:09:29,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:09:29,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:09:29,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:09:29" (1/1) ... [2019-12-07 18:09:29,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7066884f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:29, skipping insertion in model container [2019-12-07 18:09:29,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:09:29" (1/1) ... [2019-12-07 18:09:29,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:09:29,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:09:29,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:09:29,921 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:09:29,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:09:29,976 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:09:29,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:29 WrapperNode [2019-12-07 18:09:29,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:09:29,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:09:29,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:09:29,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:09:29,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:29" (1/1) ... [2019-12-07 18:09:29,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:29" (1/1) ... [2019-12-07 18:09:29,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:29" (1/1) ... [2019-12-07 18:09:29,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:29" (1/1) ... [2019-12-07 18:09:30,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:29" (1/1) ... [2019-12-07 18:09:30,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:29" (1/1) ... [2019-12-07 18:09:30,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:29" (1/1) ... [2019-12-07 18:09:30,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:09:30,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:09:30,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:09:30,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:09:30,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/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 [2019-12-07 18:09:30,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 18:09:30,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:09:30,059 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 18:09:30,059 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 18:09:30,059 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 18:09:30,059 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 18:09:30,059 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 18:09:30,059 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 18:09:30,059 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 18:09:30,059 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 18:09:30,059 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 18:09:30,059 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 18:09:30,059 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 18:09:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 18:09:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 18:09:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 18:09:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 18:09:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 18:09:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 18:09:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 18:09:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 18:09:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 18:09:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 18:09:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 18:09:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 18:09:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 18:09:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 18:09:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 18:09:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 18:09:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 18:09:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 18:09:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 18:09:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 18:09:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 18:09:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 18:09:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 18:09:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 18:09:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 18:09:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 18:09:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 18:09:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 18:09:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 18:09:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 18:09:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 18:09:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 18:09:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 18:09:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 18:09:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 18:09:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 18:09:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 18:09:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 18:09:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 18:09:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 18:09:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 18:09:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 18:09:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 18:09:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 18:09:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 18:09:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 18:09:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 18:09:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 18:09:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 18:09:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 18:09:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 18:09:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 18:09:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 18:09:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 18:09:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 18:09:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 18:09:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 18:09:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 18:09:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 18:09:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 18:09:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 18:09:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 18:09:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 18:09:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 18:09:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 18:09:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 18:09:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 18:09:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 18:09:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 18:09:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 18:09:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 18:09:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 18:09:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 18:09:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 18:09:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 18:09:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 18:09:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 18:09:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 18:09:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 18:09:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 18:09:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 18:09:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 18:09:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 18:09:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 18:09:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 18:09:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 18:09:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 18:09:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 18:09:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 18:09:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 18:09:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 18:09:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 18:09:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 18:09:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 18:09:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 18:09:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 18:09:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:09:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:09:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:09:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:09:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:09:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:09:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 18:09:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:09:30,421 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:09:30,421 INFO L287 CfgBuilder]: Removed 11 assume(true) statements. [2019-12-07 18:09:30,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:09:30 BoogieIcfgContainer [2019-12-07 18:09:30,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:09:30,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:09:30,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:09:30,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:09:30,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:09:29" (1/3) ... [2019-12-07 18:09:30,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a801ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:09:30, skipping insertion in model container [2019-12-07 18:09:30,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:29" (2/3) ... [2019-12-07 18:09:30,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a801ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:09:30, skipping insertion in model container [2019-12-07 18:09:30,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:09:30" (3/3) ... [2019-12-07 18:09:30,427 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-2.i [2019-12-07 18:09:30,433 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:09:30,438 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 61 error locations. [2019-12-07 18:09:30,446 INFO L249 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2019-12-07 18:09:30,458 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:09:30,459 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 18:09:30,459 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:09:30,459 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:09:30,459 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:09:30,459 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:09:30,459 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:09:30,459 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:09:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2019-12-07 18:09:30,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 18:09:30,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:30,479 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:30,479 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:30,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:30,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1914108980, now seen corresponding path program 1 times [2019-12-07 18:09:30,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:30,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810215692] [2019-12-07 18:09:30,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:30,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810215692] [2019-12-07 18:09:30,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:30,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:09:30,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397080774] [2019-12-07 18:09:30,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:09:30,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:30,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:09:30,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:09:30,621 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 4 states. [2019-12-07 18:09:30,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:30,865 INFO L93 Difference]: Finished difference Result 164 states and 171 transitions. [2019-12-07 18:09:30,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:09:30,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 18:09:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:30,873 INFO L225 Difference]: With dead ends: 164 [2019-12-07 18:09:30,874 INFO L226 Difference]: Without dead ends: 161 [2019-12-07 18:09:30,875 INFO L630 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 [2019-12-07 18:09:30,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-12-07 18:09:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2019-12-07 18:09:30,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-07 18:09:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2019-12-07 18:09:30,907 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 7 [2019-12-07 18:09:30,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:30,908 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2019-12-07 18:09:30,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:09:30,908 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2019-12-07 18:09:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 18:09:30,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:30,908 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:30,909 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:30,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:30,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1914108979, now seen corresponding path program 1 times [2019-12-07 18:09:30,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:30,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222730942] [2019-12-07 18:09:30,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:30,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222730942] [2019-12-07 18:09:30,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:30,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:09:30,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468684352] [2019-12-07 18:09:30,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:09:30,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:30,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:09:30,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:09:30,952 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 4 states. [2019-12-07 18:09:31,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:31,108 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2019-12-07 18:09:31,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:09:31,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 18:09:31,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:31,110 INFO L225 Difference]: With dead ends: 132 [2019-12-07 18:09:31,110 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 18:09:31,111 INFO L630 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 [2019-12-07 18:09:31,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 18:09:31,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-12-07 18:09:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-07 18:09:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2019-12-07 18:09:31,118 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 7 [2019-12-07 18:09:31,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:31,118 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2019-12-07 18:09:31,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:09:31,119 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2019-12-07 18:09:31,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 18:09:31,119 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:31,119 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:31,120 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:31,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:31,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1060142077, now seen corresponding path program 1 times [2019-12-07 18:09:31,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:31,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500063217] [2019-12-07 18:09:31,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:31,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500063217] [2019-12-07 18:09:31,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:31,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:09:31,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829905905] [2019-12-07 18:09:31,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:09:31,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:31,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:09:31,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:09:31,163 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 4 states. [2019-12-07 18:09:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:31,316 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2019-12-07 18:09:31,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:09:31,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 18:09:31,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:31,317 INFO L225 Difference]: With dead ends: 129 [2019-12-07 18:09:31,318 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 18:09:31,318 INFO L630 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 [2019-12-07 18:09:31,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 18:09:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2019-12-07 18:09:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 18:09:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2019-12-07 18:09:31,324 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 10 [2019-12-07 18:09:31,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:31,324 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2019-12-07 18:09:31,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:09:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2019-12-07 18:09:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 18:09:31,325 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:31,325 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:31,325 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:31,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:31,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1060142078, now seen corresponding path program 1 times [2019-12-07 18:09:31,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:31,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117330127] [2019-12-07 18:09:31,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:31,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117330127] [2019-12-07 18:09:31,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:31,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:09:31,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146278352] [2019-12-07 18:09:31,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:09:31,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:31,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:09:31,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:09:31,365 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 4 states. [2019-12-07 18:09:31,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:31,525 INFO L93 Difference]: Finished difference Result 145 states and 151 transitions. [2019-12-07 18:09:31,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:09:31,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 18:09:31,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:31,526 INFO L225 Difference]: With dead ends: 145 [2019-12-07 18:09:31,526 INFO L226 Difference]: Without dead ends: 145 [2019-12-07 18:09:31,526 INFO L630 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 [2019-12-07 18:09:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-12-07 18:09:31,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2019-12-07 18:09:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-07 18:09:31,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2019-12-07 18:09:31,532 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 10 [2019-12-07 18:09:31,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:31,532 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2019-12-07 18:09:31,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:09:31,533 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2019-12-07 18:09:31,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:09:31,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:31,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:31,533 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:31,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:31,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1369991960, now seen corresponding path program 1 times [2019-12-07 18:09:31,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:31,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518190238] [2019-12-07 18:09:31,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:31,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518190238] [2019-12-07 18:09:31,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:31,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:09:31,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611564833] [2019-12-07 18:09:31,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:09:31,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:31,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:09:31,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:09:31,589 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 5 states. [2019-12-07 18:09:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:31,751 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2019-12-07 18:09:31,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:09:31,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-07 18:09:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:31,752 INFO L225 Difference]: With dead ends: 136 [2019-12-07 18:09:31,752 INFO L226 Difference]: Without dead ends: 136 [2019-12-07 18:09:31,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:09:31,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-12-07 18:09:31,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 123. [2019-12-07 18:09:31,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-07 18:09:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2019-12-07 18:09:31,758 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 15 [2019-12-07 18:09:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:31,758 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2019-12-07 18:09:31,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:09:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2019-12-07 18:09:31,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:09:31,759 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:31,759 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:31,759 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:31,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:31,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1369991961, now seen corresponding path program 1 times [2019-12-07 18:09:31,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:31,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13760801] [2019-12-07 18:09:31,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:31,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13760801] [2019-12-07 18:09:31,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:31,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:09:31,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521071740] [2019-12-07 18:09:31,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:09:31,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:31,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:09:31,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:09:31,821 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand 5 states. [2019-12-07 18:09:31,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:31,995 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2019-12-07 18:09:31,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:09:31,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-07 18:09:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:31,996 INFO L225 Difference]: With dead ends: 159 [2019-12-07 18:09:31,996 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 18:09:31,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:09:31,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 18:09:32,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 129. [2019-12-07 18:09:32,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 18:09:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2019-12-07 18:09:32,002 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 15 [2019-12-07 18:09:32,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:32,002 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2019-12-07 18:09:32,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:09:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2019-12-07 18:09:32,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:09:32,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:32,003 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:32,004 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:32,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:32,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1992706078, now seen corresponding path program 1 times [2019-12-07 18:09:32,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:32,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788564150] [2019-12-07 18:09:32,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:32,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788564150] [2019-12-07 18:09:32,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:32,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:09:32,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358614407] [2019-12-07 18:09:32,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:09:32,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:32,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:09:32,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:09:32,044 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand 6 states. [2019-12-07 18:09:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:32,223 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2019-12-07 18:09:32,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:09:32,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-07 18:09:32,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:32,225 INFO L225 Difference]: With dead ends: 168 [2019-12-07 18:09:32,225 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 18:09:32,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:09:32,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 18:09:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 130. [2019-12-07 18:09:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 18:09:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2019-12-07 18:09:32,231 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 17 [2019-12-07 18:09:32,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:32,231 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2019-12-07 18:09:32,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:09:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2019-12-07 18:09:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:09:32,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:32,232 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:32,232 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:32,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:32,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1643733431, now seen corresponding path program 1 times [2019-12-07 18:09:32,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:32,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796657048] [2019-12-07 18:09:32,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:32,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796657048] [2019-12-07 18:09:32,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:32,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:09:32,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423319423] [2019-12-07 18:09:32,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:09:32,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:32,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:09:32,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:09:32,279 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand 7 states. [2019-12-07 18:09:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:32,541 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2019-12-07 18:09:32,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:09:32,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-07 18:09:32,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:32,542 INFO L225 Difference]: With dead ends: 179 [2019-12-07 18:09:32,542 INFO L226 Difference]: Without dead ends: 179 [2019-12-07 18:09:32,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:09:32,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-12-07 18:09:32,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 129. [2019-12-07 18:09:32,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 18:09:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2019-12-07 18:09:32,546 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 18 [2019-12-07 18:09:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:32,546 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2019-12-07 18:09:32,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:09:32,546 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2019-12-07 18:09:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:09:32,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:32,547 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:32,547 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:32,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:32,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1643733430, now seen corresponding path program 1 times [2019-12-07 18:09:32,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:32,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926474096] [2019-12-07 18:09:32,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:32,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926474096] [2019-12-07 18:09:32,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:32,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:09:32,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805880540] [2019-12-07 18:09:32,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:09:32,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:32,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:09:32,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:09:32,598 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand 7 states. [2019-12-07 18:09:32,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:32,959 INFO L93 Difference]: Finished difference Result 217 states and 237 transitions. [2019-12-07 18:09:32,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:09:32,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-07 18:09:32,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:32,960 INFO L225 Difference]: With dead ends: 217 [2019-12-07 18:09:32,961 INFO L226 Difference]: Without dead ends: 217 [2019-12-07 18:09:32,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:09:32,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-12-07 18:09:32,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 124. [2019-12-07 18:09:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-12-07 18:09:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2019-12-07 18:09:32,965 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 18 [2019-12-07 18:09:32,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:32,965 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2019-12-07 18:09:32,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:09:32,966 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2019-12-07 18:09:32,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:09:32,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:32,966 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:32,967 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:32,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:32,967 INFO L82 PathProgramCache]: Analyzing trace with hash 335185780, now seen corresponding path program 1 times [2019-12-07 18:09:32,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:32,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825728380] [2019-12-07 18:09:32,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:33,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825728380] [2019-12-07 18:09:33,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:33,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:09:33,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104154513] [2019-12-07 18:09:33,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:09:33,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:33,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:09:33,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:09:33,076 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 9 states. [2019-12-07 18:09:33,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:33,383 INFO L93 Difference]: Finished difference Result 184 states and 200 transitions. [2019-12-07 18:09:33,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:09:33,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-12-07 18:09:33,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:33,384 INFO L225 Difference]: With dead ends: 184 [2019-12-07 18:09:33,384 INFO L226 Difference]: Without dead ends: 184 [2019-12-07 18:09:33,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:09:33,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-07 18:09:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 131. [2019-12-07 18:09:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-12-07 18:09:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2019-12-07 18:09:33,387 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 20 [2019-12-07 18:09:33,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:33,388 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2019-12-07 18:09:33,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:09:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2019-12-07 18:09:33,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:09:33,388 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:33,388 INFO L410 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] [2019-12-07 18:09:33,389 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:33,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:33,389 INFO L82 PathProgramCache]: Analyzing trace with hash -921390664, now seen corresponding path program 1 times [2019-12-07 18:09:33,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:33,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547969173] [2019-12-07 18:09:33,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:33,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547969173] [2019-12-07 18:09:33,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:33,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:09:33,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304323075] [2019-12-07 18:09:33,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:09:33,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:33,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:09:33,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:09:33,435 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand 7 states. [2019-12-07 18:09:33,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:33,748 INFO L93 Difference]: Finished difference Result 192 states and 210 transitions. [2019-12-07 18:09:33,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:09:33,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-12-07 18:09:33,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:33,749 INFO L225 Difference]: With dead ends: 192 [2019-12-07 18:09:33,750 INFO L226 Difference]: Without dead ends: 192 [2019-12-07 18:09:33,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:09:33,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-12-07 18:09:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 130. [2019-12-07 18:09:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 18:09:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2019-12-07 18:09:33,754 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 26 [2019-12-07 18:09:33,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:33,754 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2019-12-07 18:09:33,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:09:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2019-12-07 18:09:33,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:09:33,755 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:33,755 INFO L410 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] [2019-12-07 18:09:33,756 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:33,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:33,756 INFO L82 PathProgramCache]: Analyzing trace with hash -921390663, now seen corresponding path program 1 times [2019-12-07 18:09:33,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:33,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23486627] [2019-12-07 18:09:33,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:33,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23486627] [2019-12-07 18:09:33,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:33,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:09:33,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842284858] [2019-12-07 18:09:33,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:09:33,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:33,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:09:33,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:09:33,818 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 7 states. [2019-12-07 18:09:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:34,148 INFO L93 Difference]: Finished difference Result 226 states and 248 transitions. [2019-12-07 18:09:34,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:09:34,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-12-07 18:09:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:34,149 INFO L225 Difference]: With dead ends: 226 [2019-12-07 18:09:34,150 INFO L226 Difference]: Without dead ends: 226 [2019-12-07 18:09:34,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:09:34,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-12-07 18:09:34,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 122. [2019-12-07 18:09:34,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-07 18:09:34,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2019-12-07 18:09:34,155 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 26 [2019-12-07 18:09:34,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:34,156 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2019-12-07 18:09:34,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:09:34,156 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2019-12-07 18:09:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:09:34,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:34,157 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:34,158 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:34,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:34,158 INFO L82 PathProgramCache]: Analyzing trace with hash 2099314640, now seen corresponding path program 1 times [2019-12-07 18:09:34,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:34,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837073101] [2019-12-07 18:09:34,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:34,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:34,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837073101] [2019-12-07 18:09:34,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922318294] [2019-12-07 18:09:34,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/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 [2019-12-07 18:09:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:34,294 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 18:09:34,298 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:09:34,337 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:09:34,338 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:34,343 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:34,345 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:09:34,345 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:34,349 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:34,349 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:34,349 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-12-07 18:09:34,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:09:34,358 INFO L377 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 27 treesize of output 11 [2019-12-07 18:09:34,358 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:34,364 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:34,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:09:34,367 INFO L377 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 27 treesize of output 11 [2019-12-07 18:09:34,368 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:34,371 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:34,371 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:34,371 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:15 [2019-12-07 18:09:34,378 INFO L377 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 [2019-12-07 18:09:34,378 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:34,382 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:34,384 INFO L377 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 [2019-12-07 18:09:34,384 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:34,387 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:34,387 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:34,387 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-12-07 18:09:34,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:34,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:09:34,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2019-12-07 18:09:34,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535553566] [2019-12-07 18:09:34,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:09:34,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:34,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:09:34,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:09:34,391 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 7 states. [2019-12-07 18:09:34,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:34,623 INFO L93 Difference]: Finished difference Result 173 states and 188 transitions. [2019-12-07 18:09:34,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:09:34,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-12-07 18:09:34,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:34,624 INFO L225 Difference]: With dead ends: 173 [2019-12-07 18:09:34,624 INFO L226 Difference]: Without dead ends: 173 [2019-12-07 18:09:34,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:09:34,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-12-07 18:09:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 129. [2019-12-07 18:09:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 18:09:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2019-12-07 18:09:34,628 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 27 [2019-12-07 18:09:34,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:34,628 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2019-12-07 18:09:34,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:09:34,628 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2019-12-07 18:09:34,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:09:34,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:34,629 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:34,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:09:34,830 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:34,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:34,831 INFO L82 PathProgramCache]: Analyzing trace with hash 2057296387, now seen corresponding path program 1 times [2019-12-07 18:09:34,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:34,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777121834] [2019-12-07 18:09:34,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:34,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777121834] [2019-12-07 18:09:34,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:34,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:09:34,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847498324] [2019-12-07 18:09:34,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:09:34,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:34,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:09:34,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:09:34,926 INFO L87 Difference]: Start difference. First operand 129 states and 141 transitions. Second operand 6 states. [2019-12-07 18:09:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:35,062 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2019-12-07 18:09:35,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:09:35,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 18:09:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:35,064 INFO L225 Difference]: With dead ends: 132 [2019-12-07 18:09:35,064 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 18:09:35,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:09:35,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 18:09:35,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2019-12-07 18:09:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-07 18:09:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2019-12-07 18:09:35,067 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 27 [2019-12-07 18:09:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:35,067 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2019-12-07 18:09:35,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:09:35,067 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2019-12-07 18:09:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:09:35,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:35,068 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:35,068 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:35,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:35,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1316710797, now seen corresponding path program 1 times [2019-12-07 18:09:35,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:35,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003453540] [2019-12-07 18:09:35,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:35,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003453540] [2019-12-07 18:09:35,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964006518] [2019-12-07 18:09:35,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/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 [2019-12-07 18:09:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:35,424 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 18:09:35,426 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:09:35,449 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:09:35,450 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:35,453 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:35,454 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:35,454 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 18:09:35,492 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:35,492 INFO L377 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 [2019-12-07 18:09:35,493 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:35,498 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:35,499 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:35,499 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-12-07 18:09:35,520 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_34|], 2=[|v_#memory_int_30|]} [2019-12-07 18:09:35,523 INFO L377 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 [2019-12-07 18:09:35,523 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:35,533 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:35,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:09:35,536 INFO L377 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 25 treesize of output 13 [2019-12-07 18:09:35,536 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:35,543 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:35,544 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:35,544 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:27 [2019-12-07 18:09:35,567 INFO L377 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 16 treesize of output 8 [2019-12-07 18:09:35,568 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:35,572 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:35,572 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:35,572 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:17 [2019-12-07 18:09:35,605 INFO L377 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 25 treesize of output 13 [2019-12-07 18:09:35,605 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:35,609 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:35,609 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:35,609 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-12-07 18:09:35,613 INFO L377 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 23 treesize of output 22 [2019-12-07 18:09:35,614 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:35,619 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:35,620 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:09:35,620 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2019-12-07 18:09:35,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-12-07 18:09:35,678 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:35,681 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:35,681 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:35,681 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-12-07 18:09:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:35,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:09:35,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 27 [2019-12-07 18:09:35,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564730873] [2019-12-07 18:09:35,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 18:09:35,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:35,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 18:09:35,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:09:35,687 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 27 states. [2019-12-07 18:09:36,683 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2019-12-07 18:09:38,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:38,725 INFO L93 Difference]: Finished difference Result 223 states and 238 transitions. [2019-12-07 18:09:38,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 18:09:38,726 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 29 [2019-12-07 18:09:38,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:38,730 INFO L225 Difference]: With dead ends: 223 [2019-12-07 18:09:38,730 INFO L226 Difference]: Without dead ends: 223 [2019-12-07 18:09:38,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 18:09:38,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-12-07 18:09:38,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 142. [2019-12-07 18:09:38,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-12-07 18:09:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2019-12-07 18:09:38,737 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 29 [2019-12-07 18:09:38,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:38,737 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2019-12-07 18:09:38,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 18:09:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2019-12-07 18:09:38,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:09:38,738 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:38,738 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:38,939 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:09:38,940 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:38,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:38,941 INFO L82 PathProgramCache]: Analyzing trace with hash 481366203, now seen corresponding path program 1 times [2019-12-07 18:09:38,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:38,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819558920] [2019-12-07 18:09:38,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:39,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819558920] [2019-12-07 18:09:39,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246870761] [2019-12-07 18:09:39,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/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 [2019-12-07 18:09:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:39,068 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:09:39,070 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:09:39,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:09:39,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:09:39,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2019-12-07 18:09:39,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457868883] [2019-12-07 18:09:39,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:09:39,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:39,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:09:39,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:09:39,083 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand 3 states. [2019-12-07 18:09:39,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:39,117 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2019-12-07 18:09:39,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:09:39,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 18:09:39,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:39,118 INFO L225 Difference]: With dead ends: 143 [2019-12-07 18:09:39,118 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 18:09:39,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:09:39,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 18:09:39,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-12-07 18:09:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 18:09:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2019-12-07 18:09:39,121 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 33 [2019-12-07 18:09:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:39,121 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2019-12-07 18:09:39,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:09:39,121 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2019-12-07 18:09:39,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:09:39,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:39,121 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:39,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:09:39,323 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:39,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:39,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1263539682, now seen corresponding path program 1 times [2019-12-07 18:09:39,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:39,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984196865] [2019-12-07 18:09:39,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:39,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984196865] [2019-12-07 18:09:39,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049670626] [2019-12-07 18:09:39,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/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 [2019-12-07 18:09:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:39,536 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:09:39,537 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:09:39,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:09:39,541 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:39,543 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:39,543 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:39,543 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:09:39,548 INFO L377 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 19 treesize of output 7 [2019-12-07 18:09:39,548 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:39,550 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:39,550 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:39,551 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 18:09:39,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:09:39,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:09:39,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2019-12-07 18:09:39,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829722231] [2019-12-07 18:09:39,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:09:39,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:39,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:09:39,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:09:39,568 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 4 states. [2019-12-07 18:09:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:39,630 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2019-12-07 18:09:39,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:09:39,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 18:09:39,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:39,631 INFO L225 Difference]: With dead ends: 151 [2019-12-07 18:09:39,631 INFO L226 Difference]: Without dead ends: 151 [2019-12-07 18:09:39,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:09:39,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-12-07 18:09:39,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2019-12-07 18:09:39,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 18:09:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2019-12-07 18:09:39,635 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 35 [2019-12-07 18:09:39,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:39,636 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2019-12-07 18:09:39,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:09:39,636 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2019-12-07 18:09:39,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:09:39,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:39,637 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:39,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:09:39,838 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:39,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:39,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1190295610, now seen corresponding path program 1 times [2019-12-07 18:09:39,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:39,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145555935] [2019-12-07 18:09:39,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:40,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145555935] [2019-12-07 18:09:40,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647858855] [2019-12-07 18:09:40,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/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 [2019-12-07 18:09:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:40,360 INFO L264 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 18:09:40,362 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:09:40,380 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:09:40,380 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,384 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:40,384 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,384 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 18:09:40,426 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:40,426 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 18:09:40,426 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,445 INFO L614 ElimStorePlain]: treesize reduction 14, result has 70.2 percent of original size [2019-12-07 18:09:40,446 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,446 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2019-12-07 18:09:40,477 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_35|], 2=[|v_#memory_int_35|]} [2019-12-07 18:09:40,482 INFO L377 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 [2019-12-07 18:09:40,482 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,502 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:40,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:09:40,507 INFO L377 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 25 treesize of output 13 [2019-12-07 18:09:40,507 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,522 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:40,523 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,523 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:41 [2019-12-07 18:09:40,581 INFO L377 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 25 treesize of output 13 [2019-12-07 18:09:40,581 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,594 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:40,594 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,595 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-12-07 18:09:40,644 INFO L377 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 25 treesize of output 13 [2019-12-07 18:09:40,645 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,651 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:40,651 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,651 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:27 [2019-12-07 18:09:40,654 INFO L377 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 23 treesize of output 22 [2019-12-07 18:09:40,655 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,662 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:40,662 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,663 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-12-07 18:09:40,694 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:40,695 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 16 treesize of output 26 [2019-12-07 18:09:40,695 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,703 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:40,703 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,703 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:34 [2019-12-07 18:09:40,727 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_36|], 6=[|v_#memory_int_38|]} [2019-12-07 18:09:40,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2019-12-07 18:09:40,730 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,742 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:40,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:09:40,745 INFO L377 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 34 treesize of output 25 [2019-12-07 18:09:40,745 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,754 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:40,754 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,754 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2019-12-07 18:09:40,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 24 treesize of output 12 [2019-12-07 18:09:40,783 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,790 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:40,791 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:09:40,791 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:34 [2019-12-07 18:09:40,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2019-12-07 18:09:40,860 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,868 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:40,869 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:09:40,869 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:34 [2019-12-07 18:09:40,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-12-07 18:09:40,902 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,910 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:40,911 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 18:09:40,911 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:43 [2019-12-07 18:09:40,984 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-12-07 18:09:40,984 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,989 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:40,989 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:40,989 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-12-07 18:09:40,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:40,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:09:40,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 36 [2019-12-07 18:09:40,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360833054] [2019-12-07 18:09:40,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 18:09:40,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:40,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 18:09:40,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1073, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 18:09:40,996 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand 36 states. [2019-12-07 18:09:42,467 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-12-07 18:09:45,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:45,446 INFO L93 Difference]: Finished difference Result 260 states and 278 transitions. [2019-12-07 18:09:45,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 18:09:45,447 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-12-07 18:09:45,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:45,448 INFO L225 Difference]: With dead ends: 260 [2019-12-07 18:09:45,448 INFO L226 Difference]: Without dead ends: 260 [2019-12-07 18:09:45,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=582, Invalid=2610, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 18:09:45,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-12-07 18:09:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 153. [2019-12-07 18:09:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-07 18:09:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2019-12-07 18:09:45,453 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 35 [2019-12-07 18:09:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:45,453 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2019-12-07 18:09:45,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 18:09:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2019-12-07 18:09:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 18:09:45,454 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:45,454 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:45,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:09:45,655 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:45,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:45,656 INFO L82 PathProgramCache]: Analyzing trace with hash -2126823319, now seen corresponding path program 1 times [2019-12-07 18:09:45,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:45,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528843053] [2019-12-07 18:09:45,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:45,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528843053] [2019-12-07 18:09:45,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807827633] [2019-12-07 18:09:45,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/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 [2019-12-07 18:09:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:45,828 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 18:09:45,829 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:09:45,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2019-12-07 18:09:45,841 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:45,844 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:45,845 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2019-12-07 18:09:45,846 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:45,847 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:45,847 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:45,847 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:3 [2019-12-07 18:09:45,902 INFO L377 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 [2019-12-07 18:09:45,902 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:45,907 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:45,909 INFO L377 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 [2019-12-07 18:09:45,909 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:45,912 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:45,912 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:45,912 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2019-12-07 18:09:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:45,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:09:45,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2019-12-07 18:09:45,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292318964] [2019-12-07 18:09:45,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 18:09:45,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:45,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 18:09:45,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:09:45,941 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand 17 states. [2019-12-07 18:09:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:46,590 INFO L93 Difference]: Finished difference Result 207 states and 221 transitions. [2019-12-07 18:09:46,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 18:09:46,590 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-12-07 18:09:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:46,591 INFO L225 Difference]: With dead ends: 207 [2019-12-07 18:09:46,591 INFO L226 Difference]: Without dead ends: 207 [2019-12-07 18:09:46,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2019-12-07 18:09:46,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-12-07 18:09:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 164. [2019-12-07 18:09:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-07 18:09:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2019-12-07 18:09:46,595 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 36 [2019-12-07 18:09:46,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:46,595 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2019-12-07 18:09:46,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 18:09:46,595 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2019-12-07 18:09:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 18:09:46,596 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:46,596 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:46,796 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:09:46,797 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:46,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:46,798 INFO L82 PathProgramCache]: Analyzing trace with hash 974578673, now seen corresponding path program 1 times [2019-12-07 18:09:46,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:46,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103830415] [2019-12-07 18:09:46,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:46,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103830415] [2019-12-07 18:09:46,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367025600] [2019-12-07 18:09:46,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/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 [2019-12-07 18:09:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:47,002 INFO L264 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 18:09:47,003 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:09:47,016 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:47,016 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 18:09:47,016 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:47,029 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 18:09:47,030 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:47,030 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-12-07 18:09:47,047 INFO L377 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 [2019-12-07 18:09:47,047 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:47,054 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:47,054 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:47,054 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-12-07 18:09:47,115 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:47,116 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-12-07 18:09:47,116 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:47,130 INFO L614 ElimStorePlain]: treesize reduction 24, result has 54.7 percent of original size [2019-12-07 18:09:47,131 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:47,131 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:22 [2019-12-07 18:09:47,157 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:47,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 69 [2019-12-07 18:09:47,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:09:47,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:09:47,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:09:47,160 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 18:09:47,179 INFO L614 ElimStorePlain]: treesize reduction 61, result has 27.4 percent of original size [2019-12-07 18:09:47,179 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:47,179 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:23 [2019-12-07 18:09:47,219 INFO L377 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 25 treesize of output 13 [2019-12-07 18:09:47,220 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:47,223 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:47,224 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:09:47,224 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:15 [2019-12-07 18:09:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:47,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:09:47,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2019-12-07 18:09:47,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805745225] [2019-12-07 18:09:47,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 18:09:47,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:47,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 18:09:47,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:09:47,266 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand 22 states. [2019-12-07 18:09:47,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:47,918 INFO L93 Difference]: Finished difference Result 253 states and 274 transitions. [2019-12-07 18:09:47,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 18:09:47,919 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2019-12-07 18:09:47,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:47,920 INFO L225 Difference]: With dead ends: 253 [2019-12-07 18:09:47,920 INFO L226 Difference]: Without dead ends: 253 [2019-12-07 18:09:47,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2019-12-07 18:09:47,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-12-07 18:09:47,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 179. [2019-12-07 18:09:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-12-07 18:09:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 195 transitions. [2019-12-07 18:09:47,923 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 195 transitions. Word has length 36 [2019-12-07 18:09:47,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:47,923 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 195 transitions. [2019-12-07 18:09:47,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 18:09:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 195 transitions. [2019-12-07 18:09:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 18:09:47,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:47,924 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:48,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:09:48,126 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:48,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:48,126 INFO L82 PathProgramCache]: Analyzing trace with hash 974578674, now seen corresponding path program 1 times [2019-12-07 18:09:48,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:48,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484893605] [2019-12-07 18:09:48,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:48,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484893605] [2019-12-07 18:09:48,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424098232] [2019-12-07 18:09:48,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/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 [2019-12-07 18:09:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:48,348 INFO L264 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 18:09:48,350 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:09:48,400 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_55|], 1=[|v_#valid_77|]} [2019-12-07 18:09:48,402 INFO L377 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 [2019-12-07 18:09:48,402 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:48,409 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:48,414 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:48,414 INFO L377 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 [2019-12-07 18:09:48,415 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:48,427 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:48,428 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:48,428 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-12-07 18:09:48,451 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:09:48,452 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:48,461 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:48,463 INFO L377 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 [2019-12-07 18:09:48,463 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:48,471 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:48,472 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:48,472 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2019-12-07 18:09:48,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:09:48,537 INFO L377 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 19 treesize of output 18 [2019-12-07 18:09:48,537 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:48,546 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:48,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:48,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-12-07 18:09:48,559 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:48,576 INFO L614 ElimStorePlain]: treesize reduction 24, result has 61.3 percent of original size [2019-12-07 18:09:48,577 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:48,577 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:31 [2019-12-07 18:09:48,600 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_43|], 6=[|v_#memory_$Pointer$.offset_37|]} [2019-12-07 18:09:48,613 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:48,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2019-12-07 18:09:48,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:09:48,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:09:48,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:09:48,615 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 18:09:48,648 INFO L614 ElimStorePlain]: treesize reduction 145, result has 31.6 percent of original size [2019-12-07 18:09:48,655 INFO L343 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2019-12-07 18:09:48,655 INFO L377 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 50 treesize of output 25 [2019-12-07 18:09:48,656 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:48,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:48,661 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:09:48,661 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:36 [2019-12-07 18:09:48,722 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-12-07 18:09:48,724 INFO L377 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 36 treesize of output 20 [2019-12-07 18:09:48,725 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:48,731 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:48,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 18:09:48,733 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:48,737 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:48,737 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:48,737 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:50, output treesize:9 [2019-12-07 18:09:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:48,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:09:48,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2019-12-07 18:09:48,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758195444] [2019-12-07 18:09:48,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 18:09:48,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:48,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 18:09:48,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:09:48,744 INFO L87 Difference]: Start difference. First operand 179 states and 195 transitions. Second operand 23 states. [2019-12-07 18:09:50,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:50,345 INFO L93 Difference]: Finished difference Result 237 states and 257 transitions. [2019-12-07 18:09:50,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 18:09:50,346 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2019-12-07 18:09:50,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:50,347 INFO L225 Difference]: With dead ends: 237 [2019-12-07 18:09:50,347 INFO L226 Difference]: Without dead ends: 237 [2019-12-07 18:09:50,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=213, Invalid=977, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 18:09:50,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-12-07 18:09:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 182. [2019-12-07 18:09:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-12-07 18:09:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 198 transitions. [2019-12-07 18:09:50,351 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 198 transitions. Word has length 36 [2019-12-07 18:09:50,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:50,352 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 198 transitions. [2019-12-07 18:09:50,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 18:09:50,352 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 198 transitions. [2019-12-07 18:09:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 18:09:50,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:50,352 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:50,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:09:50,553 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:50,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:50,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1507013845, now seen corresponding path program 1 times [2019-12-07 18:09:50,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:50,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800359338] [2019-12-07 18:09:50,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:09:50,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800359338] [2019-12-07 18:09:50,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:50,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:09:50,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56685378] [2019-12-07 18:09:50,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:09:50,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:50,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:09:50,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:09:50,586 INFO L87 Difference]: Start difference. First operand 182 states and 198 transitions. Second operand 4 states. [2019-12-07 18:09:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:50,682 INFO L93 Difference]: Finished difference Result 181 states and 196 transitions. [2019-12-07 18:09:50,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:09:50,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 18:09:50,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:50,683 INFO L225 Difference]: With dead ends: 181 [2019-12-07 18:09:50,683 INFO L226 Difference]: Without dead ends: 181 [2019-12-07 18:09:50,683 INFO L630 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 [2019-12-07 18:09:50,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-12-07 18:09:50,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-12-07 18:09:50,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-12-07 18:09:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 196 transitions. [2019-12-07 18:09:50,686 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 196 transitions. Word has length 37 [2019-12-07 18:09:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:50,686 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 196 transitions. [2019-12-07 18:09:50,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:09:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 196 transitions. [2019-12-07 18:09:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 18:09:50,687 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:50,687 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:50,687 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:50,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:50,687 INFO L82 PathProgramCache]: Analyzing trace with hash 143783508, now seen corresponding path program 2 times [2019-12-07 18:09:50,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:50,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499281236] [2019-12-07 18:09:50,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:51,148 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:51,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499281236] [2019-12-07 18:09:51,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629942461] [2019-12-07 18:09:51,149 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:09:51,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:09:51,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:09:51,220 INFO L264 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 18:09:51,222 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:09:51,225 INFO L377 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 [2019-12-07 18:09:51,225 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,229 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:51,229 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,229 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:09:51,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:09:51,242 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,246 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:51,247 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,247 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 18:09:51,284 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:51,284 INFO L377 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 [2019-12-07 18:09:51,284 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,291 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:51,291 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,291 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-12-07 18:09:51,310 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_44|], 2=[|v_#memory_int_42|]} [2019-12-07 18:09:51,319 INFO L377 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 [2019-12-07 18:09:51,319 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,331 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:51,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:09:51,335 INFO L377 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 25 treesize of output 13 [2019-12-07 18:09:51,335 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,344 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:51,344 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,344 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:32 [2019-12-07 18:09:51,369 INFO L377 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 16 treesize of output 8 [2019-12-07 18:09:51,369 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,376 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:51,376 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,376 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:22 [2019-12-07 18:09:51,410 INFO L377 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 25 treesize of output 13 [2019-12-07 18:09:51,411 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,415 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:51,415 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,415 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2019-12-07 18:09:51,418 INFO L377 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 23 treesize of output 22 [2019-12-07 18:09:51,419 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,425 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:51,425 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,425 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-12-07 18:09:51,450 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:51,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 15 [2019-12-07 18:09:51,450 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,462 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:51,462 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,462 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2019-12-07 18:09:51,483 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_45|], 6=[|v_#memory_int_45|]} [2019-12-07 18:09:51,487 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-12-07 18:09:51,487 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,497 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:51,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:09:51,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2019-12-07 18:09:51,500 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,507 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:51,508 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,508 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:34 [2019-12-07 18:09:51,531 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 16 treesize of output 8 [2019-12-07 18:09:51,531 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,539 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:51,539 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:09:51,540 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2019-12-07 18:09:51,604 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-12-07 18:09:51,604 INFO L377 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 1 case distinctions, treesize of input 34 treesize of output 35 [2019-12-07 18:09:51,605 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,615 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:51,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:09:51,616 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:09:51,616 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2019-12-07 18:09:51,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:09:51,650 INFO L377 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 23 treesize of output 22 [2019-12-07 18:09:51,650 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,655 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:51,655 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:09:51,655 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2019-12-07 18:09:51,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-12-07 18:09:51,710 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,713 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:51,714 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:51,714 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-12-07 18:09:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:51,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:09:51,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 36 [2019-12-07 18:09:51,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163830600] [2019-12-07 18:09:51,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 18:09:51,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:51,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 18:09:51,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 18:09:51,720 INFO L87 Difference]: Start difference. First operand 181 states and 196 transitions. Second operand 36 states. [2019-12-07 18:09:52,604 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 28 [2019-12-07 18:09:53,535 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2019-12-07 18:09:55,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:55,058 INFO L93 Difference]: Finished difference Result 261 states and 283 transitions. [2019-12-07 18:09:55,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 18:09:55,058 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 38 [2019-12-07 18:09:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:55,059 INFO L225 Difference]: With dead ends: 261 [2019-12-07 18:09:55,059 INFO L226 Difference]: Without dead ends: 261 [2019-12-07 18:09:55,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=502, Invalid=2150, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 18:09:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-12-07 18:09:55,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 190. [2019-12-07 18:09:55,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-12-07 18:09:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 207 transitions. [2019-12-07 18:09:55,063 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 207 transitions. Word has length 38 [2019-12-07 18:09:55,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:55,063 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 207 transitions. [2019-12-07 18:09:55,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 18:09:55,063 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 207 transitions. [2019-12-07 18:09:55,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:09:55,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:55,063 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:55,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:09:55,265 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:55,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:55,266 INFO L82 PathProgramCache]: Analyzing trace with hash -836318066, now seen corresponding path program 1 times [2019-12-07 18:09:55,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:55,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601623795] [2019-12-07 18:09:55,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:55,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:55,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601623795] [2019-12-07 18:09:55,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099539629] [2019-12-07 18:09:55,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:09:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:55,505 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 18:09:55,507 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:09:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:09:55,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:09:55,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-12-07 18:09:55,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763740409] [2019-12-07 18:09:55,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 18:09:55,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:55,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 18:09:55,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:09:55,651 INFO L87 Difference]: Start difference. First operand 190 states and 207 transitions. Second operand 17 states. [2019-12-07 18:09:56,377 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-12-07 18:09:56,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:56,790 INFO L93 Difference]: Finished difference Result 200 states and 216 transitions. [2019-12-07 18:09:56,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:09:56,792 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2019-12-07 18:09:56,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:56,794 INFO L225 Difference]: With dead ends: 200 [2019-12-07 18:09:56,795 INFO L226 Difference]: Without dead ends: 175 [2019-12-07 18:09:56,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2019-12-07 18:09:56,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-12-07 18:09:56,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-12-07 18:09:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-12-07 18:09:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 191 transitions. [2019-12-07 18:09:56,804 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 191 transitions. Word has length 39 [2019-12-07 18:09:56,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:56,805 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 191 transitions. [2019-12-07 18:09:56,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 18:09:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 191 transitions. [2019-12-07 18:09:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:09:56,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:56,808 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:57,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:09:57,010 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:09:57,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:57,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1567584456, now seen corresponding path program 2 times [2019-12-07 18:09:57,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:57,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815077633] [2019-12-07 18:09:57,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:57,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815077633] [2019-12-07 18:09:57,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390151305] [2019-12-07 18:09:57,239 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:09:57,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:09:57,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:09:57,311 INFO L264 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 56 conjunts are in the unsatisfiable core [2019-12-07 18:09:57,313 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:09:57,383 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:57,383 INFO L377 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 [2019-12-07 18:09:57,383 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:57,391 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:57,391 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:57,391 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2019-12-07 18:09:57,415 INFO L377 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 [2019-12-07 18:09:57,415 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:57,423 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:57,425 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:09:57,425 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:57,435 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:57,435 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:57,435 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2019-12-07 18:09:57,520 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:09:57,527 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:57,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 38 [2019-12-07 18:09:57,528 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:57,552 INFO L614 ElimStorePlain]: treesize reduction 19, result has 72.5 percent of original size [2019-12-07 18:09:57,554 INFO L377 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 [2019-12-07 18:09:57,554 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:57,564 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:57,564 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:57,564 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:42 [2019-12-07 18:09:57,613 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:57,613 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 66 [2019-12-07 18:09:57,614 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:57,634 INFO L614 ElimStorePlain]: treesize reduction 24, result has 74.7 percent of original size [2019-12-07 18:09:57,636 INFO L377 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 46 treesize of output 25 [2019-12-07 18:09:57,637 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:57,644 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:57,644 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:57,644 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:44 [2019-12-07 18:09:57,794 INFO L343 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-12-07 18:09:57,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 43 [2019-12-07 18:09:57,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:09:57,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:09:57,796 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:09:57,811 INFO L614 ElimStorePlain]: treesize reduction 8, result has 81.8 percent of original size [2019-12-07 18:09:57,819 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:57,819 INFO L377 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:09:57,819 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:09:57,824 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:09:57,824 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:09:57,824 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:10 [2019-12-07 18:09:57,870 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:57,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:09:57,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-12-07 18:09:57,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336430449] [2019-12-07 18:09:57,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 18:09:57,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:57,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 18:09:57,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2019-12-07 18:09:57,872 INFO L87 Difference]: Start difference. First operand 175 states and 191 transitions. Second operand 31 states. [2019-12-07 18:09:59,070 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-12-07 18:10:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:00,368 INFO L93 Difference]: Finished difference Result 230 states and 250 transitions. [2019-12-07 18:10:00,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 18:10:00,368 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 41 [2019-12-07 18:10:00,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:00,369 INFO L225 Difference]: With dead ends: 230 [2019-12-07 18:10:00,369 INFO L226 Difference]: Without dead ends: 230 [2019-12-07 18:10:00,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=304, Invalid=1766, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 18:10:00,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-12-07 18:10:00,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 177. [2019-12-07 18:10:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-12-07 18:10:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 193 transitions. [2019-12-07 18:10:00,372 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 193 transitions. Word has length 41 [2019-12-07 18:10:00,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:00,372 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 193 transitions. [2019-12-07 18:10:00,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 18:10:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 193 transitions. [2019-12-07 18:10:00,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:10:00,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:00,373 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:10:00,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:10:00,574 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:10:00,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:00,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1609602709, now seen corresponding path program 1 times [2019-12-07 18:10:00,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:00,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53568171] [2019-12-07 18:10:00,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:00,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53568171] [2019-12-07 18:10:00,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394663087] [2019-12-07 18:10:00,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:10:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:01,005 INFO L264 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 18:10:01,006 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:01,030 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_56|], 1=[|v_#valid_86|]} [2019-12-07 18:10:01,032 INFO L377 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 [2019-12-07 18:10:01,032 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:01,037 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:01,041 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:01,041 INFO L377 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 [2019-12-07 18:10:01,042 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:01,046 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:01,046 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:01,046 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2019-12-07 18:10:01,065 INFO L377 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 [2019-12-07 18:10:01,065 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:01,071 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:01,071 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:01,071 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:24 [2019-12-07 18:10:01,133 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:01,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-12-07 18:10:01,134 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:01,147 INFO L614 ElimStorePlain]: treesize reduction 24, result has 52.9 percent of original size [2019-12-07 18:10:01,148 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:01,148 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2019-12-07 18:10:01,168 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_48|], 2=[|v_#memory_$Pointer$.base_51|]} [2019-12-07 18:10:01,171 INFO L377 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 21 treesize of output 13 [2019-12-07 18:10:01,171 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:01,180 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:01,192 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:01,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 85 [2019-12-07 18:10:01,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:01,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:01,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:01,194 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 18:10:01,215 INFO L614 ElimStorePlain]: treesize reduction 109, result has 29.2 percent of original size [2019-12-07 18:10:01,215 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:01,216 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:45 [2019-12-07 18:10:01,284 INFO L377 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 49 treesize of output 29 [2019-12-07 18:10:01,284 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:01,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:01,295 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:01,296 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:25 [2019-12-07 18:10:01,351 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2019-12-07 18:10:01,352 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:01,361 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:01,366 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:01,367 INFO L377 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 19 treesize of output 19 [2019-12-07 18:10:01,367 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 18:10:01,373 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:01,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:01,374 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:01,374 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:16 [2019-12-07 18:10:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:01,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:10:01,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2019-12-07 18:10:01,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051233918] [2019-12-07 18:10:01,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 18:10:01,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:01,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 18:10:01,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=0, NotChecked=0, Total=992 [2019-12-07 18:10:01,431 INFO L87 Difference]: Start difference. First operand 177 states and 193 transitions. Second operand 32 states. [2019-12-07 18:10:03,244 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-12-07 18:10:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:04,095 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2019-12-07 18:10:04,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 18:10:04,096 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 41 [2019-12-07 18:10:04,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:04,097 INFO L225 Difference]: With dead ends: 207 [2019-12-07 18:10:04,097 INFO L226 Difference]: Without dead ends: 207 [2019-12-07 18:10:04,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=277, Invalid=1793, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 18:10:04,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-12-07 18:10:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 176. [2019-12-07 18:10:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 18:10:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 191 transitions. [2019-12-07 18:10:04,103 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 191 transitions. Word has length 41 [2019-12-07 18:10:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:04,103 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 191 transitions. [2019-12-07 18:10:04,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 18:10:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 191 transitions. [2019-12-07 18:10:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 18:10:04,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:04,104 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:10:04,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:10:04,305 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:10:04,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:04,306 INFO L82 PathProgramCache]: Analyzing trace with hash -930888630, now seen corresponding path program 1 times [2019-12-07 18:10:04,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:04,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231264283] [2019-12-07 18:10:04,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:04,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:04,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231264283] [2019-12-07 18:10:04,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211396763] [2019-12-07 18:10:04,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:10:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:04,567 INFO L264 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 18:10:04,568 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:04,580 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:04,581 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 18:10:04,581 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:04,601 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 18:10:04,602 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:04,602 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-12-07 18:10:04,623 INFO L377 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 [2019-12-07 18:10:04,623 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:04,630 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:04,630 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:04,630 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-12-07 18:10:04,702 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:04,702 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-12-07 18:10:04,702 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:04,717 INFO L614 ElimStorePlain]: treesize reduction 24, result has 54.7 percent of original size [2019-12-07 18:10:04,718 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:04,718 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:29 [2019-12-07 18:10:04,749 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-12-07 18:10:04,750 INFO L377 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 34 treesize of output 21 [2019-12-07 18:10:04,750 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:04,756 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:04,756 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:04,756 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:29 [2019-12-07 18:10:04,764 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:04,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 16 treesize of output 26 [2019-12-07 18:10:04,764 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:04,770 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:04,770 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:04,770 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:27 [2019-12-07 18:10:04,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:10:04,795 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:04,802 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:04,802 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:04,802 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:33 [2019-12-07 18:10:04,899 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:04,900 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 105 [2019-12-07 18:10:04,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:04,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:04,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:04,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:04,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:04,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:04,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,906 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:04,935 INFO L614 ElimStorePlain]: treesize reduction 60, result has 39.4 percent of original size [2019-12-07 18:10:04,935 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:04,935 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:41 [2019-12-07 18:10:04,985 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:04,985 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 133 [2019-12-07 18:10:04,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:04,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:04,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:04,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:04,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:04,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:04,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:04,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:04,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:04,992 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 11 xjuncts. [2019-12-07 18:10:05,063 INFO L614 ElimStorePlain]: treesize reduction 1127, result has 3.9 percent of original size [2019-12-07 18:10:05,063 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:05,063 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:46 [2019-12-07 18:10:05,127 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:05,127 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 36 [2019-12-07 18:10:05,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:05,128 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:05,133 INFO L614 ElimStorePlain]: treesize reduction 9, result has 52.6 percent of original size [2019-12-07 18:10:05,133 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:05,133 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:53, output treesize:5 [2019-12-07 18:10:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:05,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:10:05,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2019-12-07 18:10:05,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831691341] [2019-12-07 18:10:05,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 18:10:05,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:05,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 18:10:05,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2019-12-07 18:10:05,141 INFO L87 Difference]: Start difference. First operand 176 states and 191 transitions. Second operand 28 states. [2019-12-07 18:10:26,751 WARN L192 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-12-07 18:10:27,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:27,026 INFO L93 Difference]: Finished difference Result 270 states and 292 transitions. [2019-12-07 18:10:27,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 18:10:27,026 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 42 [2019-12-07 18:10:27,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:27,028 INFO L225 Difference]: With dead ends: 270 [2019-12-07 18:10:27,028 INFO L226 Difference]: Without dead ends: 270 [2019-12-07 18:10:27,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=323, Invalid=1657, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 18:10:27,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-12-07 18:10:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 189. [2019-12-07 18:10:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-12-07 18:10:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 206 transitions. [2019-12-07 18:10:27,032 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 206 transitions. Word has length 42 [2019-12-07 18:10:27,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:27,032 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 206 transitions. [2019-12-07 18:10:27,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 18:10:27,032 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 206 transitions. [2019-12-07 18:10:27,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 18:10:27,033 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:27,033 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:10:27,233 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:10:27,234 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:10:27,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:27,234 INFO L82 PathProgramCache]: Analyzing trace with hash -930888629, now seen corresponding path program 1 times [2019-12-07 18:10:27,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:27,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769085169] [2019-12-07 18:10:27,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:27,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769085169] [2019-12-07 18:10:27,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898815509] [2019-12-07 18:10:27,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:10:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:27,554 INFO L264 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 56 conjunts are in the unsatisfiable core [2019-12-07 18:10:27,555 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:27,629 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:27,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 18:10:27,629 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:27,649 INFO L614 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-12-07 18:10:27,649 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:27,649 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-12-07 18:10:27,680 INFO L377 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 [2019-12-07 18:10:27,680 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:27,691 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:27,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:10:27,693 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:27,703 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:27,703 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:27,703 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-12-07 18:10:27,807 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:27,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-12-07 18:10:27,807 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:27,836 INFO L614 ElimStorePlain]: treesize reduction 24, result has 68.8 percent of original size [2019-12-07 18:10:27,838 INFO L377 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 19 treesize of output 18 [2019-12-07 18:10:27,839 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:27,850 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:27,850 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:27,850 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:49 [2019-12-07 18:10:27,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:10:27,894 INFO L377 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 34 treesize of output 21 [2019-12-07 18:10:27,895 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:27,913 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:27,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:10:27,917 INFO L377 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 34 treesize of output 21 [2019-12-07 18:10:27,917 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:27,931 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:27,931 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:27,932 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-12-07 18:10:27,976 INFO L430 ElimStorePlain]: Different costs {1=[|v_#length_57|], 3=[|v_#valid_90|]} [2019-12-07 18:10:27,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:10:27,980 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2019-12-07 18:10:27,980 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:27,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:28,006 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:28,007 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 16 treesize of output 26 [2019-12-07 18:10:28,007 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:28,022 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:28,023 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:28,023 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2019-12-07 18:10:28,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:10:28,076 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:28,099 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:28,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:10:28,103 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:28,118 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:28,118 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:28,119 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-12-07 18:10:28,259 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_45|], 6=[|v_#memory_$Pointer$.base_62|]} [2019-12-07 18:10:28,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:10:28,263 INFO L377 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 19 treesize of output 18 [2019-12-07 18:10:28,263 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:28,282 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:28,313 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:28,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 112 [2019-12-07 18:10:28,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:28,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:28,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:28,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:28,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,317 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:28,358 INFO L614 ElimStorePlain]: treesize reduction 60, result has 51.2 percent of original size [2019-12-07 18:10:28,358 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:28,358 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:104, output treesize:65 [2019-12-07 18:10:28,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:10:28,409 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 29 [2019-12-07 18:10:28,410 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:28,425 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:28,460 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:28,460 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 147 [2019-12-07 18:10:28,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:28,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:28,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:28,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:28,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:28,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:28,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:28,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:28,468 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2019-12-07 18:10:28,588 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2019-12-07 18:10:28,588 INFO L614 ElimStorePlain]: treesize reduction 1632, result has 5.0 percent of original size [2019-12-07 18:10:28,588 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:28,589 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:172, output treesize:86 [2019-12-07 18:10:28,726 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:28,727 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 50 [2019-12-07 18:10:28,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:28,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:28,728 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:28,755 INFO L614 ElimStorePlain]: treesize reduction 12, result has 80.3 percent of original size [2019-12-07 18:10:28,757 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 18:10:28,758 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:28,766 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:28,766 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:28,766 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:100, output treesize:18 [2019-12-07 18:10:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:28,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:10:28,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2019-12-07 18:10:28,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373542855] [2019-12-07 18:10:28,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-07 18:10:28,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:28,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 18:10:28,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 18:10:28,855 INFO L87 Difference]: Start difference. First operand 189 states and 206 transitions. Second operand 35 states. [2019-12-07 18:10:29,861 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-12-07 18:10:30,148 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-12-07 18:10:30,428 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 44 [2019-12-07 18:10:34,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:34,152 INFO L93 Difference]: Finished difference Result 278 states and 301 transitions. [2019-12-07 18:10:34,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 18:10:34,153 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2019-12-07 18:10:34,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:34,155 INFO L225 Difference]: With dead ends: 278 [2019-12-07 18:10:34,155 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 18:10:34,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=454, Invalid=2968, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 18:10:34,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 18:10:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 192. [2019-12-07 18:10:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-12-07 18:10:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 209 transitions. [2019-12-07 18:10:34,163 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 209 transitions. Word has length 42 [2019-12-07 18:10:34,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:34,163 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 209 transitions. [2019-12-07 18:10:34,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-07 18:10:34,164 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 209 transitions. [2019-12-07 18:10:34,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 18:10:34,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:34,165 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:10:34,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:10:34,366 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:10:34,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:34,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1135338177, now seen corresponding path program 1 times [2019-12-07 18:10:34,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:34,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214758953] [2019-12-07 18:10:34,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:10:34,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214758953] [2019-12-07 18:10:34,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242294896] [2019-12-07 18:10:34,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:10:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:34,984 INFO L264 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 18:10:34,985 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:34,995 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:34,995 INFO L377 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 [2019-12-07 18:10:34,995 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:35,005 INFO L614 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-12-07 18:10:35,006 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:35,006 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-12-07 18:10:35,059 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:35,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 58 [2019-12-07 18:10:35,060 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:35,077 INFO L614 ElimStorePlain]: treesize reduction 28, result has 44.0 percent of original size [2019-12-07 18:10:35,078 INFO L534 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. [2019-12-07 18:10:35,078 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:22 [2019-12-07 18:10:35,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:35,221 INFO L377 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 25 treesize of output 13 [2019-12-07 18:10:35,221 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:35,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2019-12-07 18:10:35,223 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:35,235 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:35,235 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 18:10:35,236 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:37 [2019-12-07 18:10:35,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:35,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 17 treesize of output 17 [2019-12-07 18:10:35,328 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:35,334 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-07 18:10:35,334 INFO L534 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. [2019-12-07 18:10:35,334 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-12-07 18:10:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:10:35,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:10:35,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2019-12-07 18:10:35,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148304798] [2019-12-07 18:10:35,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 18:10:35,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:35,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 18:10:35,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2019-12-07 18:10:35,367 INFO L87 Difference]: Start difference. First operand 192 states and 209 transitions. Second operand 30 states. [2019-12-07 18:10:37,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:37,833 INFO L93 Difference]: Finished difference Result 223 states and 241 transitions. [2019-12-07 18:10:37,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 18:10:37,833 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2019-12-07 18:10:37,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:37,834 INFO L225 Difference]: With dead ends: 223 [2019-12-07 18:10:37,834 INFO L226 Difference]: Without dead ends: 223 [2019-12-07 18:10:37,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=434, Invalid=1918, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 18:10:37,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-12-07 18:10:37,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 198. [2019-12-07 18:10:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-07 18:10:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 216 transitions. [2019-12-07 18:10:37,837 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 216 transitions. Word has length 44 [2019-12-07 18:10:37,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:37,838 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 216 transitions. [2019-12-07 18:10:37,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 18:10:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 216 transitions. [2019-12-07 18:10:37,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 18:10:37,838 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:37,838 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:10:38,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:10:38,039 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:10:38,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:38,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1135338176, now seen corresponding path program 1 times [2019-12-07 18:10:38,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:38,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522842434] [2019-12-07 18:10:38,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:38,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522842434] [2019-12-07 18:10:38,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170226895] [2019-12-07 18:10:38,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:10:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:38,337 INFO L264 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-07 18:10:38,338 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:38,341 INFO L377 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 [2019-12-07 18:10:38,341 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:38,343 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:38,344 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:38,344 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:10:38,379 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:38,380 INFO L377 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 [2019-12-07 18:10:38,380 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:38,391 INFO L614 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-12-07 18:10:38,391 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:38,391 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-12-07 18:10:38,446 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:38,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 58 [2019-12-07 18:10:38,447 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:38,465 INFO L614 ElimStorePlain]: treesize reduction 28, result has 44.0 percent of original size [2019-12-07 18:10:38,465 INFO L534 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. [2019-12-07 18:10:38,466 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:22 [2019-12-07 18:10:38,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:38,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2019-12-07 18:10:38,828 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:38,835 INFO L377 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 25 treesize of output 13 [2019-12-07 18:10:38,835 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:38,897 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:38,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2019-12-07 18:10:38,902 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:38,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2019-12-07 18:10:38,907 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:38,944 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:38,945 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 18:10:38,945 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:43 [2019-12-07 18:10:39,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:10:39,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:10:39,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 27 [2019-12-07 18:10:39,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735340524] [2019-12-07 18:10:39,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 18:10:39,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:39,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 18:10:39,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2019-12-07 18:10:39,074 INFO L87 Difference]: Start difference. First operand 198 states and 216 transitions. Second operand 28 states. [2019-12-07 18:10:39,947 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-12-07 18:10:41,603 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-12-07 18:10:42,640 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-12-07 18:10:43,612 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-12-07 18:10:43,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:43,729 INFO L93 Difference]: Finished difference Result 260 states and 281 transitions. [2019-12-07 18:10:43,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 18:10:43,730 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 44 [2019-12-07 18:10:43,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:43,731 INFO L225 Difference]: With dead ends: 260 [2019-12-07 18:10:43,731 INFO L226 Difference]: Without dead ends: 260 [2019-12-07 18:10:43,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=773, Invalid=3387, Unknown=0, NotChecked=0, Total=4160 [2019-12-07 18:10:43,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-12-07 18:10:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 200. [2019-12-07 18:10:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-12-07 18:10:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 217 transitions. [2019-12-07 18:10:43,734 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 217 transitions. Word has length 44 [2019-12-07 18:10:43,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:43,735 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 217 transitions. [2019-12-07 18:10:43,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 18:10:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 217 transitions. [2019-12-07 18:10:43,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 18:10:43,735 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:43,735 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:10:43,935 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:10:43,936 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:10:43,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:43,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1318497115, now seen corresponding path program 1 times [2019-12-07 18:10:43,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:43,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835620705] [2019-12-07 18:10:43,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 18:10:44,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835620705] [2019-12-07 18:10:44,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849897597] [2019-12-07 18:10:44,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:10:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:44,534 INFO L264 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 59 conjunts are in the unsatisfiable core [2019-12-07 18:10:44,535 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:44,538 INFO L377 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 [2019-12-07 18:10:44,538 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:44,542 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:44,542 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:44,542 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:10:44,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:10:44,554 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:44,558 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:44,558 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:44,558 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 18:10:44,599 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:44,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 18:10:44,600 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:44,619 INFO L614 ElimStorePlain]: treesize reduction 14, result has 70.2 percent of original size [2019-12-07 18:10:44,619 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:44,619 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2019-12-07 18:10:44,647 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_64|], 2=[|v_#memory_int_50|]} [2019-12-07 18:10:44,649 INFO L377 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 [2019-12-07 18:10:44,650 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:44,677 INFO L614 ElimStorePlain]: treesize reduction 5, result has 91.7 percent of original size [2019-12-07 18:10:44,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:10:44,680 INFO L377 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 25 treesize of output 13 [2019-12-07 18:10:44,680 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:44,691 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:44,691 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:44,691 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:41 [2019-12-07 18:10:44,722 INFO L377 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 25 treesize of output 13 [2019-12-07 18:10:44,722 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:44,730 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:44,730 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:44,730 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-12-07 18:10:44,776 INFO L377 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 25 treesize of output 13 [2019-12-07 18:10:44,777 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:44,783 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:44,783 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:44,784 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:27 [2019-12-07 18:10:44,787 INFO L377 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 23 treesize of output 22 [2019-12-07 18:10:44,787 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:44,796 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:44,797 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:44,797 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-12-07 18:10:44,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:44,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-12-07 18:10:44,857 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:44,891 INFO L614 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2019-12-07 18:10:44,892 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:44,892 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:49 [2019-12-07 18:10:44,949 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_65|], 6=[|v_#memory_int_53|]} [2019-12-07 18:10:44,955 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2019-12-07 18:10:44,955 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:44,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:45,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:10:45,003 INFO L377 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 34 treesize of output 25 [2019-12-07 18:10:45,004 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:45,033 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:45,033 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:45,034 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:61 [2019-12-07 18:10:45,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 17 [2019-12-07 18:10:45,086 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:45,098 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:45,098 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:45,098 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:49 [2019-12-07 18:10:45,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2019-12-07 18:10:45,180 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:45,191 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:45,191 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:45,191 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:49 [2019-12-07 18:10:45,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-12-07 18:10:45,222 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:45,234 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:45,235 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:45,235 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:58 [2019-12-07 18:10:45,284 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:45,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2019-12-07 18:10:45,285 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:45,297 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:45,297 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:45,297 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2019-12-07 18:10:45,335 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_66|], 12=[|v_#memory_int_56|]} [2019-12-07 18:10:45,338 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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 [2019-12-07 18:10:45,338 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:45,357 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:45,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:10:45,360 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2019-12-07 18:10:45,360 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:45,375 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:45,376 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:45,376 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:81, output treesize:67 [2019-12-07 18:10:45,418 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 32 treesize of output 16 [2019-12-07 18:10:45,419 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:45,431 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:45,432 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:45,432 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:74, output treesize:55 [2019-12-07 18:10:45,574 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2019-12-07 18:10:45,574 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:45,596 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:45,596 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:45,597 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:70, output treesize:55 [2019-12-07 18:10:45,676 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-12-07 18:10:45,676 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:45,701 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:45,701 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:45,701 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:68, output treesize:64 [2019-12-07 18:10:45,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 16 [2019-12-07 18:10:45,924 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:45,935 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:45,936 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:45,936 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:66, output treesize:3 [2019-12-07 18:10:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:45,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:10:45,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2019-12-07 18:10:45,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460080668] [2019-12-07 18:10:45,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-07 18:10:45,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:45,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 18:10:45,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1510, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 18:10:45,957 INFO L87 Difference]: Start difference. First operand 200 states and 217 transitions. Second operand 42 states. [2019-12-07 18:10:50,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:50,832 INFO L93 Difference]: Finished difference Result 283 states and 306 transitions. [2019-12-07 18:10:50,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-07 18:10:50,832 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 44 [2019-12-07 18:10:50,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:50,834 INFO L225 Difference]: With dead ends: 283 [2019-12-07 18:10:50,834 INFO L226 Difference]: Without dead ends: 283 [2019-12-07 18:10:50,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1978 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1290, Invalid=6366, Unknown=0, NotChecked=0, Total=7656 [2019-12-07 18:10:50,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-12-07 18:10:50,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 184. [2019-12-07 18:10:50,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-12-07 18:10:50,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2019-12-07 18:10:50,839 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 44 [2019-12-07 18:10:50,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:50,839 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2019-12-07 18:10:50,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-07 18:10:50,839 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2019-12-07 18:10:50,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:10:50,840 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:50,840 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:10:51,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:10:51,041 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:10:51,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:51,042 INFO L82 PathProgramCache]: Analyzing trace with hash 653858032, now seen corresponding path program 3 times [2019-12-07 18:10:51,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:51,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705352089] [2019-12-07 18:10:51,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:51,232 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:51,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705352089] [2019-12-07 18:10:51,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751479588] [2019-12-07 18:10:51,233 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:10:51,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 18:10:51,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:10:51,341 INFO L264 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 18:10:51,342 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:51,345 INFO L377 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 [2019-12-07 18:10:51,345 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:51,348 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:51,348 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:51,349 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:10:51,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:51,388 INFO L377 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 [2019-12-07 18:10:51,388 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:51,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:51,393 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:51,393 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-12-07 18:10:51,418 INFO L377 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 [2019-12-07 18:10:51,418 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:51,426 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:51,426 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:51,426 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-12-07 18:10:51,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:51,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 46 [2019-12-07 18:10:51,511 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:51,525 INFO L614 ElimStorePlain]: treesize reduction 24, result has 52.9 percent of original size [2019-12-07 18:10:51,525 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:51,525 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:27 [2019-12-07 18:10:51,558 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-12-07 18:10:51,558 INFO L377 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 34 treesize of output 21 [2019-12-07 18:10:51,558 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:51,564 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:51,564 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:51,565 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2019-12-07 18:10:51,570 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:51,570 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 15 [2019-12-07 18:10:51,570 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:51,576 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:51,576 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:51,576 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-12-07 18:10:51,602 INFO L377 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 26 treesize of output 21 [2019-12-07 18:10:51,602 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:51,610 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:51,610 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:51,610 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:28 [2019-12-07 18:10:51,717 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:51,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 101 [2019-12-07 18:10:51,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:51,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:51,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:51,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:51,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:51,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:51,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:51,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:51,723 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:51,756 INFO L614 ElimStorePlain]: treesize reduction 52, result has 46.9 percent of original size [2019-12-07 18:10:51,756 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:51,756 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:44 [2019-12-07 18:10:51,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,894 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:51,894 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 129 [2019-12-07 18:10:51,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:51,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,897 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-12-07 18:10:51,914 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:51,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 69 [2019-12-07 18:10:51,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:51,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:51,916 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 18:10:51,953 INFO L614 ElimStorePlain]: treesize reduction 584, result has 3.5 percent of original size [2019-12-07 18:10:51,953 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:51,953 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:129, output treesize:21 [2019-12-07 18:10:52,001 INFO L377 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 25 treesize of output 13 [2019-12-07 18:10:52,001 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:52,003 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:52,004 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:52,004 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:5 [2019-12-07 18:10:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:52,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:10:52,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2019-12-07 18:10:52,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494753965] [2019-12-07 18:10:52,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 18:10:52,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:52,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 18:10:52,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2019-12-07 18:10:52,011 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand 31 states. [2019-12-07 18:10:54,475 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2019-12-07 18:10:55,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:55,720 INFO L93 Difference]: Finished difference Result 271 states and 293 transitions. [2019-12-07 18:10:55,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 18:10:55,721 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2019-12-07 18:10:55,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:55,724 INFO L225 Difference]: With dead ends: 271 [2019-12-07 18:10:55,725 INFO L226 Difference]: Without dead ends: 271 [2019-12-07 18:10:55,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=390, Invalid=2058, Unknown=2, NotChecked=0, Total=2450 [2019-12-07 18:10:55,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-07 18:10:55,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 206. [2019-12-07 18:10:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-12-07 18:10:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 225 transitions. [2019-12-07 18:10:55,735 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 225 transitions. Word has length 45 [2019-12-07 18:10:55,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:55,736 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 225 transitions. [2019-12-07 18:10:55,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 18:10:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 225 transitions. [2019-12-07 18:10:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:10:55,736 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:55,736 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:10:55,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:10:55,937 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:10:55,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:55,938 INFO L82 PathProgramCache]: Analyzing trace with hash 653858033, now seen corresponding path program 2 times [2019-12-07 18:10:55,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:55,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810107613] [2019-12-07 18:10:55,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:56,178 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:56,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810107613] [2019-12-07 18:10:56,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95852832] [2019-12-07 18:10:56,178 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:10:56,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:10:56,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:10:56,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 56 conjunts are in the unsatisfiable core [2019-12-07 18:10:56,252 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:10:56,255 INFO L377 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 [2019-12-07 18:10:56,256 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,258 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:56,258 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,258 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:10:56,303 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:56,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 18:10:56,304 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,321 INFO L614 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-12-07 18:10:56,321 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,321 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-12-07 18:10:56,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:10:56,348 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,369 INFO L614 ElimStorePlain]: treesize reduction 5, result has 89.4 percent of original size [2019-12-07 18:10:56,371 INFO L377 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 [2019-12-07 18:10:56,372 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,381 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:56,382 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,382 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-12-07 18:10:56,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:10:56,471 INFO L377 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 19 treesize of output 18 [2019-12-07 18:10:56,472 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,484 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:56,497 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:56,497 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-12-07 18:10:56,498 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,523 INFO L614 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2019-12-07 18:10:56,523 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,523 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:49 [2019-12-07 18:10:56,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:10:56,566 INFO L377 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 34 treesize of output 21 [2019-12-07 18:10:56,566 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,584 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:56,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:10:56,591 INFO L377 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 34 treesize of output 21 [2019-12-07 18:10:56,591 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,605 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:56,605 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,605 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-12-07 18:10:56,648 INFO L430 ElimStorePlain]: Different costs {1=[|v_#length_61|], 3=[|v_#valid_103|]} [2019-12-07 18:10:56,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:10:56,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2019-12-07 18:10:56,652 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,668 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:56,677 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:56,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 16 treesize of output 26 [2019-12-07 18:10:56,678 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,693 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:56,693 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,693 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2019-12-07 18:10:56,737 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:10:56,737 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,755 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:56,757 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:10:56,758 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,772 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:56,772 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,772 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-12-07 18:10:56,920 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_51|], 6=[|v_#memory_$Pointer$.base_77|]} [2019-12-07 18:10:56,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:10:56,924 INFO L377 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 19 treesize of output 18 [2019-12-07 18:10:56,924 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:56,942 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:56,972 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:56,972 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 112 [2019-12-07 18:10:56,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:56,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:56,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:56,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:56,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:56,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:56,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:56,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:56,975 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:57,016 INFO L614 ElimStorePlain]: treesize reduction 60, result has 52.4 percent of original size [2019-12-07 18:10:57,017 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:57,017 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:107, output treesize:61 [2019-12-07 18:10:57,060 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_52|], 6=[|v_#memory_$Pointer$.base_78|]} [2019-12-07 18:10:57,063 INFO L377 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 51 treesize of output 11 [2019-12-07 18:10:57,063 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:57,077 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:57,107 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:57,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 140 [2019-12-07 18:10:57,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:57,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:57,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:57,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:57,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:57,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:57,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:57,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:57,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:57,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:57,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:57,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:57,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:57,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:57,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:57,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:57,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:57,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:57,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:57,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:57,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:57,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:57,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:10:57,116 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2019-12-07 18:10:57,187 INFO L614 ElimStorePlain]: treesize reduction 1373, result has 5.1 percent of original size [2019-12-07 18:10:57,187 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:57,187 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:160, output treesize:74 [2019-12-07 18:10:57,285 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2019-12-07 18:10:57,288 INFO L377 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 [2019-12-07 18:10:57,288 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:10:57,300 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:57,305 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:10:57,306 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 43 [2019-12-07 18:10:57,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:57,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:10:57,307 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:57,324 INFO L614 ElimStorePlain]: treesize reduction 12, result has 72.1 percent of original size [2019-12-07 18:10:57,325 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:10:57,325 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:18 [2019-12-07 18:10:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:57,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:10:57,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2019-12-07 18:10:57,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893314680] [2019-12-07 18:10:57,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 18:10:57,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:57,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 18:10:57,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 18:10:57,408 INFO L87 Difference]: Start difference. First operand 206 states and 225 transitions. Second operand 33 states. [2019-12-07 18:10:58,932 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2019-12-07 18:10:59,856 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-12-07 18:11:02,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:02,237 INFO L93 Difference]: Finished difference Result 307 states and 332 transitions. [2019-12-07 18:11:02,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 18:11:02,237 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 45 [2019-12-07 18:11:02,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:02,238 INFO L225 Difference]: With dead ends: 307 [2019-12-07 18:11:02,238 INFO L226 Difference]: Without dead ends: 307 [2019-12-07 18:11:02,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=431, Invalid=2761, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 18:11:02,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-07 18:11:02,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 191. [2019-12-07 18:11:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-12-07 18:11:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 207 transitions. [2019-12-07 18:11:02,242 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 207 transitions. Word has length 45 [2019-12-07 18:11:02,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:02,242 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 207 transitions. [2019-12-07 18:11:02,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 18:11:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 207 transitions. [2019-12-07 18:11:02,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:11:02,243 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:02,243 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:02,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:02,444 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:11:02,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:02,445 INFO L82 PathProgramCache]: Analyzing trace with hash 7992874, now seen corresponding path program 1 times [2019-12-07 18:11:02,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:02,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345551015] [2019-12-07 18:11:02,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:11:02,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345551015] [2019-12-07 18:11:02,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076773582] [2019-12-07 18:11:02,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:02,594 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 18:11:02,595 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:11:02,660 INFO L377 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 17 treesize of output 9 [2019-12-07 18:11:02,660 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:02,663 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:02,663 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:02,663 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2019-12-07 18:11:02,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:11:02,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:11:02,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-12-07 18:11:02,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422871622] [2019-12-07 18:11:02,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 18:11:02,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:02,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 18:11:02,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:11:02,691 INFO L87 Difference]: Start difference. First operand 191 states and 207 transitions. Second operand 17 states. [2019-12-07 18:11:05,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:05,133 INFO L93 Difference]: Finished difference Result 219 states and 237 transitions. [2019-12-07 18:11:05,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 18:11:05,135 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2019-12-07 18:11:05,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:05,138 INFO L225 Difference]: With dead ends: 219 [2019-12-07 18:11:05,138 INFO L226 Difference]: Without dead ends: 219 [2019-12-07 18:11:05,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:11:05,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-12-07 18:11:05,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 192. [2019-12-07 18:11:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-12-07 18:11:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 208 transitions. [2019-12-07 18:11:05,147 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 208 transitions. Word has length 47 [2019-12-07 18:11:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:05,148 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 208 transitions. [2019-12-07 18:11:05,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 18:11:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2019-12-07 18:11:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:11:05,150 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:05,150 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:05,351 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:05,351 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:11:05,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:05,352 INFO L82 PathProgramCache]: Analyzing trace with hash 219086463, now seen corresponding path program 2 times [2019-12-07 18:11:05,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:05,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957315450] [2019-12-07 18:11:05,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:05,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957315450] [2019-12-07 18:11:05,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891008465] [2019-12-07 18:11:05,645 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:05,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:11:05,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:11:05,729 INFO L264 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 67 conjunts are in the unsatisfiable core [2019-12-07 18:11:05,730 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:11:05,823 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:05,823 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 18:11:05,824 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:05,844 INFO L614 ElimStorePlain]: treesize reduction 14, result has 68.2 percent of original size [2019-12-07 18:11:05,844 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:05,844 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2019-12-07 18:11:05,881 INFO L377 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 [2019-12-07 18:11:05,881 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:05,905 INFO L614 ElimStorePlain]: treesize reduction 5, result has 90.0 percent of original size [2019-12-07 18:11:05,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:11:05,907 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:05,917 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:05,917 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:05,917 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:42 [2019-12-07 18:11:06,065 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:11:06,101 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:06,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 43 [2019-12-07 18:11:06,103 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:06,228 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-07 18:11:06,229 INFO L614 ElimStorePlain]: treesize reduction 16, result has 78.9 percent of original size [2019-12-07 18:11:06,239 INFO L377 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 [2019-12-07 18:11:06,239 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:06,294 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:06,295 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:06,295 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:56 [2019-12-07 18:11:06,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:06,529 INFO L377 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 41 treesize of output 24 [2019-12-07 18:11:06,530 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:06,611 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:06,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:06,624 INFO L377 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 34 treesize of output 21 [2019-12-07 18:11:06,625 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:06,678 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:06,679 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:06,679 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:52 [2019-12-07 18:11:06,843 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:06,844 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-12-07 18:11:06,844 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:06,884 INFO L614 ElimStorePlain]: treesize reduction 28, result has 71.1 percent of original size [2019-12-07 18:11:06,884 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:06,885 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:69 [2019-12-07 18:11:07,076 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 18:11:07,098 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:11:07,099 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:07,299 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-07 18:11:07,300 INFO L614 ElimStorePlain]: treesize reduction 4, result has 95.0 percent of original size [2019-12-07 18:11:07,377 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:07,377 INFO L377 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 2 case distinctions, treesize of input 33 treesize of output 60 [2019-12-07 18:11:07,378 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:07,548 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-12-07 18:11:07,549 INFO L614 ElimStorePlain]: treesize reduction 36, result has 62.9 percent of original size [2019-12-07 18:11:07,550 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:07,550 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:59 [2019-12-07 18:11:08,274 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_57|], 6=[|v_#memory_$Pointer$.base_83|]} [2019-12-07 18:11:08,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:08,292 INFO L377 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 19 treesize of output 18 [2019-12-07 18:11:08,292 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:08,376 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:08,537 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 18:11:08,538 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:08,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 102 [2019-12-07 18:11:08,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:08,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:08,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:08,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:08,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:08,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:08,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:08,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:08,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:08,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:08,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:08,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:08,553 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:08,751 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2019-12-07 18:11:08,752 INFO L614 ElimStorePlain]: treesize reduction 56, result has 52.5 percent of original size [2019-12-07 18:11:08,753 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:08,753 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:60 [2019-12-07 18:11:08,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:08,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 29 [2019-12-07 18:11:08,994 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:09,074 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:09,227 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 18:11:09,227 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:09,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 137 [2019-12-07 18:11:09,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:09,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:09,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:09,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:09,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:09,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:09,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:09,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:09,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:09,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:09,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:09,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:09,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:09,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:09,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:09,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:09,247 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-12-07 18:11:09,349 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2019-12-07 18:11:09,350 INFO L614 ElimStorePlain]: treesize reduction 629, result has 11.4 percent of original size [2019-12-07 18:11:09,350 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:09,350 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:167, output treesize:81 [2019-12-07 18:11:09,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 30 treesize of output 10 [2019-12-07 18:11:09,832 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:09,848 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:09,848 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:09,849 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:92, output treesize:66 [2019-12-07 18:11:09,979 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:09,979 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 33 [2019-12-07 18:11:09,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:09,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:09,980 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:10,005 INFO L614 ElimStorePlain]: treesize reduction 4, result has 87.5 percent of original size [2019-12-07 18:11:10,005 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:10,006 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:28 [2019-12-07 18:11:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:10,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:11:10,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 40 [2019-12-07 18:11:10,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293442176] [2019-12-07 18:11:10,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-07 18:11:10,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:10,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-07 18:11:10,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 18:11:10,257 INFO L87 Difference]: Start difference. First operand 192 states and 208 transitions. Second operand 41 states. [2019-12-07 18:11:13,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:13,691 INFO L93 Difference]: Finished difference Result 287 states and 313 transitions. [2019-12-07 18:11:13,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 18:11:13,692 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 47 [2019-12-07 18:11:13,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:13,695 INFO L225 Difference]: With dead ends: 287 [2019-12-07 18:11:13,695 INFO L226 Difference]: Without dead ends: 287 [2019-12-07 18:11:13,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=588, Invalid=3194, Unknown=0, NotChecked=0, Total=3782 [2019-12-07 18:11:13,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-12-07 18:11:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 212. [2019-12-07 18:11:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-12-07 18:11:13,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 233 transitions. [2019-12-07 18:11:13,706 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 233 transitions. Word has length 47 [2019-12-07 18:11:13,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:13,707 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 233 transitions. [2019-12-07 18:11:13,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-07 18:11:13,707 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 233 transitions. [2019-12-07 18:11:13,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:11:13,709 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:13,709 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:13,910 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:13,910 INFO L410 AbstractCegarLoop]: === Iteration 36 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:11:13,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:13,910 INFO L82 PathProgramCache]: Analyzing trace with hash 219086464, now seen corresponding path program 2 times [2019-12-07 18:11:13,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:13,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562556237] [2019-12-07 18:11:13,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:14,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562556237] [2019-12-07 18:11:14,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103582117] [2019-12-07 18:11:14,331 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:14,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:11:14,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:11:14,403 INFO L264 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 65 conjunts are in the unsatisfiable core [2019-12-07 18:11:14,405 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:11:14,481 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:14,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 18:11:14,482 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:14,497 INFO L614 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-12-07 18:11:14,497 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:14,497 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-12-07 18:11:14,531 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:11:14,531 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:14,542 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:14,544 INFO L377 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 [2019-12-07 18:11:14,544 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:14,553 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:14,553 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:14,553 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:32 [2019-12-07 18:11:14,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:14,662 INFO L377 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 19 treesize of output 18 [2019-12-07 18:11:14,662 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:14,673 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:14,686 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:14,686 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-12-07 18:11:14,686 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:14,709 INFO L614 ElimStorePlain]: treesize reduction 24, result has 65.7 percent of original size [2019-12-07 18:11:14,709 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:14,709 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:46 [2019-12-07 18:11:14,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:14,756 INFO L377 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 34 treesize of output 21 [2019-12-07 18:11:14,757 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:14,770 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:14,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:14,773 INFO L377 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 34 treesize of output 21 [2019-12-07 18:11:14,773 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:14,783 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:14,783 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:14,783 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 [2019-12-07 18:11:14,784 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_62|], 3=[|v_#valid_107|]} [2019-12-07 18:11:14,787 INFO L377 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 [2019-12-07 18:11:14,787 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:14,800 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:14,809 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:14,809 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 16 treesize of output 26 [2019-12-07 18:11:14,810 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:14,822 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:14,822 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:14,822 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:52 [2019-12-07 18:11:14,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:11:14,881 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:14,895 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:14,897 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:11:14,897 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:14,908 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:14,908 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:14,908 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:54 [2019-12-07 18:11:15,498 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 18:11:15,498 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:15,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 136 [2019-12-07 18:11:15,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:15,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:15,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:15,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:15,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:15,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:15,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:15,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:15,513 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:15,662 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-12-07 18:11:15,663 INFO L614 ElimStorePlain]: treesize reduction 76, result has 47.2 percent of original size [2019-12-07 18:11:15,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2019-12-07 18:11:15,670 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:15,718 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:15,719 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:15,719 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:117, output treesize:59 [2019-12-07 18:11:15,912 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:15,912 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 187 treesize of output 183 [2019-12-07 18:11:15,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,914 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:15,943 INFO L614 ElimStorePlain]: treesize reduction 148, result has 47.7 percent of original size [2019-12-07 18:11:15,969 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:15,969 INFO L377 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 196 [2019-12-07 18:11:15,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:15,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:15,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:15,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:15,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:15,976 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2019-12-07 18:11:16,021 INFO L614 ElimStorePlain]: treesize reduction 776, result has 9.3 percent of original size [2019-12-07 18:11:16,021 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:16,021 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:190, output treesize:80 [2019-12-07 18:11:16,236 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:16,236 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 62 [2019-12-07 18:11:16,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:16,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:16,237 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:16,253 INFO L614 ElimStorePlain]: treesize reduction 16, result has 71.4 percent of original size [2019-12-07 18:11:16,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-12-07 18:11:16,255 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:16,260 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:16,260 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:16,260 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:9 [2019-12-07 18:11:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:16,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:11:16,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37 [2019-12-07 18:11:16,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611066246] [2019-12-07 18:11:16,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-07 18:11:16,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:16,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 18:11:16,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1296, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 18:11:16,273 INFO L87 Difference]: Start difference. First operand 212 states and 233 transitions. Second operand 38 states. [2019-12-07 18:11:19,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:19,824 INFO L93 Difference]: Finished difference Result 284 states and 310 transitions. [2019-12-07 18:11:19,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 18:11:19,824 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 47 [2019-12-07 18:11:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:19,825 INFO L225 Difference]: With dead ends: 284 [2019-12-07 18:11:19,825 INFO L226 Difference]: Without dead ends: 284 [2019-12-07 18:11:19,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=399, Invalid=2907, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 18:11:19,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-12-07 18:11:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 211. [2019-12-07 18:11:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-12-07 18:11:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 231 transitions. [2019-12-07 18:11:19,828 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 231 transitions. Word has length 47 [2019-12-07 18:11:19,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:19,828 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 231 transitions. [2019-12-07 18:11:19,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-07 18:11:19,828 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 231 transitions. [2019-12-07 18:11:19,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:11:19,829 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:19,829 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:20,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:20,030 INFO L410 AbstractCegarLoop]: === Iteration 37 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:11:20,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:20,031 INFO L82 PathProgramCache]: Analyzing trace with hash 177068210, now seen corresponding path program 1 times [2019-12-07 18:11:20,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:20,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551618858] [2019-12-07 18:11:20,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:20,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551618858] [2019-12-07 18:11:20,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475027152] [2019-12-07 18:11:20,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:20,661 INFO L264 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 64 conjunts are in the unsatisfiable core [2019-12-07 18:11:20,662 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:11:20,671 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:20,671 INFO L377 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 [2019-12-07 18:11:20,671 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:20,681 INFO L614 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-12-07 18:11:20,681 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:20,681 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-12-07 18:11:20,718 INFO L343 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-12-07 18:11:20,719 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 69 [2019-12-07 18:11:20,719 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:20,746 INFO L614 ElimStorePlain]: treesize reduction 28, result has 56.3 percent of original size [2019-12-07 18:11:20,746 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:20,746 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:36 [2019-12-07 18:11:20,787 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-12-07 18:11:20,787 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:20,801 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:20,804 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:11:20,804 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:20,822 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:20,823 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:20,823 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:52 [2019-12-07 18:11:20,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:20,954 INFO L377 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 [2019-12-07 18:11:20,954 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:20,969 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:20,982 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:20,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 55 [2019-12-07 18:11:20,982 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:21,013 INFO L614 ElimStorePlain]: treesize reduction 24, result has 70.7 percent of original size [2019-12-07 18:11:21,013 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:21,014 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:58 [2019-12-07 18:11:21,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:21,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-12-07 18:11:21,076 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:21,095 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:21,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:21,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-12-07 18:11:21,099 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:21,115 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:21,115 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:21,115 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:58 [2019-12-07 18:11:21,130 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:21,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2019-12-07 18:11:21,131 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:21,146 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:21,146 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:21,146 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:55 [2019-12-07 18:11:21,204 INFO L377 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 26 treesize of output 21 [2019-12-07 18:11:21,204 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:21,221 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:21,224 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:11:21,224 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:21,237 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:21,238 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:21,238 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:53 [2019-12-07 18:11:21,377 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_69|], 6=[|v_#memory_$Pointer$.base_95|]} [2019-12-07 18:11:21,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:21,380 INFO L377 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 19 treesize of output 18 [2019-12-07 18:11:21,380 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:21,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:21,421 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:21,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 108 [2019-12-07 18:11:21,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:21,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:21,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:21,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:21,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:21,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:21,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:21,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:21,424 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:21,458 INFO L614 ElimStorePlain]: treesize reduction 60, result has 48.3 percent of original size [2019-12-07 18:11:21,458 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:21,459 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:65 [2019-12-07 18:11:21,510 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_70|], 12=[|v_#memory_$Pointer$.base_96|]} [2019-12-07 18:11:21,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:21,513 INFO L377 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 66 treesize of output 29 [2019-12-07 18:11:21,513 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:21,528 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:21,595 INFO L343 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-12-07 18:11:21,595 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 153 [2019-12-07 18:11:21,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:21,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:21,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:21,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:21,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:21,598 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 18:11:21,635 INFO L614 ElimStorePlain]: treesize reduction 269, result has 25.9 percent of original size [2019-12-07 18:11:21,636 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:21,636 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:180, output treesize:94 [2019-12-07 18:11:21,770 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-12-07 18:11:21,770 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:21,781 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:21,781 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:21,781 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:82 [2019-12-07 18:11:21,905 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:21,905 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 69 [2019-12-07 18:11:21,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:21,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:21,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:21,906 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:21,915 INFO L614 ElimStorePlain]: treesize reduction 77, result has 10.5 percent of original size [2019-12-07 18:11:21,915 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:21,915 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:4 [2019-12-07 18:11:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:21,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:11:21,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 39 [2019-12-07 18:11:21,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550612384] [2019-12-07 18:11:21,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-07 18:11:21,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:21,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-07 18:11:21,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1324, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 18:11:21,930 INFO L87 Difference]: Start difference. First operand 211 states and 231 transitions. Second operand 39 states. [2019-12-07 18:11:25,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:25,792 INFO L93 Difference]: Finished difference Result 272 states and 296 transitions. [2019-12-07 18:11:25,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 18:11:25,792 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 47 [2019-12-07 18:11:25,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:25,793 INFO L225 Difference]: With dead ends: 272 [2019-12-07 18:11:25,793 INFO L226 Difference]: Without dead ends: 272 [2019-12-07 18:11:25,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=470, Invalid=3070, Unknown=0, NotChecked=0, Total=3540 [2019-12-07 18:11:25,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-07 18:11:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 214. [2019-12-07 18:11:25,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-12-07 18:11:25,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 233 transitions. [2019-12-07 18:11:25,796 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 233 transitions. Word has length 47 [2019-12-07 18:11:25,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:25,796 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 233 transitions. [2019-12-07 18:11:25,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-07 18:11:25,796 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 233 transitions. [2019-12-07 18:11:25,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:11:25,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:25,797 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:25,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:25,998 INFO L410 AbstractCegarLoop]: === Iteration 38 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:11:25,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:25,998 INFO L82 PathProgramCache]: Analyzing trace with hash 877299503, now seen corresponding path program 1 times [2019-12-07 18:11:25,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:25,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914648790] [2019-12-07 18:11:25,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:11:26,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914648790] [2019-12-07 18:11:26,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722157549] [2019-12-07 18:11:26,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:26,257 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 18:11:26,258 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:11:26,279 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:26,279 INFO L377 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 [2019-12-07 18:11:26,279 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:26,287 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 18:11:26,287 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:26,287 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 18:11:26,351 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:26,351 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-12-07 18:11:26,351 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:26,356 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:26,356 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:26,356 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2019-12-07 18:11:26,378 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-12-07 18:11:26,378 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:26,385 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:26,385 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:26,385 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2019-12-07 18:11:26,458 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:26,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 50 [2019-12-07 18:11:26,459 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:26,473 INFO L614 ElimStorePlain]: treesize reduction 24, result has 52.0 percent of original size [2019-12-07 18:11:26,474 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:26,474 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:26 [2019-12-07 18:11:26,526 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-12-07 18:11:26,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2019-12-07 18:11:26,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:26,527 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:26,538 INFO L614 ElimStorePlain]: treesize reduction 32, result has 49.2 percent of original size [2019-12-07 18:11:26,538 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:26,538 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:31 [2019-12-07 18:11:26,573 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:26,573 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-12-07 18:11:26,573 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:26,582 INFO L614 ElimStorePlain]: treesize reduction 12, result has 50.0 percent of original size [2019-12-07 18:11:26,582 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:26,582 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:8 [2019-12-07 18:11:26,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:11:26,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:11:26,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2019-12-07 18:11:26,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223781569] [2019-12-07 18:11:26,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 18:11:26,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:26,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 18:11:26,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2019-12-07 18:11:26,640 INFO L87 Difference]: Start difference. First operand 214 states and 233 transitions. Second operand 30 states. [2019-12-07 18:11:28,083 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-12-07 18:11:28,380 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-12-07 18:11:30,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:30,017 INFO L93 Difference]: Finished difference Result 285 states and 307 transitions. [2019-12-07 18:11:30,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 18:11:30,018 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 48 [2019-12-07 18:11:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:30,019 INFO L225 Difference]: With dead ends: 285 [2019-12-07 18:11:30,019 INFO L226 Difference]: Without dead ends: 285 [2019-12-07 18:11:30,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=585, Invalid=2385, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 18:11:30,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-12-07 18:11:30,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 229. [2019-12-07 18:11:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-12-07 18:11:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 254 transitions. [2019-12-07 18:11:30,022 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 254 transitions. Word has length 48 [2019-12-07 18:11:30,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:30,022 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 254 transitions. [2019-12-07 18:11:30,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 18:11:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 254 transitions. [2019-12-07 18:11:30,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:11:30,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:30,022 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:30,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:30,223 INFO L410 AbstractCegarLoop]: === Iteration 39 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:11:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:30,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1194151420, now seen corresponding path program 1 times [2019-12-07 18:11:30,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:30,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486576442] [2019-12-07 18:11:30,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:30,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486576442] [2019-12-07 18:11:30,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490788814] [2019-12-07 18:11:30,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:30,923 INFO L264 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 59 conjunts are in the unsatisfiable core [2019-12-07 18:11:30,924 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:11:30,994 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:30,995 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 18:11:30,995 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:31,013 INFO L614 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-12-07 18:11:31,013 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:31,013 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-12-07 18:11:31,046 INFO L377 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 [2019-12-07 18:11:31,046 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:31,056 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:31,058 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:11:31,058 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:31,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:31,067 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:31,067 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-12-07 18:11:31,190 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:31,190 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-12-07 18:11:31,190 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:31,219 INFO L614 ElimStorePlain]: treesize reduction 24, result has 70.4 percent of original size [2019-12-07 18:11:31,221 INFO L377 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 [2019-12-07 18:11:31,221 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:31,233 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:31,233 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:31,233 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:49 [2019-12-07 18:11:31,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:31,288 INFO L377 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 34 treesize of output 21 [2019-12-07 18:11:31,288 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:31,339 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:31,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:31,352 INFO L377 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 34 treesize of output 21 [2019-12-07 18:11:31,352 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:31,402 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:31,403 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:31,403 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-12-07 18:11:31,515 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:31,515 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-12-07 18:11:31,516 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:31,716 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-12-07 18:11:31,717 INFO L614 ElimStorePlain]: treesize reduction 28, result has 68.9 percent of original size [2019-12-07 18:11:31,718 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:31,718 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:62 [2019-12-07 18:11:31,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:11:31,960 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:32,028 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:32,032 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:11:32,032 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:32,049 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:32,050 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:32,050 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:84, output treesize:60 [2019-12-07 18:11:32,204 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_75|], 6=[|v_#memory_$Pointer$.base_104|]} [2019-12-07 18:11:32,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:32,209 INFO L377 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 19 treesize of output 18 [2019-12-07 18:11:32,209 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:32,228 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:32,259 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:32,260 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 110 [2019-12-07 18:11:32,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:32,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:32,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:32,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:32,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:32,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:32,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:32,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:32,263 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:32,307 INFO L614 ElimStorePlain]: treesize reduction 60, result has 51.2 percent of original size [2019-12-07 18:11:32,307 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:32,307 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:65 [2019-12-07 18:11:32,396 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:32,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 164 [2019-12-07 18:11:32,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:32,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:32,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:32,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:32,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:32,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:32,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:32,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:32,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:32,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:32,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:32,401 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-12-07 18:11:32,464 INFO L614 ElimStorePlain]: treesize reduction 895, result has 12.6 percent of original size [2019-12-07 18:11:32,471 INFO L343 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2019-12-07 18:11:32,471 INFO L377 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 1 case distinctions, treesize of input 66 treesize of output 29 [2019-12-07 18:11:32,472 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:32,482 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:32,483 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:32,483 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:172, output treesize:86 [2019-12-07 18:11:32,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 30 treesize of output 10 [2019-12-07 18:11:32,607 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:32,619 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:32,619 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:32,619 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:100, output treesize:74 [2019-12-07 18:11:32,837 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:32,837 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 41 [2019-12-07 18:11:32,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:32,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:32,839 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:32,907 INFO L614 ElimStorePlain]: treesize reduction 12, result has 70.0 percent of original size [2019-12-07 18:11:32,908 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:32,908 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:28 [2019-12-07 18:11:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:33,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:11:33,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2019-12-07 18:11:33,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809632766] [2019-12-07 18:11:33,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 18:11:33,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:33,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 18:11:33,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1377, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 18:11:33,271 INFO L87 Difference]: Start difference. First operand 229 states and 254 transitions. Second operand 40 states. [2019-12-07 18:11:34,761 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-12-07 18:11:35,727 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-12-07 18:11:37,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:37,083 INFO L93 Difference]: Finished difference Result 279 states and 308 transitions. [2019-12-07 18:11:37,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 18:11:37,084 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 48 [2019-12-07 18:11:37,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:37,085 INFO L225 Difference]: With dead ends: 279 [2019-12-07 18:11:37,085 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 18:11:37,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=477, Invalid=2829, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 18:11:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 18:11:37,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 231. [2019-12-07 18:11:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-12-07 18:11:37,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 257 transitions. [2019-12-07 18:11:37,088 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 257 transitions. Word has length 48 [2019-12-07 18:11:37,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:37,089 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 257 transitions. [2019-12-07 18:11:37,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 18:11:37,089 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 257 transitions. [2019-12-07 18:11:37,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:11:37,089 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:37,090 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:37,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:37,291 INFO L410 AbstractCegarLoop]: === Iteration 40 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:11:37,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:37,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1194151421, now seen corresponding path program 1 times [2019-12-07 18:11:37,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:37,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615505001] [2019-12-07 18:11:37,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:37,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615505001] [2019-12-07 18:11:37,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481259559] [2019-12-07 18:11:37,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:37,785 INFO L264 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 68 conjunts are in the unsatisfiable core [2019-12-07 18:11:37,786 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:11:37,799 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:37,799 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 18:11:37,800 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:37,817 INFO L614 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-12-07 18:11:37,818 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:37,818 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-12-07 18:11:37,850 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:11:37,850 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:37,861 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:37,863 INFO L377 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 [2019-12-07 18:11:37,863 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:37,872 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:37,872 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:37,873 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-12-07 18:11:37,994 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:37,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-12-07 18:11:37,994 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:38,024 INFO L614 ElimStorePlain]: treesize reduction 24, result has 70.4 percent of original size [2019-12-07 18:11:38,026 INFO L377 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 [2019-12-07 18:11:38,026 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:38,038 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:38,038 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:38,038 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:49 [2019-12-07 18:11:38,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:38,087 INFO L377 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 34 treesize of output 21 [2019-12-07 18:11:38,087 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:38,102 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:38,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:38,105 INFO L377 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 34 treesize of output 21 [2019-12-07 18:11:38,105 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:38,116 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:38,116 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:38,117 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-12-07 18:11:38,118 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_63|], 3=[|v_#valid_116|]} [2019-12-07 18:11:38,120 INFO L377 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 [2019-12-07 18:11:38,121 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:38,137 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:38,146 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:38,146 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 16 treesize of output 26 [2019-12-07 18:11:38,147 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:38,160 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:38,161 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:38,161 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:55 [2019-12-07 18:11:38,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:11:38,211 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:38,227 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:38,229 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:11:38,230 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:38,243 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:38,244 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:38,244 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:57 [2019-12-07 18:11:38,409 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:38,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 112 [2019-12-07 18:11:38,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:38,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:38,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:38,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:38,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:38,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:38,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:38,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:38,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:38,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:38,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:38,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:38,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:38,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:38,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:38,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:38,415 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:38,455 INFO L614 ElimStorePlain]: treesize reduction 60, result has 51.6 percent of original size [2019-12-07 18:11:38,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-12-07 18:11:38,458 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:38,472 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:38,472 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:38,472 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:62 [2019-12-07 18:11:38,521 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_111|], 12=[|v_#memory_$Pointer$.offset_82|]} [2019-12-07 18:11:38,551 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:38,551 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 166 [2019-12-07 18:11:38,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:38,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:38,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:38,553 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:11:38,601 INFO L614 ElimStorePlain]: treesize reduction 301, result has 29.5 percent of original size [2019-12-07 18:11:38,609 INFO L343 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2019-12-07 18:11:38,609 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 43 [2019-12-07 18:11:38,610 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:38,619 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:38,619 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:38,619 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:169, output treesize:83 [2019-12-07 18:11:38,899 INFO L430 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.base|], 12=[|#memory_$Pointer$.offset|]} [2019-12-07 18:11:38,916 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:38,916 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 80 [2019-12-07 18:11:38,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:38,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:38,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:38,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:38,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:38,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:38,918 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:38,941 INFO L614 ElimStorePlain]: treesize reduction 28, result has 64.1 percent of original size [2019-12-07 18:11:38,945 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:38,945 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-12-07 18:11:38,945 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:38,951 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:38,951 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:38,952 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:113, output treesize:9 [2019-12-07 18:11:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:38,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:11:38,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 35 [2019-12-07 18:11:38,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711403479] [2019-12-07 18:11:38,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 18:11:38,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:38,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 18:11:38,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1146, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 18:11:38,967 INFO L87 Difference]: Start difference. First operand 231 states and 257 transitions. Second operand 36 states. [2019-12-07 18:11:42,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:42,835 INFO L93 Difference]: Finished difference Result 284 states and 313 transitions. [2019-12-07 18:11:42,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 18:11:42,836 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 48 [2019-12-07 18:11:42,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:42,838 INFO L225 Difference]: With dead ends: 284 [2019-12-07 18:11:42,838 INFO L226 Difference]: Without dead ends: 284 [2019-12-07 18:11:42,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=280, Invalid=2270, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 18:11:42,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-12-07 18:11:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 233. [2019-12-07 18:11:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-12-07 18:11:42,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 259 transitions. [2019-12-07 18:11:42,844 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 259 transitions. Word has length 48 [2019-12-07 18:11:42,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:42,844 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 259 transitions. [2019-12-07 18:11:42,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 18:11:42,845 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 259 transitions. [2019-12-07 18:11:42,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:11:42,845 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:42,845 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:43,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:43,046 INFO L410 AbstractCegarLoop]: === Iteration 41 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:11:43,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:43,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1894617478, now seen corresponding path program 2 times [2019-12-07 18:11:43,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:43,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047402116] [2019-12-07 18:11:43,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:43,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047402116] [2019-12-07 18:11:43,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429690046] [2019-12-07 18:11:43,252 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:43,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 18:11:43,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:11:43,315 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 18:11:43,315 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:11:43,373 INFO L377 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 19 treesize of output 7 [2019-12-07 18:11:43,374 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:43,376 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:43,376 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:43,376 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-12-07 18:11:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 18:11:43,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:11:43,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 23 [2019-12-07 18:11:43,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546601456] [2019-12-07 18:11:43,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:11:43,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:43,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:11:43,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:11:43,396 INFO L87 Difference]: Start difference. First operand 233 states and 259 transitions. Second operand 7 states. [2019-12-07 18:11:43,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:43,532 INFO L93 Difference]: Finished difference Result 221 states and 244 transitions. [2019-12-07 18:11:43,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:11:43,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-12-07 18:11:43,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:43,533 INFO L225 Difference]: With dead ends: 221 [2019-12-07 18:11:43,533 INFO L226 Difference]: Without dead ends: 221 [2019-12-07 18:11:43,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2019-12-07 18:11:43,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-12-07 18:11:43,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2019-12-07 18:11:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-07 18:11:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 243 transitions. [2019-12-07 18:11:43,535 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 243 transitions. Word has length 49 [2019-12-07 18:11:43,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:43,536 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 243 transitions. [2019-12-07 18:11:43,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:11:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 243 transitions. [2019-12-07 18:11:43,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:11:43,536 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:43,536 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:43,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:43,737 INFO L410 AbstractCegarLoop]: === Iteration 42 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:11:43,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:43,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1286768129, now seen corresponding path program 1 times [2019-12-07 18:11:43,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:43,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837566655] [2019-12-07 18:11:43,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:43,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837566655] [2019-12-07 18:11:43,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056519624] [2019-12-07 18:11:43,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:43,976 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 18:11:43,977 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:11:44,008 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:44,008 INFO L377 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 [2019-12-07 18:11:44,008 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:44,012 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:44,012 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:44,012 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-12-07 18:11:44,028 INFO L377 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 [2019-12-07 18:11:44,028 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:44,034 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:44,034 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:44,034 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-12-07 18:11:44,095 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:44,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 46 [2019-12-07 18:11:44,095 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:44,108 INFO L614 ElimStorePlain]: treesize reduction 24, result has 47.8 percent of original size [2019-12-07 18:11:44,108 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:44,108 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2019-12-07 18:11:44,135 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:44,136 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 64 [2019-12-07 18:11:44,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:44,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:44,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:44,137 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 18:11:44,145 INFO L614 ElimStorePlain]: treesize reduction 42, result has 22.2 percent of original size [2019-12-07 18:11:44,145 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:44,146 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:12 [2019-12-07 18:11:44,213 INFO L377 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 25 treesize of output 13 [2019-12-07 18:11:44,213 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:44,217 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:44,217 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:44,217 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2019-12-07 18:11:44,269 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:44,269 INFO L377 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 16 treesize of output 32 [2019-12-07 18:11:44,269 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:44,278 INFO L614 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-12-07 18:11:44,278 INFO L534 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. [2019-12-07 18:11:44,278 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2019-12-07 18:11:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:44,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:11:44,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2019-12-07 18:11:44,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140264564] [2019-12-07 18:11:44,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 18:11:44,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:44,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 18:11:44,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2019-12-07 18:11:44,305 INFO L87 Difference]: Start difference. First operand 220 states and 243 transitions. Second operand 29 states. [2019-12-07 18:11:45,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:45,311 INFO L93 Difference]: Finished difference Result 233 states and 251 transitions. [2019-12-07 18:11:45,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 18:11:45,312 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 50 [2019-12-07 18:11:45,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:45,313 INFO L225 Difference]: With dead ends: 233 [2019-12-07 18:11:45,313 INFO L226 Difference]: Without dead ends: 233 [2019-12-07 18:11:45,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=1480, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 18:11:45,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-12-07 18:11:45,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 220. [2019-12-07 18:11:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-07 18:11:45,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 242 transitions. [2019-12-07 18:11:45,316 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 242 transitions. Word has length 50 [2019-12-07 18:11:45,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:45,316 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 242 transitions. [2019-12-07 18:11:45,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 18:11:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 242 transitions. [2019-12-07 18:11:45,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:11:45,316 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:45,316 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:45,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:45,517 INFO L410 AbstractCegarLoop]: === Iteration 43 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:11:45,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:45,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1286768130, now seen corresponding path program 1 times [2019-12-07 18:11:45,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:45,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547002422] [2019-12-07 18:11:45,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:45,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547002422] [2019-12-07 18:11:45,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031729166] [2019-12-07 18:11:45,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:45,868 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 18:11:45,868 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:11:45,962 INFO L377 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 23 treesize of output 15 [2019-12-07 18:11:45,962 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:45,975 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:45,977 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-12-07 18:11:45,977 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:45,981 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:45,981 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:45,981 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:16 [2019-12-07 18:11:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:11:46,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:11:46,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 26 [2019-12-07 18:11:46,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711102701] [2019-12-07 18:11:46,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 18:11:46,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:46,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 18:11:46,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:11:46,068 INFO L87 Difference]: Start difference. First operand 220 states and 242 transitions. Second operand 27 states. [2019-12-07 18:11:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:49,454 INFO L93 Difference]: Finished difference Result 253 states and 275 transitions. [2019-12-07 18:11:49,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 18:11:49,455 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-12-07 18:11:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:49,459 INFO L225 Difference]: With dead ends: 253 [2019-12-07 18:11:49,459 INFO L226 Difference]: Without dead ends: 253 [2019-12-07 18:11:49,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=511, Invalid=2459, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 18:11:49,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-12-07 18:11:49,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 226. [2019-12-07 18:11:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-12-07 18:11:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 247 transitions. [2019-12-07 18:11:49,469 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 247 transitions. Word has length 50 [2019-12-07 18:11:49,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:49,469 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 247 transitions. [2019-12-07 18:11:49,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 18:11:49,470 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 247 transitions. [2019-12-07 18:11:49,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:11:49,471 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:49,471 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:49,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:49,673 INFO L410 AbstractCegarLoop]: === Iteration 44 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:11:49,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:49,674 INFO L82 PathProgramCache]: Analyzing trace with hash 246424985, now seen corresponding path program 4 times [2019-12-07 18:11:49,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:49,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909845961] [2019-12-07 18:11:49,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:50,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909845961] [2019-12-07 18:11:50,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579237840] [2019-12-07 18:11:50,033 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:50,106 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 18:11:50,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:11:50,107 INFO L264 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 61 conjunts are in the unsatisfiable core [2019-12-07 18:11:50,108 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:11:50,178 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:50,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 18:11:50,178 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:50,195 INFO L614 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-12-07 18:11:50,196 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:50,196 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-12-07 18:11:50,227 INFO L377 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 [2019-12-07 18:11:50,228 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:50,249 INFO L614 ElimStorePlain]: treesize reduction 5, result has 89.4 percent of original size [2019-12-07 18:11:50,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:11:50,251 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:50,260 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:50,260 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:50,260 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-12-07 18:11:50,378 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:50,378 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-12-07 18:11:50,378 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:50,407 INFO L614 ElimStorePlain]: treesize reduction 24, result has 70.4 percent of original size [2019-12-07 18:11:50,409 INFO L377 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 [2019-12-07 18:11:50,410 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:50,420 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:50,421 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:50,421 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:49 [2019-12-07 18:11:50,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:50,469 INFO L377 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 34 treesize of output 21 [2019-12-07 18:11:50,469 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:50,484 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:50,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:50,487 INFO L377 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 34 treesize of output 21 [2019-12-07 18:11:50,488 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:50,499 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:50,499 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:50,499 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-12-07 18:11:50,520 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:50,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-12-07 18:11:50,521 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:50,559 INFO L614 ElimStorePlain]: treesize reduction 28, result has 68.9 percent of original size [2019-12-07 18:11:50,559 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:50,559 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:62 [2019-12-07 18:11:50,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:11:50,613 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:50,632 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:50,634 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:11:50,635 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:50,650 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:50,650 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:50,650 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:84, output treesize:60 [2019-12-07 18:11:50,795 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_87|], 6=[|v_#memory_$Pointer$.base_119|]} [2019-12-07 18:11:50,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:50,798 INFO L377 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 19 treesize of output 18 [2019-12-07 18:11:50,798 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:50,815 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:50,843 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:50,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 110 [2019-12-07 18:11:50,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:50,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:50,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:50,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:50,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:50,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:50,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,849 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:50,887 INFO L614 ElimStorePlain]: treesize reduction 60, result has 51.2 percent of original size [2019-12-07 18:11:50,888 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:50,888 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:65 [2019-12-07 18:11:50,963 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:50,964 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 164 [2019-12-07 18:11:50,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:50,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:50,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:50,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:50,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:50,967 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:51,050 INFO L614 ElimStorePlain]: treesize reduction 2046, result has 5.9 percent of original size [2019-12-07 18:11:51,063 INFO L343 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2019-12-07 18:11:51,063 INFO L377 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 1 case distinctions, treesize of input 66 treesize of output 29 [2019-12-07 18:11:51,063 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:51,076 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:51,076 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:51,076 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:172, output treesize:86 [2019-12-07 18:11:51,198 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 30 treesize of output 10 [2019-12-07 18:11:51,198 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:51,210 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:51,210 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:51,210 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:100, output treesize:74 [2019-12-07 18:11:51,420 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:51,421 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 41 [2019-12-07 18:11:51,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:51,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:51,423 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:51,486 INFO L614 ElimStorePlain]: treesize reduction 12, result has 70.0 percent of original size [2019-12-07 18:11:51,487 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:51,487 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:28 [2019-12-07 18:11:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:51,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:11:51,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2019-12-07 18:11:51,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748402109] [2019-12-07 18:11:51,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 18:11:51,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:51,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 18:11:51,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1375, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 18:11:51,849 INFO L87 Difference]: Start difference. First operand 226 states and 247 transitions. Second operand 40 states. [2019-12-07 18:11:54,320 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-12-07 18:11:54,656 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-12-07 18:11:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:56,462 INFO L93 Difference]: Finished difference Result 288 states and 313 transitions. [2019-12-07 18:11:56,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 18:11:56,464 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 50 [2019-12-07 18:11:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:56,468 INFO L225 Difference]: With dead ends: 288 [2019-12-07 18:11:56,468 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 18:11:56,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=462, Invalid=2730, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 18:11:56,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 18:11:56,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 232. [2019-12-07 18:11:56,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-07 18:11:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 256 transitions. [2019-12-07 18:11:56,478 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 256 transitions. Word has length 50 [2019-12-07 18:11:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:56,478 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 256 transitions. [2019-12-07 18:11:56,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 18:11:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 256 transitions. [2019-12-07 18:11:56,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:11:56,480 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:56,480 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:56,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:56,681 INFO L410 AbstractCegarLoop]: === Iteration 45 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:11:56,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:56,682 INFO L82 PathProgramCache]: Analyzing trace with hash 246424986, now seen corresponding path program 3 times [2019-12-07 18:11:56,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:56,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399991684] [2019-12-07 18:11:56,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:57,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399991684] [2019-12-07 18:11:57,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465592515] [2019-12-07 18:11:57,015 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:11:57,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 18:11:57,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:11:57,121 INFO L264 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 72 conjunts are in the unsatisfiable core [2019-12-07 18:11:57,122 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:11:57,125 INFO L377 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 [2019-12-07 18:11:57,125 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,129 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:57,129 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,129 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 18:11:57,192 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:57,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 18:11:57,193 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,212 INFO L614 ElimStorePlain]: treesize reduction 14, result has 68.2 percent of original size [2019-12-07 18:11:57,212 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,212 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2019-12-07 18:11:57,250 INFO L377 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 [2019-12-07 18:11:57,250 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,273 INFO L614 ElimStorePlain]: treesize reduction 5, result has 90.0 percent of original size [2019-12-07 18:11:57,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:11:57,276 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,286 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:57,286 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,286 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:42 [2019-12-07 18:11:57,403 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:11:57,410 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:57,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 43 [2019-12-07 18:11:57,411 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,441 INFO L614 ElimStorePlain]: treesize reduction 16, result has 78.9 percent of original size [2019-12-07 18:11:57,444 INFO L377 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 [2019-12-07 18:11:57,444 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,458 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:57,459 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,459 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:52 [2019-12-07 18:11:57,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:57,598 INFO L377 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 34 treesize of output 21 [2019-12-07 18:11:57,599 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,681 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:57,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:57,693 INFO L377 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 34 treesize of output 21 [2019-12-07 18:11:57,694 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:57,734 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,735 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:52 [2019-12-07 18:11:57,736 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_64|], 3=[|v_#valid_123|]} [2019-12-07 18:11:57,739 INFO L377 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 [2019-12-07 18:11:57,739 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,762 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:57,775 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:57,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 16 treesize of output 26 [2019-12-07 18:11:57,775 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,796 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:57,796 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,796 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:58 [2019-12-07 18:11:57,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:11:57,875 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,900 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:57,903 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:11:57,903 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,926 INFO L614 ElimStorePlain]: treesize reduction 4, result has 92.7 percent of original size [2019-12-07 18:11:57,927 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:57,927 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:56 [2019-12-07 18:11:58,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:58,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:58,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:58,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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 [2019-12-07 18:11:58,053 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:58,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:58,093 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:58,094 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 104 [2019-12-07 18:11:58,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:58,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:58,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:58,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:58,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:58,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:58,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:58,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:58,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:58,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:58,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:58,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:58,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:58,098 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:58,133 INFO L614 ElimStorePlain]: treesize reduction 56, result has 51.3 percent of original size [2019-12-07 18:11:58,133 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:58,133 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:57 [2019-12-07 18:11:58,189 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_126|], 12=[|v_#memory_$Pointer$.offset_94|]} [2019-12-07 18:11:58,238 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:58,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 158 [2019-12-07 18:11:58,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:11:58,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:58,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:58,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:58,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:58,240 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 18:11:58,289 INFO L614 ElimStorePlain]: treesize reduction 447, result has 21.3 percent of original size [2019-12-07 18:11:58,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:11:58,298 INFO L343 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2019-12-07 18:11:58,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 43 [2019-12-07 18:11:58,299 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:58,309 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:58,309 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:58,309 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:164, output treesize:78 [2019-12-07 18:11:58,529 INFO L430 ElimStorePlain]: Different costs {5=[|#memory_$Pointer$.base|], 11=[|#memory_$Pointer$.offset|]} [2019-12-07 18:11:58,541 INFO L343 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-12-07 18:11:58,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 56 [2019-12-07 18:11:58,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:58,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:11:58,542 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:11:58,565 INFO L614 ElimStorePlain]: treesize reduction 4, result has 92.6 percent of original size [2019-12-07 18:11:58,570 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:58,570 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-12-07 18:11:58,571 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:11:58,577 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:11:58,577 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:11:58,577 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:105, output treesize:9 [2019-12-07 18:11:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:58,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:11:58,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2019-12-07 18:11:58,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32272594] [2019-12-07 18:11:58,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-07 18:11:58,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:58,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 18:11:58,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1259, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 18:11:58,627 INFO L87 Difference]: Start difference. First operand 232 states and 256 transitions. Second operand 38 states. [2019-12-07 18:11:59,616 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-12-07 18:12:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:02,908 INFO L93 Difference]: Finished difference Result 292 states and 318 transitions. [2019-12-07 18:12:02,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 18:12:02,909 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 50 [2019-12-07 18:12:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:02,912 INFO L225 Difference]: With dead ends: 292 [2019-12-07 18:12:02,912 INFO L226 Difference]: Without dead ends: 292 [2019-12-07 18:12:02,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=316, Invalid=2336, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 18:12:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-12-07 18:12:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 228. [2019-12-07 18:12:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-12-07 18:12:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 250 transitions. [2019-12-07 18:12:02,918 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 250 transitions. Word has length 50 [2019-12-07 18:12:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:02,919 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 250 transitions. [2019-12-07 18:12:02,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-07 18:12:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 250 transitions. [2019-12-07 18:12:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:12:02,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:02,920 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:12:03,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:12:03,121 INFO L410 AbstractCegarLoop]: === Iteration 46 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:12:03,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:03,121 INFO L82 PathProgramCache]: Analyzing trace with hash 204406732, now seen corresponding path program 2 times [2019-12-07 18:12:03,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:03,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489028562] [2019-12-07 18:12:03,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:04,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489028562] [2019-12-07 18:12:04,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576710718] [2019-12-07 18:12:04,101 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:12:04,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:12:04,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:12:04,185 INFO L264 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 68 conjunts are in the unsatisfiable core [2019-12-07 18:12:04,186 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:12:04,195 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:12:04,196 INFO L377 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 [2019-12-07 18:12:04,196 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:12:04,208 INFO L614 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-12-07 18:12:04,208 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:12:04,209 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-12-07 18:12:04,305 INFO L343 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-12-07 18:12:04,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 69 [2019-12-07 18:12:04,306 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:12:04,331 INFO L614 ElimStorePlain]: treesize reduction 28, result has 56.3 percent of original size [2019-12-07 18:12:04,332 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:12:04,332 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:36 [2019-12-07 18:12:04,378 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-12-07 18:12:04,379 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:12:04,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:12:04,395 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:12:04,395 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:12:04,408 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:12:04,408 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:12:04,408 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:48 [2019-12-07 18:12:04,561 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:12:04,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 55 [2019-12-07 18:12:04,562 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:12:04,596 INFO L614 ElimStorePlain]: treesize reduction 24, result has 72.1 percent of original size [2019-12-07 18:12:04,599 INFO L377 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 19 treesize of output 18 [2019-12-07 18:12:04,599 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:12:04,612 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:12:04,613 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:12:04,613 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:58 [2019-12-07 18:12:04,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:12:04,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-12-07 18:12:04,669 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:12:04,687 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:12:04,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:12:04,694 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-12-07 18:12:04,694 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:12:04,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:12:04,708 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:12:04,708 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:58 [2019-12-07 18:12:04,723 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:12:04,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2019-12-07 18:12:04,723 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:12:04,736 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:12:04,736 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:12:04,736 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:55 [2019-12-07 18:12:04,796 INFO L377 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 26 treesize of output 21 [2019-12-07 18:12:04,797 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:12:04,813 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:12:04,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:12:04,816 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:12:04,829 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:12:04,829 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:12:04,829 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:53 [2019-12-07 18:12:04,974 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_99|], 6=[|v_#memory_$Pointer$.base_131|]} [2019-12-07 18:12:04,987 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:12:04,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 90 [2019-12-07 18:12:04,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:04,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:04,988 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:12:05,021 INFO L614 ElimStorePlain]: treesize reduction 24, result has 80.0 percent of original size [2019-12-07 18:12:05,050 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:12:05,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 108 [2019-12-07 18:12:05,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:05,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:05,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:05,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:05,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:05,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:05,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,057 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:12:05,093 INFO L614 ElimStorePlain]: treesize reduction 60, result has 49.6 percent of original size [2019-12-07 18:12:05,094 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:12:05,094 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:109, output treesize:65 [2019-12-07 18:12:05,153 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_100|], 12=[|v_#memory_$Pointer$.base_132|]} [2019-12-07 18:12:05,192 INFO L343 Elim1Store]: treesize reduction 46, result has 55.3 percent of original size [2019-12-07 18:12:05,193 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 201 treesize of output 192 [2019-12-07 18:12:05,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:05,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,194 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 18:12:05,264 INFO L614 ElimStorePlain]: treesize reduction 325, result has 33.7 percent of original size [2019-12-07 18:12:05,498 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-12-07 18:12:05,499 INFO L343 Elim1Store]: treesize reduction 54, result has 69.3 percent of original size [2019-12-07 18:12:05,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 162 treesize of output 173 [2019-12-07 18:12:05,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:05,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:05,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:05,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:05,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:05,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:05,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:05,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:05,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:05,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:12:05,530 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2019-12-07 18:12:05,683 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2019-12-07 18:12:05,684 INFO L614 ElimStorePlain]: treesize reduction 2255, result has 4.7 percent of original size [2019-12-07 18:12:05,684 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:12:05,685 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:220, output treesize:110 [2019-12-07 18:12:05,956 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:12:05,956 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 85 [2019-12-07 18:12:05,957 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:12:05,975 INFO L614 ElimStorePlain]: treesize reduction 20, result has 79.8 percent of original size [2019-12-07 18:12:05,975 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:12:05,975 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:121, output treesize:79 [2019-12-07 18:12:06,096 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:12:06,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 69 [2019-12-07 18:12:06,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:06,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:06,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:12:06,097 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:12:06,105 INFO L614 ElimStorePlain]: treesize reduction 77, result has 10.5 percent of original size [2019-12-07 18:12:06,105 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:12:06,106 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:4 [2019-12-07 18:12:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:06,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:12:06,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 41 [2019-12-07 18:12:06,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191565533] [2019-12-07 18:12:06,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-07 18:12:06,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:06,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-07 18:12:06,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1485, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 18:12:06,123 INFO L87 Difference]: Start difference. First operand 228 states and 250 transitions. Second operand 41 states. [2019-12-07 18:12:06,922 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-12-07 18:12:07,221 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-12-07 18:12:07,957 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-12-07 18:12:08,760 WARN L192 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-12-07 18:12:09,229 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-12-07 18:12:09,612 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 51 [2019-12-07 18:12:09,960 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-12-07 18:12:10,601 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-12-07 18:12:12,572 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 74 [2019-12-07 18:12:12,966 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-07 18:12:16,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:16,128 INFO L93 Difference]: Finished difference Result 288 states and 314 transitions. [2019-12-07 18:12:16,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 18:12:16,128 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 50 [2019-12-07 18:12:16,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:16,130 INFO L225 Difference]: With dead ends: 288 [2019-12-07 18:12:16,130 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 18:12:16,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=585, Invalid=3837, Unknown=0, NotChecked=0, Total=4422 [2019-12-07 18:12:16,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 18:12:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 231. [2019-12-07 18:12:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-12-07 18:12:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 252 transitions. [2019-12-07 18:12:16,134 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 252 transitions. Word has length 50 [2019-12-07 18:12:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:16,134 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 252 transitions. [2019-12-07 18:12:16,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-07 18:12:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 252 transitions. [2019-12-07 18:12:16,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:12:16,135 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:16,135 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:12:16,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:12:16,336 INFO L410 AbstractCegarLoop]: === Iteration 47 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_LEAK, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_LEAK, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 18:12:16,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:16,337 INFO L82 PathProgramCache]: Analyzing trace with hash 823250396, now seen corresponding path program 1 times [2019-12-07 18:12:16,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:16,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757800222] [2019-12-07 18:12:16,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:12:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:12:16,384 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:12:16,384 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:12:16,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:12:16 BoogieIcfgContainer [2019-12-07 18:12:16,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:12:16,424 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:12:16,424 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:12:16,424 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:12:16,424 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:09:30" (3/4) ... [2019-12-07 18:12:16,426 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:12:16,460 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_caceacf9-2252-4db1-904c-1a76d893af52/bin/uautomizer/witness.graphml [2019-12-07 18:12:16,460 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:12:16,460 INFO L168 Benchmark]: Toolchain (without parser) took 166806.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -123.4 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:12:16,461 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:12:16,461 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:12:16,461 INFO L168 Benchmark]: Boogie Preprocessor took 42.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:12:16,461 INFO L168 Benchmark]: RCFGBuilder took 402.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:12:16,461 INFO L168 Benchmark]: TraceAbstraction took 166000.90 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 43.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -56.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:12:16,461 INFO L168 Benchmark]: Witness Printer took 35.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:12:16,462 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 402.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 166000.90 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 43.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -56.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 35.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1039]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L994] SLL* null = malloc(sizeof(SLL)); VAL [malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L995] null->colour = BLACK VAL [malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L996] null->next = ((void*)0) VAL [malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L998] SLL* list = malloc(sizeof(SLL)); VAL [list={-3:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L999] list->next = null VAL [list={-3:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1000] list->colour = BLACK VAL [list={-3:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1002] SLL* end = list; VAL [end={-3:0}, list={-3:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1005] COND TRUE __VERIFIER_nondet_int() [L1008] end->next = malloc(sizeof(SLL)) VAL [end={-3:0}, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1009] EXPR end->next VAL [end={-3:0}, end->next={-1:0}, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1009] end = end->next [L1010] end->next = null VAL [end={-1:0}, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1018] end->colour = RED VAL [end={-1:0}, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1019] end->next = malloc(sizeof(SLL)) VAL [end={-1:0}, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1020] EXPR end->next VAL [end={-1:0}, end->next={-2:0}, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1020] end = end->next [L1021] end->next = null VAL [end={-2:0}, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1022] end->colour = BLACK VAL [end={-2:0}, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={-3:0}, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={-3:0}, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1031] EXPR end->colour VAL [end={-3:0}, end->colour=1, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1033] COND TRUE null != end VAL [end={-3:0}, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1035] EXPR end->colour VAL [end={-3:0}, end->colour=1, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1035] COND FALSE !(RED == end->colour) [L1042] EXPR end->next VAL [end={-3:0}, end->next={-1:0}, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1042] end = end->next [L1033] COND TRUE null != end VAL [end={-1:0}, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1035] EXPR end->colour VAL [end={-1:0}, end->colour=0, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1035] COND TRUE RED == end->colour [L1037] EXPR end->next VAL [end={-1:0}, end->next={-2:0}, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1037] end = end->next [L1038] COND FALSE !(!(null != end)) VAL [end={-2:0}, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1039] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] [L1039] COND TRUE !(BLACK != end->colour) [L1039] __VERIFIER_error() VAL [end={-2:0}, list={-3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-3:0}, malloc(sizeof(SLL))={-4:0}, null={-4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 136 locations, 61 error locations. Result: UNSAFE, OverallTime: 165.9s, OverallIterations: 47, TraceHistogramMax: 3, AutomataDifference: 119.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3335 SDtfs, 16289 SDslu, 23148 SDs, 0 SdLazy, 55986 SolverSat, 3275 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 70.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2598 GetRequests, 1059 SyntacticMatches, 57 SemanticMatches, 1482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17267 ImplicationChecksByTransitivity, 61.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 46 MinimizatonAttempts, 2190 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 36.7s InterpolantComputationTime, 3029 NumberOfCodeBlocks, 3005 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 2901 ConstructedInterpolants, 298 QuantifiedInterpolants, 2659978 SizeOfPredicates, 482 NumberOfNonLiveVariables, 6561 ConjunctsInSsa, 1310 ConjunctsInUnsatCore, 78 InterpolantComputations, 17 PerfectInterpolantSequences, 44/484 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...