./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 760c75961baa7cc196b373809e9a87dd0bcf8eb7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 760c75961baa7cc196b373809e9a87dd0bcf8eb7 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 09:50:08,806 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:50:08,807 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:50:08,813 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:50:08,814 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:50:08,814 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:50:08,815 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:50:08,817 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:50:08,818 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:50:08,818 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:50:08,819 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:50:08,819 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:50:08,820 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:50:08,821 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:50:08,821 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:50:08,822 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:50:08,823 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:50:08,824 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:50:08,825 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:50:08,826 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:50:08,827 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:50:08,828 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:50:08,829 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:50:08,830 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:50:08,830 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:50:08,830 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:50:08,831 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:50:08,832 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:50:08,832 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:50:08,833 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:50:08,833 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:50:08,834 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:50:08,834 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:50:08,834 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:50:08,835 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:50:08,835 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:50:08,835 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-09 09:50:08,843 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:50:08,843 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:50:08,843 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:50:08,843 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:50:08,844 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 09:50:08,844 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 09:50:08,844 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 09:50:08,844 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:50:08,844 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:50:08,844 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 09:50:08,844 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:50:08,844 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:50:08,844 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:50:08,844 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 09:50:08,844 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 09:50:08,844 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 09:50:08,845 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:50:08,845 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:50:08,845 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 09:50:08,845 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:50:08,845 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:50:08,845 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:50:08,845 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:50:08,845 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:50:08,845 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:50:08,845 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:50:08,845 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 09:50:08,845 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:50:08,846 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 760c75961baa7cc196b373809e9a87dd0bcf8eb7 [2018-12-09 09:50:08,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:50:08,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:50:08,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:50:08,874 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:50:08,874 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:50:08,874 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order_false-valid-memtrack.i [2018-12-09 09:50:08,911 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/data/81a264eef/c791211559d44dfa977353de92f20812/FLAGb75b4c316 [2018-12-09 09:50:09,351 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:50:09,351 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order_false-valid-memtrack.i [2018-12-09 09:50:09,357 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/data/81a264eef/c791211559d44dfa977353de92f20812/FLAGb75b4c316 [2018-12-09 09:50:09,365 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/data/81a264eef/c791211559d44dfa977353de92f20812 [2018-12-09 09:50:09,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:50:09,368 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 09:50:09,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:50:09,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:50:09,371 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:50:09,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:50:09" (1/1) ... [2018-12-09 09:50:09,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b1aa1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:09, skipping insertion in model container [2018-12-09 09:50:09,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:50:09" (1/1) ... [2018-12-09 09:50:09,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:50:09,401 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:50:09,554 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:50:09,559 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:50:09,620 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:50:09,640 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:50:09,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:09 WrapperNode [2018-12-09 09:50:09,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:50:09,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:50:09,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:50:09,641 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:50:09,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:09" (1/1) ... [2018-12-09 09:50:09,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:09" (1/1) ... [2018-12-09 09:50:09,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:09" (1/1) ... [2018-12-09 09:50:09,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:09" (1/1) ... [2018-12-09 09:50:09,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:09" (1/1) ... [2018-12-09 09:50:09,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:09" (1/1) ... [2018-12-09 09:50:09,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:09" (1/1) ... [2018-12-09 09:50:09,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:50:09,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:50:09,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:50:09,674 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:50:09,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/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 [2018-12-09 09:50:09,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:50:09,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:50:09,706 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-09 09:50:09,706 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-09 09:50:09,706 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 09:50:09,706 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-12-09 09:50:09,706 INFO L138 BoogieDeclarations]: Found implementation of procedure _destroy_in_nondeterministic_order [2018-12-09 09:50:09,706 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:50:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-09 09:50:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-09 09:50:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-09 09:50:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 09:50:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 09:50:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 09:50:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 09:50:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 09:50:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 09:50:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 09:50:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 09:50:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 09:50:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 09:50:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 09:50:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 09:50:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 09:50:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 09:50:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 09:50:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 09:50:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 09:50:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 09:50:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 09:50:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 09:50:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 09:50:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 09:50:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 09:50:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 09:50:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 09:50:09,709 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 09:50:09,709 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 09:50:09,709 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 09:50:09,709 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 09:50:09,709 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 09:50:09,709 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 09:50:09,709 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 09:50:09,709 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 09:50:09,709 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 09:50:09,709 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 09:50:09,710 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 09:50:09,710 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 09:50:09,710 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 09:50:09,710 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 09:50:09,710 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 09:50:09,710 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 09:50:09,710 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 09:50:09,710 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 09:50:09,710 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 09:50:09,711 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 09:50:09,711 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 09:50:09,711 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 09:50:09,711 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 09:50:09,711 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 09:50:09,711 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 09:50:09,711 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 09:50:09,711 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 09:50:09,711 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 09:50:09,712 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 09:50:09,712 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 09:50:09,712 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 09:50:09,712 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 09:50:09,712 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 09:50:09,712 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-09 09:50:09,712 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 09:50:09,712 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 09:50:09,712 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-09 09:50:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 09:50:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 09:50:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-09 09:50:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 09:50:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 09:50:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 09:50:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 09:50:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 09:50:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 09:50:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 09:50:09,714 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 09:50:09,714 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 09:50:09,714 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 09:50:09,714 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 09:50:09,714 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 09:50:09,714 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 09:50:09,714 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 09:50:09,714 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 09:50:09,714 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 09:50:09,715 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 09:50:09,715 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 09:50:09,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 09:50:09,715 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 09:50:09,715 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 09:50:09,715 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 09:50:09,715 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 09:50:09,715 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 09:50:09,715 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 09:50:09,715 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 09:50:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 09:50:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 09:50:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 09:50:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 09:50:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 09:50:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 09:50:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 09:50:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 09:50:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 09:50:09,717 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 09:50:09,717 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 09:50:09,717 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 09:50:09,717 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 09:50:09,717 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-12-09 09:50:09,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 09:50:09,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 09:50:09,717 INFO L130 BoogieDeclarations]: Found specification of procedure _destroy_in_nondeterministic_order [2018-12-09 09:50:09,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 09:50:09,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 09:50:09,718 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:50:09,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:50:09,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:50:10,035 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:50:10,036 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 09:50:10,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:50:10 BoogieIcfgContainer [2018-12-09 09:50:10,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:50:10,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:50:10,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:50:10,039 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:50:10,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:50:09" (1/3) ... [2018-12-09 09:50:10,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3e0558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:50:10, skipping insertion in model container [2018-12-09 09:50:10,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:09" (2/3) ... [2018-12-09 09:50:10,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3e0558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:50:10, skipping insertion in model container [2018-12-09 09:50:10,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:50:10" (3/3) ... [2018-12-09 09:50:10,041 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order_false-valid-memtrack.i [2018-12-09 09:50:10,047 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:50:10,052 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-12-09 09:50:10,061 INFO L257 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2018-12-09 09:50:10,075 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 09:50:10,076 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:50:10,076 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 09:50:10,076 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:50:10,076 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:50:10,076 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:50:10,076 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:50:10,076 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:50:10,076 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:50:10,087 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2018-12-09 09:50:10,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 09:50:10,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:10,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:50:10,094 INFO L423 AbstractCegarLoop]: === Iteration 1 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:10,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:10,098 INFO L82 PathProgramCache]: Analyzing trace with hash -850117372, now seen corresponding path program 1 times [2018-12-09 09:50:10,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:10,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:10,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:10,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:10,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:10,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:50:10,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:50:10,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:50:10,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:50:10,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:50:10,202 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 3 states. [2018-12-09 09:50:10,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:10,289 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2018-12-09 09:50:10,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:50:10,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 09:50:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:10,296 INFO L225 Difference]: With dead ends: 115 [2018-12-09 09:50:10,296 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 09:50:10,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:50:10,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 09:50:10,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-09 09:50:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-09 09:50:10,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-12-09 09:50:10,320 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 10 [2018-12-09 09:50:10,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:10,321 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-12-09 09:50:10,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:50:10,321 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-12-09 09:50:10,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 09:50:10,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:10,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:50:10,321 INFO L423 AbstractCegarLoop]: === Iteration 2 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:10,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:10,322 INFO L82 PathProgramCache]: Analyzing trace with hash -850117371, now seen corresponding path program 1 times [2018-12-09 09:50:10,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:10,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:10,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:10,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:10,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:10,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:50:10,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:50:10,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:50:10,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:50:10,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:50:10,354 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 3 states. [2018-12-09 09:50:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:10,380 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-09 09:50:10,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:50:10,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 09:50:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:10,381 INFO L225 Difference]: With dead ends: 105 [2018-12-09 09:50:10,381 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 09:50:10,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:50:10,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 09:50:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-09 09:50:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 09:50:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-12-09 09:50:10,386 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 10 [2018-12-09 09:50:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:10,386 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-12-09 09:50:10,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:50:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-12-09 09:50:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 09:50:10,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:10,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:50:10,387 INFO L423 AbstractCegarLoop]: === Iteration 3 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:10,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:10,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1981617807, now seen corresponding path program 1 times [2018-12-09 09:50:10,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:10,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:10,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:10,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:10,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:10,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:50:10,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:50:10,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:50:10,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:50:10,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:50:10,431 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 5 states. [2018-12-09 09:50:10,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:10,519 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-12-09 09:50:10,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:50:10,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-12-09 09:50:10,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:10,520 INFO L225 Difference]: With dead ends: 115 [2018-12-09 09:50:10,520 INFO L226 Difference]: Without dead ends: 115 [2018-12-09 09:50:10,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:50:10,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-09 09:50:10,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-12-09 09:50:10,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-09 09:50:10,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2018-12-09 09:50:10,525 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 15 [2018-12-09 09:50:10,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:10,525 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2018-12-09 09:50:10,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:50:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2018-12-09 09:50:10,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 09:50:10,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:10,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:50:10,526 INFO L423 AbstractCegarLoop]: === Iteration 4 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:10,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:10,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1981617806, now seen corresponding path program 1 times [2018-12-09 09:50:10,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:10,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:10,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:10,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:10,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:10,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:50:10,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:50:10,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:50:10,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:50:10,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:50:10,552 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 5 states. [2018-12-09 09:50:10,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:10,566 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-12-09 09:50:10,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:50:10,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-12-09 09:50:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:10,567 INFO L225 Difference]: With dead ends: 113 [2018-12-09 09:50:10,567 INFO L226 Difference]: Without dead ends: 113 [2018-12-09 09:50:10,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:50:10,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-09 09:50:10,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2018-12-09 09:50:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 09:50:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-12-09 09:50:10,571 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 15 [2018-12-09 09:50:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:10,571 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-12-09 09:50:10,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:50:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-12-09 09:50:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 09:50:10,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:10,571 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:50:10,572 INFO L423 AbstractCegarLoop]: === Iteration 5 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:10,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1981616270, now seen corresponding path program 1 times [2018-12-09 09:50:10,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:10,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:10,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:10,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:10,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:10,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:50:10,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:50:10,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:50:10,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:50:10,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:50:10,590 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 3 states. [2018-12-09 09:50:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:10,631 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2018-12-09 09:50:10,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:50:10,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-09 09:50:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:10,632 INFO L225 Difference]: With dead ends: 108 [2018-12-09 09:50:10,632 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 09:50:10,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:50:10,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 09:50:10,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-09 09:50:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-09 09:50:10,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2018-12-09 09:50:10,635 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 15 [2018-12-09 09:50:10,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:10,635 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2018-12-09 09:50:10,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:50:10,636 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2018-12-09 09:50:10,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 09:50:10,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:10,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:50:10,636 INFO L423 AbstractCegarLoop]: === Iteration 6 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:10,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:10,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1981616269, now seen corresponding path program 1 times [2018-12-09 09:50:10,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:10,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:10,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:10,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:10,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:10,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:50:10,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:50:10,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:50:10,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:50:10,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:50:10,668 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 3 states. [2018-12-09 09:50:10,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:10,687 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-12-09 09:50:10,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:50:10,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-09 09:50:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:10,688 INFO L225 Difference]: With dead ends: 107 [2018-12-09 09:50:10,688 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 09:50:10,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:50:10,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 09:50:10,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-09 09:50:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 09:50:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-12-09 09:50:10,691 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 15 [2018-12-09 09:50:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:10,692 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-12-09 09:50:10,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:50:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-12-09 09:50:10,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 09:50:10,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:10,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:50:10,693 INFO L423 AbstractCegarLoop]: === Iteration 7 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:10,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:10,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1300562127, now seen corresponding path program 1 times [2018-12-09 09:50:10,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:10,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:10,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:10,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:10,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:10,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:50:10,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:50:10,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:50:10,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:50:10,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:50:10,760 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 6 states. [2018-12-09 09:50:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:10,831 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-12-09 09:50:10,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:50:10,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-09 09:50:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:10,832 INFO L225 Difference]: With dead ends: 108 [2018-12-09 09:50:10,832 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 09:50:10,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:50:10,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 09:50:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-12-09 09:50:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 09:50:10,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-12-09 09:50:10,837 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 16 [2018-12-09 09:50:10,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:10,837 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-12-09 09:50:10,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:50:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-12-09 09:50:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 09:50:10,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:10,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:50:10,839 INFO L423 AbstractCegarLoop]: === Iteration 8 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:10,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:10,839 INFO L82 PathProgramCache]: Analyzing trace with hash -239657757, now seen corresponding path program 1 times [2018-12-09 09:50:10,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:10,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:10,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:10,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:10,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:10,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:50:10,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:50:10,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:50:10,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:50:10,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:50:10,870 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 4 states. [2018-12-09 09:50:10,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:10,934 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-09 09:50:10,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:50:10,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 09:50:10,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:10,935 INFO L225 Difference]: With dead ends: 105 [2018-12-09 09:50:10,935 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 09:50:10,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:50:10,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 09:50:10,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-09 09:50:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 09:50:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-12-09 09:50:10,939 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 20 [2018-12-09 09:50:10,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:10,939 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-12-09 09:50:10,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:50:10,939 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-12-09 09:50:10,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 09:50:10,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:10,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:50:10,940 INFO L423 AbstractCegarLoop]: === Iteration 9 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:10,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:10,941 INFO L82 PathProgramCache]: Analyzing trace with hash -239657756, now seen corresponding path program 1 times [2018-12-09 09:50:10,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:10,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:10,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:10,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:10,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:10,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:50:10,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:50:10,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:11,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:50:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:11,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:50:11,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-09 09:50:11,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:50:11,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:50:11,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:50:11,051 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 6 states. [2018-12-09 09:50:11,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:11,071 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-12-09 09:50:11,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:50:11,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-09 09:50:11,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:11,072 INFO L225 Difference]: With dead ends: 107 [2018-12-09 09:50:11,072 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 09:50:11,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:50:11,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 09:50:11,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-09 09:50:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 09:50:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-12-09 09:50:11,075 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 20 [2018-12-09 09:50:11,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:11,075 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-12-09 09:50:11,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:50:11,076 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-12-09 09:50:11,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 09:50:11,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:11,076 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:50:11,077 INFO L423 AbstractCegarLoop]: === Iteration 10 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:11,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:11,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1160591871, now seen corresponding path program 1 times [2018-12-09 09:50:11,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:11,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:11,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:11,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:11,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:11,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:50:11,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:50:11,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:11,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:50:11,170 INFO L478 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 [2018-12-09 09:50:11,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:11,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:11,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 09:50:11,194 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:50:11,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:11,199 INFO L267 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. [2018-12-09 09:50:11,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-09 09:50:11,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:11,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:50:11,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-12-09 09:50:11,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:50:11,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:50:11,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:50:11,222 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 7 states. [2018-12-09 09:50:11,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:11,310 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-09 09:50:11,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:50:11,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-09 09:50:11,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:11,311 INFO L225 Difference]: With dead ends: 105 [2018-12-09 09:50:11,311 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 09:50:11,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:50:11,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 09:50:11,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-09 09:50:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 09:50:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-12-09 09:50:11,314 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 21 [2018-12-09 09:50:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:11,314 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-12-09 09:50:11,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:50:11,315 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-12-09 09:50:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 09:50:11,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:11,315 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:50:11,316 INFO L423 AbstractCegarLoop]: === Iteration 11 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:11,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:11,316 INFO L82 PathProgramCache]: Analyzing trace with hash 289957834, now seen corresponding path program 1 times [2018-12-09 09:50:11,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:11,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:11,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:11,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:11,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:50:11,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:50:11,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 09:50:11,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 09:50:11,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 09:50:11,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:50:11,372 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 9 states. [2018-12-09 09:50:11,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:11,564 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-12-09 09:50:11,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:50:11,564 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-12-09 09:50:11,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:11,565 INFO L225 Difference]: With dead ends: 102 [2018-12-09 09:50:11,565 INFO L226 Difference]: Without dead ends: 102 [2018-12-09 09:50:11,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:50:11,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-09 09:50:11,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-09 09:50:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-09 09:50:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-12-09 09:50:11,567 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 32 [2018-12-09 09:50:11,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:11,567 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-12-09 09:50:11,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 09:50:11,567 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-12-09 09:50:11,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 09:50:11,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:11,568 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:50:11,568 INFO L423 AbstractCegarLoop]: === Iteration 12 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:11,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash 289957835, now seen corresponding path program 1 times [2018-12-09 09:50:11,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:11,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:11,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:11,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:11,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:50:11,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:50:11,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 09:50:11,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 09:50:11,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 09:50:11,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:50:11,645 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 9 states. [2018-12-09 09:50:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:11,768 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-12-09 09:50:11,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:50:11,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-12-09 09:50:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:11,769 INFO L225 Difference]: With dead ends: 95 [2018-12-09 09:50:11,769 INFO L226 Difference]: Without dead ends: 95 [2018-12-09 09:50:11,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:50:11,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-09 09:50:11,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-09 09:50:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-09 09:50:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-12-09 09:50:11,772 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 32 [2018-12-09 09:50:11,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:11,773 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-12-09 09:50:11,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 09:50:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-12-09 09:50:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 09:50:11,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:11,774 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:50:11,774 INFO L423 AbstractCegarLoop]: === Iteration 13 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:11,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:11,774 INFO L82 PathProgramCache]: Analyzing trace with hash 755090218, now seen corresponding path program 1 times [2018-12-09 09:50:11,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:11,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:11,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:11,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:11,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:50:11,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:50:11,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 09:50:11,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 09:50:11,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 09:50:11,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:50:11,935 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 13 states. [2018-12-09 09:50:12,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:12,141 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-12-09 09:50:12,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 09:50:12,141 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-12-09 09:50:12,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:12,142 INFO L225 Difference]: With dead ends: 90 [2018-12-09 09:50:12,142 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 09:50:12,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-12-09 09:50:12,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 09:50:12,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-09 09:50:12,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-09 09:50:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-12-09 09:50:12,145 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 38 [2018-12-09 09:50:12,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:12,145 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-12-09 09:50:12,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 09:50:12,145 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-12-09 09:50:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 09:50:12,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:12,146 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:50:12,146 INFO L423 AbstractCegarLoop]: === Iteration 14 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:12,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:12,147 INFO L82 PathProgramCache]: Analyzing trace with hash 755089322, now seen corresponding path program 1 times [2018-12-09 09:50:12,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:12,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:12,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:12,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:12,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:12,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:50:12,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:50:12,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:12,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:50:12,451 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:50:12,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:12,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:12,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-09 09:50:12,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:12,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:12,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:12,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-12-09 09:50:12,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:12,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:12,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:21 [2018-12-09 09:50:12,548 INFO L478 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 11 treesize of output 8 [2018-12-09 09:50:12,550 INFO L478 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 8 treesize of output 7 [2018-12-09 09:50:12,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:12,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:12,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:12,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-12-09 09:50:12,591 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-09 09:50:12,593 INFO L478 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 14 treesize of output 13 [2018-12-09 09:50:12,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:12,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:12,604 INFO L267 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. [2018-12-09 09:50:12,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2018-12-09 09:50:12,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 59 [2018-12-09 09:50:12,691 INFO L478 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 48 treesize of output 47 [2018-12-09 09:50:12,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:12,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:12,725 INFO L267 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. [2018-12-09 09:50:12,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2018-12-09 09:50:12,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2018-12-09 09:50:12,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:12,789 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:50:12,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 32 treesize of output 66 [2018-12-09 09:50:12,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:12,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:12,807 INFO L267 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. [2018-12-09 09:50:12,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:86 [2018-12-09 09:50:13,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 75 [2018-12-09 09:50:13,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:13,059 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 33 [2018-12-09 09:50:13,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:13,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:13,079 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-09 09:50:13,080 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:13,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:13,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:13,096 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:93, output treesize:7 [2018-12-09 09:50:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:13,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:50:13,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 34 [2018-12-09 09:50:13,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-09 09:50:13,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-09 09:50:13,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1093, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 09:50:13,142 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 35 states. [2018-12-09 09:50:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:14,669 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-12-09 09:50:14,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 09:50:14,669 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2018-12-09 09:50:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:14,670 INFO L225 Difference]: With dead ends: 88 [2018-12-09 09:50:14,670 INFO L226 Difference]: Without dead ends: 88 [2018-12-09 09:50:14,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=330, Invalid=2120, Unknown=0, NotChecked=0, Total=2450 [2018-12-09 09:50:14,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-09 09:50:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-12-09 09:50:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 09:50:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-12-09 09:50:14,673 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 38 [2018-12-09 09:50:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:14,673 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-12-09 09:50:14,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-09 09:50:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-12-09 09:50:14,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 09:50:14,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:14,674 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:50:14,675 INFO L423 AbstractCegarLoop]: === Iteration 15 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:14,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:14,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1932960382, now seen corresponding path program 1 times [2018-12-09 09:50:14,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:14,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:14,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:14,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:14,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:50:14,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:50:14,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 09:50:14,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 09:50:14,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 09:50:14,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:50:14,837 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 14 states. [2018-12-09 09:50:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:15,095 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-12-09 09:50:15,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 09:50:15,095 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-12-09 09:50:15,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:15,096 INFO L225 Difference]: With dead ends: 85 [2018-12-09 09:50:15,096 INFO L226 Difference]: Without dead ends: 85 [2018-12-09 09:50:15,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-12-09 09:50:15,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-09 09:50:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-09 09:50:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-09 09:50:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-12-09 09:50:15,099 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 39 [2018-12-09 09:50:15,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:15,099 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-12-09 09:50:15,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 09:50:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-12-09 09:50:15,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 09:50:15,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:15,100 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:50:15,101 INFO L423 AbstractCegarLoop]: === Iteration 16 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:15,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:15,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1932932578, now seen corresponding path program 1 times [2018-12-09 09:50:15,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:15,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:15,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:15,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:15,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:15,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:50:15,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:50:15,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:15,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:50:15,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:15,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:15,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:15,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-12-09 09:50:15,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:15,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:15,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2018-12-09 09:50:15,392 INFO L478 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 11 treesize of output 8 [2018-12-09 09:50:15,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-09 09:50:15,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:15,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:15,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:15,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-09 09:50:15,435 INFO L478 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 39 treesize of output 35 [2018-12-09 09:50:15,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-12-09 09:50:15,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:15,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:15,446 INFO L267 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. [2018-12-09 09:50:15,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-12-09 09:50:15,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 61 [2018-12-09 09:50:15,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 51 treesize of output 50 [2018-12-09 09:50:15,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:15,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:15,540 INFO L267 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. [2018-12-09 09:50:15,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2018-12-09 09:50:15,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-12-09 09:50:15,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:15,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 35 treesize of output 46 [2018-12-09 09:50:15,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:15,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:15,590 INFO L267 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. [2018-12-09 09:50:15,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:65 [2018-12-09 09:50:15,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 63 [2018-12-09 09:50:15,791 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2018-12-09 09:50:15,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:15,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 36 [2018-12-09 09:50:15,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:50:15,823 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-12-09 09:50:15,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:15,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:15,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-12-09 09:50:15,839 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:50:15,853 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2018-12-09 09:50:15,853 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:15,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 09:50:15,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 09:50:15,874 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:72, output treesize:27 [2018-12-09 09:50:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:15,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:50:15,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 28 [2018-12-09 09:50:15,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-09 09:50:15,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-09 09:50:15,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2018-12-09 09:50:15,907 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 29 states. [2018-12-09 09:50:16,812 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2018-12-09 09:50:17,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:17,753 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-12-09 09:50:17,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 09:50:17,753 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 39 [2018-12-09 09:50:17,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:17,754 INFO L225 Difference]: With dead ends: 88 [2018-12-09 09:50:17,754 INFO L226 Difference]: Without dead ends: 88 [2018-12-09 09:50:17,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=231, Invalid=1661, Unknown=0, NotChecked=0, Total=1892 [2018-12-09 09:50:17,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-09 09:50:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-12-09 09:50:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-09 09:50:17,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-12-09 09:50:17,756 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 39 [2018-12-09 09:50:17,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:17,757 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-12-09 09:50:17,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-09 09:50:17,757 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-12-09 09:50:17,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 09:50:17,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:17,758 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:50:17,758 INFO L423 AbstractCegarLoop]: === Iteration 17 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:17,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:17,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1293048004, now seen corresponding path program 1 times [2018-12-09 09:50:17,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:17,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:17,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:17,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:17,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:17,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:50:17,975 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:50:17,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:18,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:50:18,023 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:50:18,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-09 09:50:18,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:18,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:18,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:18,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-12-09 09:50:18,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2018-12-09 09:50:18,054 INFO L478 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 11 treesize of output 8 [2018-12-09 09:50:18,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-09 09:50:18,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-12-09 09:50:18,096 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-09 09:50:18,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-09 09:50:18,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,107 INFO L267 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. [2018-12-09 09:50:18,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:38 [2018-12-09 09:50:18,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 61 [2018-12-09 09:50:18,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 51 treesize of output 50 [2018-12-09 09:50:18,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,191 INFO L267 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. [2018-12-09 09:50:18,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-09 09:50:18,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-12-09 09:50:18,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:18,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 35 treesize of output 46 [2018-12-09 09:50:18,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 09:50:18,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:57 [2018-12-09 09:50:18,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 59 [2018-12-09 09:50:18,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:18,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 50 [2018-12-09 09:50:18,491 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-09 09:50:18,524 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2018-12-09 09:50:18,525 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,527 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2018-12-09 09:50:18,528 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,530 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-12-09 09:50:18,530 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,553 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-12-09 09:50:18,554 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 47 [2018-12-09 09:50:18,585 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 09:50:18,614 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-09 09:50:18,614 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,615 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-09 09:50:18,616 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-12-09 09:50:18,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-12-09 09:50:18,658 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:67, output treesize:90 [2018-12-09 09:50:18,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:18,781 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-09 09:50:18,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:18,785 INFO L267 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. [2018-12-09 09:50:18,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-12-09 09:50:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:18,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:50:18,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 32 [2018-12-09 09:50:18,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-09 09:50:18,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-09 09:50:18,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=982, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 09:50:18,832 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 33 states. [2018-12-09 09:50:19,980 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-12-09 09:50:21,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:21,428 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-12-09 09:50:21,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 09:50:21,428 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 41 [2018-12-09 09:50:21,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:21,428 INFO L225 Difference]: With dead ends: 87 [2018-12-09 09:50:21,428 INFO L226 Difference]: Without dead ends: 87 [2018-12-09 09:50:21,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=318, Invalid=2652, Unknown=0, NotChecked=0, Total=2970 [2018-12-09 09:50:21,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-09 09:50:21,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-12-09 09:50:21,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-09 09:50:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-12-09 09:50:21,431 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 41 [2018-12-09 09:50:21,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:21,431 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-12-09 09:50:21,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-09 09:50:21,431 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-12-09 09:50:21,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 09:50:21,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:21,432 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:50:21,432 INFO L423 AbstractCegarLoop]: === Iteration 18 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:21,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:21,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1293057934, now seen corresponding path program 1 times [2018-12-09 09:50:21,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:21,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:21,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:21,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:21,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:21,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:21,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:50:21,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:50:21,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:21,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:50:21,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:21,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:21,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 09:50:21,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:21,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:21,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 09:50:21,732 INFO L478 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 13 treesize of output 10 [2018-12-09 09:50:21,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-09 09:50:21,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:21,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:21,744 INFO L267 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. [2018-12-09 09:50:21,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:28 [2018-12-09 09:50:21,866 INFO L478 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 31 treesize of output 25 [2018-12-09 09:50:21,870 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2018-12-09 09:50:21,871 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 09:50:21,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 09:50:21,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 09:50:21,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-09 09:50:22,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:22,030 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-09 09:50:22,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:22,034 INFO L267 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. [2018-12-09 09:50:22,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-12-09 09:50:22,062 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:22,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:50:22,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2018-12-09 09:50:22,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-09 09:50:22,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-09 09:50:22,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2018-12-09 09:50:22,078 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 32 states. [2018-12-09 09:50:22,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:22,906 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-12-09 09:50:22,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 09:50:22,906 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 41 [2018-12-09 09:50:22,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:22,907 INFO L225 Difference]: With dead ends: 82 [2018-12-09 09:50:22,907 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 09:50:22,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=1528, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 09:50:22,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 09:50:22,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-09 09:50:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-09 09:50:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-12-09 09:50:22,910 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 41 [2018-12-09 09:50:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:22,910 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-12-09 09:50:22,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-09 09:50:22,910 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-12-09 09:50:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 09:50:22,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:22,910 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:50:22,911 INFO L423 AbstractCegarLoop]: === Iteration 19 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:22,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:22,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2098648359, now seen corresponding path program 1 times [2018-12-09 09:50:22,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:22,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:22,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:22,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:22,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:23,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:23,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:50:23,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:50:23,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:23,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:50:23,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:23,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:23,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 09:50:23,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:23,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:23,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 09:50:23,168 INFO L478 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 13 treesize of output 10 [2018-12-09 09:50:23,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-09 09:50:23,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:23,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:23,174 INFO L267 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. [2018-12-09 09:50:23,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2018-12-09 09:50:23,281 INFO L478 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 20 treesize of output 16 [2018-12-09 09:50:23,289 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2018-12-09 09:50:23,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 09:50:23,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:50:23,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:50:23,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:26 [2018-12-09 09:50:23,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:23,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 21 [2018-12-09 09:50:23,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 09:50:23,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:23,410 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-12-09 09:50:23,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:23,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 09:50:23,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:38 [2018-12-09 09:50:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:23,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:50:23,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2018-12-09 09:50:23,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-09 09:50:23,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-09 09:50:23,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=907, Unknown=0, NotChecked=0, Total=992 [2018-12-09 09:50:23,502 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 32 states. [2018-12-09 09:50:24,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:50:24,281 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-12-09 09:50:24,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 09:50:24,281 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 42 [2018-12-09 09:50:24,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:50:24,282 INFO L225 Difference]: With dead ends: 80 [2018-12-09 09:50:24,282 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 09:50:24,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=1527, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 09:50:24,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 09:50:24,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-09 09:50:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-09 09:50:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-12-09 09:50:24,283 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 42 [2018-12-09 09:50:24,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:50:24,284 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-12-09 09:50:24,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-09 09:50:24,284 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-12-09 09:50:24,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 09:50:24,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:50:24,284 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:50:24,285 INFO L423 AbstractCegarLoop]: === Iteration 20 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:50:24,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:50:24,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1367972239, now seen corresponding path program 1 times [2018-12-09 09:50:24,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:50:24,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:50:24,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:24,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:24,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:50:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:24,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:50:24,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:50:24,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:50:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:50:24,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:50:24,546 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:50:24,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:24,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:24,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-09 09:50:24,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:24,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:24,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:24,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-12-09 09:50:24,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:24,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:24,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2018-12-09 09:50:24,578 INFO L478 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 11 treesize of output 8 [2018-12-09 09:50:24,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-09 09:50:24,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:24,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:24,585 INFO L267 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. [2018-12-09 09:50:24,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-12-09 09:50:24,607 INFO L478 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 30 treesize of output 26 [2018-12-09 09:50:24,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-12-09 09:50:24,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:24,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:24,617 INFO L267 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. [2018-12-09 09:50:24,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-12-09 09:50:24,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2018-12-09 09:50:24,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 42 treesize of output 41 [2018-12-09 09:50:24,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:24,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:50:24,712 INFO L267 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. [2018-12-09 09:50:24,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:39 [2018-12-09 09:50:24,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2018-12-09 09:50:24,756 INFO L478 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 2 case distinctions, treesize of input 28 treesize of output 36 [2018-12-09 09:50:24,757 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 09:50:24,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 09:50:24,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-12-09 09:50:24,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:52, output treesize:99 [2018-12-09 09:50:34,844 WARN L180 SmtUtils]: Spent 10.02 s on a formula simplification. DAG size of input: 55 DAG size of output: 29 [2018-12-09 09:50:36,881 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 09:50:38,921 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 09:50:40,961 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 09:50:43,002 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 09:50:45,042 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 09:50:47,081 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-09 09:50:47,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 45 [2018-12-09 09:50:47,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2018-12-09 09:50:47,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 09:50:47,116 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2018-12-09 09:50:47,116 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 09:50:47,134 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-12-09 09:50:47,135 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:47,136 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-12-09 09:50:47,136 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:47,155 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2018-12-09 09:50:47,155 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:47,156 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-12-09 09:50:47,157 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:47,168 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-12-09 09:50:47,168 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:47,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:50:47,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:50:47,179 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:62, output treesize:32 [2018-12-09 09:50:47,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:47,253 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-12-09 09:50:47,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:50:47,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:50:47,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 09:50:47,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 09:50:47,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 09:50:47,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:38 [2018-12-09 09:50:47,355 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:50:47,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:50:47,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-12-09 09:50:47,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-09 09:50:47,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-09 09:50:47,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 09:50:47,370 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 37 states. [2018-12-09 09:50:50,910 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 56 [2018-12-09 09:50:55,059 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 75 [2018-12-09 09:50:57,179 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-09 09:50:59,225 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-09 09:51:01,266 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-09 09:51:05,320 WARN L180 SmtUtils]: Spent 4.01 s on a formula simplification that was a NOOP. DAG size: 52 [2018-12-09 09:51:13,396 WARN L180 SmtUtils]: Spent 8.03 s on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2018-12-09 09:51:21,487 WARN L180 SmtUtils]: Spent 8.04 s on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2018-12-09 09:51:29,580 WARN L180 SmtUtils]: Spent 8.04 s on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2018-12-09 09:51:37,717 WARN L180 SmtUtils]: Spent 8.04 s on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2018-12-09 09:51:37,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:51:37,949 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-12-09 09:51:37,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 09:51:37,949 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 42 [2018-12-09 09:51:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:51:37,950 INFO L225 Difference]: With dead ends: 83 [2018-12-09 09:51:37,950 INFO L226 Difference]: Without dead ends: 83 [2018-12-09 09:51:37,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 71.8s TimeCoverageRelationStatistics Valid=375, Invalid=3165, Unknown=0, NotChecked=0, Total=3540 [2018-12-09 09:51:37,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-09 09:51:37,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-12-09 09:51:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-09 09:51:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-12-09 09:51:37,952 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 42 [2018-12-09 09:51:37,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:51:37,952 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-12-09 09:51:37,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-09 09:51:37,953 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-12-09 09:51:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 09:51:37,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:51:37,953 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:51:37,953 INFO L423 AbstractCegarLoop]: === Iteration 21 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:51:37,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:51:37,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1367982169, now seen corresponding path program 1 times [2018-12-09 09:51:37,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:51:37,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:51:37,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:51:37,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:37,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:51:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:38,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:51:38,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:51:38,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:38,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:51:38,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:38,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:38,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 09:51:38,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-12-09 09:51:38,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:38,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:38,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:38,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 09:51:38,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-12-09 09:51:38,371 INFO L478 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 11 treesize of output 8 [2018-12-09 09:51:38,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-09 09:51:38,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-12-09 09:51:38,398 INFO L478 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 38 treesize of output 34 [2018-12-09 09:51:38,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-12-09 09:51:38,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,407 INFO L267 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. [2018-12-09 09:51:38,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-12-09 09:51:38,462 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-12-09 09:51:38,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-09 09:51:38,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,473 INFO L267 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. [2018-12-09 09:51:38,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-12-09 09:51:38,510 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2018-12-09 09:51:38,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:38,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-12-09 09:51:38,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,526 INFO L267 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. [2018-12-09 09:51:38,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:70 [2018-12-09 09:51:38,867 INFO L478 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 86 treesize of output 58 [2018-12-09 09:51:38,869 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 09:51:38,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,877 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 09:51:38,877 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 24 [2018-12-09 09:51:38,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:86, output treesize:10 [2018-12-09 09:51:38,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:38,908 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-09 09:51:38,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:38,912 INFO L267 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. [2018-12-09 09:51:38,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-12-09 09:51:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:38,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:51:38,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 41 [2018-12-09 09:51:38,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-09 09:51:38,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-09 09:51:38,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1599, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 09:51:38,958 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 42 states. [2018-12-09 09:51:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:51:40,812 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-12-09 09:51:40,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 09:51:40,812 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-09 09:51:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:51:40,813 INFO L225 Difference]: With dead ends: 80 [2018-12-09 09:51:40,813 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 09:51:40,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=394, Invalid=3512, Unknown=0, NotChecked=0, Total=3906 [2018-12-09 09:51:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 09:51:40,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-12-09 09:51:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 09:51:40,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-12-09 09:51:40,814 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 42 [2018-12-09 09:51:40,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:51:40,815 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-12-09 09:51:40,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-09 09:51:40,815 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-12-09 09:51:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 09:51:40,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:51:40,815 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:51:40,815 INFO L423 AbstractCegarLoop]: === Iteration 22 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:51:40,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:51:40,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1383128080, now seen corresponding path program 1 times [2018-12-09 09:51:40,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:51:40,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:51:40,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:51:40,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:40,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:51:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:41,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:51:41,203 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:51:41,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:41,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:51:41,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:41,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:41,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 09:51:41,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:41,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:41,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 09:51:41,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:41,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:41,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:41,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 09:51:41,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:41,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:41,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-12-09 09:51:41,358 INFO L478 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 11 treesize of output 8 [2018-12-09 09:51:41,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-09 09:51:41,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:41,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:41,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:41,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-12-09 09:51:41,390 INFO L478 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 47 treesize of output 43 [2018-12-09 09:51:41,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-12-09 09:51:41,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:41,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:41,403 INFO L267 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. [2018-12-09 09:51:41,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:49 [2018-12-09 09:51:41,470 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 54 [2018-12-09 09:51:41,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-09 09:51:41,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:41,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:41,485 INFO L267 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. [2018-12-09 09:51:41,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:56 [2018-12-09 09:51:41,526 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2018-12-09 09:51:41,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:41,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 54 [2018-12-09 09:51:41,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:41,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:41,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 09:51:41,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:69, output treesize:74 [2018-12-09 09:51:41,887 INFO L478 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 68 [2018-12-09 09:51:41,888 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 09:51:41,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:41,897 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 09:51:41,897 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:41,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:41,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:41,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 66 [2018-12-09 09:51:41,918 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-09 09:51:41,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-09 09:51:42,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-09 09:51:42,005 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:211 [2018-12-09 09:51:42,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:42,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-09 09:51:42,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:42,511 INFO L267 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. [2018-12-09 09:51:42,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-12-09 09:51:42,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:42,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:42,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 36 [2018-12-09 09:51:42,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:42,643 INFO L267 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. [2018-12-09 09:51:42,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2018-12-09 09:51:42,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:42,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:51:42,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-12-09 09:51:42,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-09 09:51:42,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-09 09:51:42,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2018-12-09 09:51:42,805 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 50 states. [2018-12-09 09:51:43,658 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2018-12-09 09:51:44,179 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-12-09 09:51:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:51:46,009 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-12-09 09:51:46,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 09:51:46,009 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 43 [2018-12-09 09:51:46,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:51:46,010 INFO L225 Difference]: With dead ends: 80 [2018-12-09 09:51:46,010 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 09:51:46,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=460, Invalid=4941, Unknown=1, NotChecked=0, Total=5402 [2018-12-09 09:51:46,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 09:51:46,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-12-09 09:51:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 09:51:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-12-09 09:51:46,013 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 43 [2018-12-09 09:51:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:51:46,013 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-12-09 09:51:46,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-09 09:51:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-12-09 09:51:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 09:51:46,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:51:46,013 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:51:46,014 INFO L423 AbstractCegarLoop]: === Iteration 23 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:51:46,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:51:46,014 INFO L82 PathProgramCache]: Analyzing trace with hash 370874875, now seen corresponding path program 1 times [2018-12-09 09:51:46,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:51:46,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:51:46,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:51:46,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:46,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:51:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:46,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:51:46,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:51:46,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:46,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:51:46,402 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:51:46,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:46,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:46,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-09 09:51:46,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:46,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:46,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:46,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-12-09 09:51:46,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:46,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:46,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2018-12-09 09:51:46,456 INFO L478 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 11 treesize of output 8 [2018-12-09 09:51:46,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-09 09:51:46,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:46,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:46,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:46,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-12-09 09:51:46,492 INFO L478 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 30 treesize of output 26 [2018-12-09 09:51:46,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-12-09 09:51:46,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:46,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:46,503 INFO L267 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. [2018-12-09 09:51:46,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-12-09 09:51:46,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2018-12-09 09:51:46,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 35 treesize of output 36 [2018-12-09 09:51:46,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:46,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 30 treesize of output 29 [2018-12-09 09:51:46,586 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:46,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:46,597 INFO L267 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. [2018-12-09 09:51:46,598 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2018-12-09 09:51:46,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2018-12-09 09:51:46,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:46,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 37 [2018-12-09 09:51:46,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:46,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:46,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 09:51:46,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:51 [2018-12-09 09:51:46,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 59 [2018-12-09 09:51:46,992 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-12-09 09:51:46,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:47,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:47,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:47,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 68 [2018-12-09 09:51:47,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 6 xjuncts. [2018-12-09 09:51:47,066 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2018-12-09 09:51:47,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:47,083 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-12-09 09:51:47,084 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:47,085 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-12-09 09:51:47,085 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:47,086 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-12-09 09:51:47,086 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:47,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:47,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:47,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:47,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 57 [2018-12-09 09:51:47,115 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-12-09 09:51:47,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 09:51:47,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 09:51:47,153 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:75, output treesize:73 [2018-12-09 09:51:47,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:47,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 21 [2018-12-09 09:51:47,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 09:51:47,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:47,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 09:51:47,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 09:51:47,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:47,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 28 [2018-12-09 09:51:47,322 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:47,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:47,352 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-12-09 09:51:47,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:47,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-09 09:51:47,377 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:76, output treesize:85 [2018-12-09 09:51:47,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:47,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:47,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-12-09 09:51:47,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 09:51:47,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:47,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:47,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-12-09 09:51:47,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:47,523 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-12-09 09:51:47,523 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:47,548 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-12-09 09:51:47,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:47,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2018-12-09 09:51:47,571 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:78, output treesize:88 [2018-12-09 09:51:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:47,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:51:47,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-12-09 09:51:47,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-09 09:51:47,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-09 09:51:47,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1770, Unknown=0, NotChecked=0, Total=1892 [2018-12-09 09:51:47,808 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 44 states. [2018-12-09 09:51:50,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:51:50,440 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-12-09 09:51:50,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 09:51:50,441 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-09 09:51:50,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:51:50,441 INFO L225 Difference]: With dead ends: 77 [2018-12-09 09:51:50,441 INFO L226 Difference]: Without dead ends: 77 [2018-12-09 09:51:50,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=473, Invalid=4219, Unknown=0, NotChecked=0, Total=4692 [2018-12-09 09:51:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-09 09:51:50,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-12-09 09:51:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 09:51:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-12-09 09:51:50,443 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 44 [2018-12-09 09:51:50,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:51:50,443 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-12-09 09:51:50,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-09 09:51:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-12-09 09:51:50,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 09:51:50,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:51:50,443 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:51:50,444 INFO L423 AbstractCegarLoop]: === Iteration 24 === [_destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2018-12-09 09:51:50,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:51:50,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1114704330, now seen corresponding path program 1 times [2018-12-09 09:51:50,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:51:50,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:51:50,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:51:50,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:50,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:51:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:51:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:51:50,474 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 09:51:50,484 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 09:51:50,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:51:50 BoogieIcfgContainer [2018-12-09 09:51:50,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:51:50,495 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:51:50,495 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:51:50,496 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:51:50,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:50:10" (3/4) ... [2018-12-09 09:51:50,499 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 09:51:50,499 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:51:50,499 INFO L168 Benchmark]: Toolchain (without parser) took 101132.03 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.8 MB). Free memory was 951.7 MB in the beginning and 1.3 GB in the end (delta: -304.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-12-09 09:51:50,499 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:51:50,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-09 09:51:50,500 INFO L168 Benchmark]: Boogie Preprocessor took 32.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:51:50,500 INFO L168 Benchmark]: RCFGBuilder took 362.60 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:51:50,500 INFO L168 Benchmark]: TraceAbstraction took 100458.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 189.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -204.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:51:50,500 INFO L168 Benchmark]: Witness Printer took 3.31 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:51:50,501 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 362.60 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 100458.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 189.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -204.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.31 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 616]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 616. Possible FailurePath: [L617] const int len = 3; VAL [len=3] [L618] CALL, EXPR dll_circular_create(len) VAL [\old(len)=3] [L564] DLL last = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=3, last={10:0}, len=3, malloc(sizeof(struct node))={10:0}] [L565] COND FALSE !(((void *)0) == last) VAL [\old(len)=3, last={10:0}, len=3, malloc(sizeof(struct node))={10:0}] [L568] last->next = last VAL [\old(len)=3, last={10:0}, len=3, malloc(sizeof(struct node))={10:0}] [L569] last->prev = last VAL [\old(len)=3, last={10:0}, len=3, malloc(sizeof(struct node))={10:0}] [L570] DLL head = last; VAL [\old(len)=3, head={10:0}, last={10:0}, len=3, malloc(sizeof(struct node))={10:0}] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={10:0}, last={10:0}, len=3, malloc(sizeof(struct node))={13:0}, malloc(sizeof(struct node))={10:0}, new_head={13:0}] [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={10:0}, last={10:0}, len=3, malloc(sizeof(struct node))={13:0}, malloc(sizeof(struct node))={10:0}, new_head={13:0}] [L576] new_head->next = head VAL [\old(len)=3, head={10:0}, last={10:0}, len=3, malloc(sizeof(struct node))={13:0}, malloc(sizeof(struct node))={10:0}, new_head={13:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={10:0}, last={10:0}, len=3, malloc(sizeof(struct node))={13:0}, malloc(sizeof(struct node))={10:0}, new_head={13:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={13:0}, last={10:0}, len=2, malloc(sizeof(struct node))={13:0}, malloc(sizeof(struct node))={10:0}, new_head={13:0}] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={13:0}, last={10:0}, len=2, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, new_head={11:0}] [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={13:0}, last={10:0}, len=2, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, new_head={11:0}] [L576] new_head->next = head VAL [\old(len)=3, head={13:0}, last={10:0}, len=2, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, new_head={11:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={13:0}, last={10:0}, len=2, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, new_head={11:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={11:0}, last={10:0}, len=1, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, new_head={11:0}] [L571] COND FALSE !(len > 1) VAL [\old(len)=3, head={11:0}, last={10:0}, len=1, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, new_head={11:0}] [L581] last->next = head VAL [\old(len)=3, head={11:0}, last={10:0}, len=1, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, new_head={11:0}] [L582] head->prev = last VAL [\old(len)=3, head={11:0}, last={10:0}, len=1, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, new_head={11:0}] [L583] return head; VAL [\old(len)=3, \result={11:0}, head={11:0}, last={10:0}, len=1, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, new_head={11:0}] [L618] RET, EXPR dll_circular_create(len) VAL [dll_circular_create(len)={11:0}, len=3] [L618] DLL head = dll_circular_create(len); [L619] CALL _destroy_in_nondeterministic_order(head) VAL [head={11:0}] [L586] EXPR head->prev VAL [head={11:0}, head={11:0}, head->prev={10:0}] [L586] DLL pred = head->prev; [L587] EXPR head->next VAL [head={11:0}, head={11:0}, head->next={13:0}, pred={10:0}] [L587] DLL succ = head->next; [L588] COND FALSE !(__VERIFIER_nondet_int()) [L597] COND FALSE !(__VERIFIER_nondet_int()) [L607] free(pred) VAL [head={11:0}, head={11:0}, pred={10:0}, succ={13:0}] [L607] free(pred) [L608] COND FALSE !(__VERIFIER_nondet_int()) [L612] free(head) VAL [head={11:0}, head={11:0}, pred={10:0}, succ={13:0}] [L612] free(head) [L619] RET _destroy_in_nondeterministic_order(head) VAL [head={11:0}, len=3] [L620] head = ((void *)0) [L621] return 0; VAL [\result=0, head={0:0}, len=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 126 locations, 45 error locations. UNSAFE Result, 100.4s OverallTime, 24 OverallIterations, 2 TraceHistogramMax, 67.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1713 SDtfs, 2292 SDslu, 10524 SDs, 0 SdLazy, 11781 SolverSat, 784 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 876 GetRequests, 277 SyntacticMatches, 31 SemanticMatches, 568 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5877 ImplicationChecksByTransitivity, 87.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 37 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 32.2s InterpolantComputationTime, 1129 NumberOfCodeBlocks, 1129 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1049 ConstructedInterpolants, 142 QuantifiedInterpolants, 537150 SizeOfPredicates, 157 NumberOfNonLiveVariables, 2116 ConjunctsInSsa, 449 ConjunctsInUnsatCore, 34 InterpolantComputations, 12 PerfectInterpolantSequences, 38/165 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 09:51:51,732 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:51:51,733 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:51:51,739 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:51:51,739 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:51:51,739 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:51:51,740 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:51:51,741 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:51:51,742 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:51:51,743 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:51:51,743 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:51:51,744 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:51:51,744 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:51:51,745 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:51:51,746 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:51:51,746 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:51:51,747 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:51:51,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:51:51,749 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:51:51,750 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:51:51,751 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:51:51,752 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:51:51,753 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:51:51,753 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:51:51,754 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:51:51,754 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:51:51,755 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:51:51,755 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:51:51,756 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:51:51,757 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:51:51,757 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:51:51,757 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:51:51,757 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:51:51,758 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:51:51,758 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:51:51,758 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:51:51,759 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-12-09 09:51:51,769 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:51:51,769 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:51:51,770 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:51:51,770 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:51:51,770 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 09:51:51,770 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 09:51:51,770 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 09:51:51,771 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:51:51,771 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:51:51,771 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 09:51:51,771 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:51:51,771 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:51:51,771 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:51:51,771 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 09:51:51,771 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 09:51:51,771 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 09:51:51,771 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:51:51,772 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 09:51:51,772 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 09:51:51,772 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:51:51,772 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 09:51:51,772 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:51:51,772 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:51:51,772 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:51:51,772 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:51:51,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:51:51,773 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:51:51,773 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:51:51,773 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-09 09:51:51,773 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:51:51,773 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 09:51:51,773 INFO L133 SettingsManager]: * Logic for external solver=AUFBV 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/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 760c75961baa7cc196b373809e9a87dd0bcf8eb7 [2018-12-09 09:51:51,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:51:51,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:51:51,805 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:51:51,806 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:51:51,806 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:51:51,806 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order_false-valid-memtrack.i [2018-12-09 09:51:51,844 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/data/c15034d40/867063124a1e45a7abafe85d3287e267/FLAGa6249efd2 [2018-12-09 09:51:52,184 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:51:52,185 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order_false-valid-memtrack.i [2018-12-09 09:51:52,191 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/data/c15034d40/867063124a1e45a7abafe85d3287e267/FLAGa6249efd2 [2018-12-09 09:51:52,199 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/data/c15034d40/867063124a1e45a7abafe85d3287e267 [2018-12-09 09:51:52,201 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:51:52,202 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 09:51:52,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:51:52,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:51:52,205 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:51:52,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:51:52" (1/1) ... [2018-12-09 09:51:52,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15605f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:51:52, skipping insertion in model container [2018-12-09 09:51:52,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:51:52" (1/1) ... [2018-12-09 09:51:52,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:51:52,236 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:51:52,423 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:51:52,429 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:51:52,455 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:51:52,512 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:51:52,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:51:52 WrapperNode [2018-12-09 09:51:52,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:51:52,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:51:52,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:51:52,513 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:51:52,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:51:52" (1/1) ... [2018-12-09 09:51:52,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:51:52" (1/1) ... [2018-12-09 09:51:52,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:51:52" (1/1) ... [2018-12-09 09:51:52,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:51:52" (1/1) ... [2018-12-09 09:51:52,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:51:52" (1/1) ... [2018-12-09 09:51:52,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:51:52" (1/1) ... [2018-12-09 09:51:52,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:51:52" (1/1) ... [2018-12-09 09:51:52,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:51:52,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:51:52,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:51:52,548 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:51:52,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:51:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/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 [2018-12-09 09:51:52,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:51:52,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:51:52,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-09 09:51:52,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-09 09:51:52,579 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 09:51:52,579 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-12-09 09:51:52,579 INFO L138 BoogieDeclarations]: Found implementation of procedure _destroy_in_nondeterministic_order [2018-12-09 09:51:52,579 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:51:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-09 09:51:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-09 09:51:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-09 09:51:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 09:51:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 09:51:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 09:51:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 09:51:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 09:51:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 09:51:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 09:51:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 09:51:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 09:51:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 09:51:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 09:51:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 09:51:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 09:51:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 09:51:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 09:51:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 09:51:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 09:51:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 09:51:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 09:51:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 09:51:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 09:51:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 09:51:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 09:51:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 09:51:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 09:51:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 09:51:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 09:51:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 09:51:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 09:51:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 09:51:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 09:51:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 09:51:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 09:51:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 09:51:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 09:51:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 09:51:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 09:51:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 09:51:52,584 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 09:51:52,584 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 09:51:52,584 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 09:51:52,584 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 09:51:52,584 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 09:51:52,584 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 09:51:52,584 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 09:51:52,584 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 09:51:52,584 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 09:51:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 09:51:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 09:51:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 09:51:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 09:51:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 09:51:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 09:51:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 09:51:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 09:51:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 09:51:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 09:51:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 09:51:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-09 09:51:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 09:51:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 09:51:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-09 09:51:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 09:51:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 09:51:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-09 09:51:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 09:51:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 09:51:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 09:51:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 09:51:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 09:51:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 09:51:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 09:51:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 09:51:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 09:51:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 09:51:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 09:51:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 09:51:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 09:51:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 09:51:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 09:51:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 09:51:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 09:51:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 09:51:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 09:51:52,589 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 09:51:52,589 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 09:51:52,589 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 09:51:52,589 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 09:51:52,589 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 09:51:52,589 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 09:51:52,589 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 09:51:52,589 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 09:51:52,589 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 09:51:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 09:51:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 09:51:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 09:51:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 09:51:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 09:51:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 09:51:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 09:51:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 09:51:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 09:51:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 09:51:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 09:51:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-12-09 09:51:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 09:51:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 09:51:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure _destroy_in_nondeterministic_order [2018-12-09 09:51:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 09:51:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 09:51:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:51:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:51:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:51:52,916 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:51:52,916 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 09:51:52,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:51:52 BoogieIcfgContainer [2018-12-09 09:51:52,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:51:52,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:51:52,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:51:52,920 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:51:52,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:51:52" (1/3) ... [2018-12-09 09:51:52,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2284b1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:51:52, skipping insertion in model container [2018-12-09 09:51:52,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:51:52" (2/3) ... [2018-12-09 09:51:52,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2284b1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:51:52, skipping insertion in model container [2018-12-09 09:51:52,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:51:52" (3/3) ... [2018-12-09 09:51:52,923 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order_false-valid-memtrack.i [2018-12-09 09:51:52,930 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:51:52,936 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-12-09 09:51:52,948 INFO L257 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2018-12-09 09:51:52,962 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 09:51:52,962 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:51:52,962 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 09:51:52,962 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:51:52,962 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:51:52,962 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:51:52,962 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:51:52,962 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:51:52,963 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:51:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2018-12-09 09:51:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 09:51:52,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:51:52,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:51:52,980 INFO L423 AbstractCegarLoop]: === Iteration 1 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:51:52,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:51:52,983 INFO L82 PathProgramCache]: Analyzing trace with hash -850117372, now seen corresponding path program 1 times [2018-12-09 09:51:52,985 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:51:52,986 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:51:53,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:53,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:51:53,141 INFO L478 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 [2018-12-09 09:51:53,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:53,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:53,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 09:51:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:53,159 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:51:53,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:51:53,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:51:53,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:51:53,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:51:53,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:51:53,173 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 3 states. [2018-12-09 09:51:53,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:51:53,298 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2018-12-09 09:51:53,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:51:53,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 09:51:53,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:51:53,306 INFO L225 Difference]: With dead ends: 115 [2018-12-09 09:51:53,306 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 09:51:53,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:51:53,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 09:51:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-09 09:51:53,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-09 09:51:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-12-09 09:51:53,334 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 10 [2018-12-09 09:51:53,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:51:53,334 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-12-09 09:51:53,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:51:53,334 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-12-09 09:51:53,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 09:51:53,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:51:53,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:51:53,335 INFO L423 AbstractCegarLoop]: === Iteration 2 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:51:53,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:51:53,336 INFO L82 PathProgramCache]: Analyzing trace with hash -850117371, now seen corresponding path program 1 times [2018-12-09 09:51:53,336 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:51:53,336 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:51:53,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:53,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:51:53,390 INFO L478 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 [2018-12-09 09:51:53,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:53,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:53,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 09:51:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:53,410 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:51:53,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:51:53,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:51:53,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:51:53,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:51:53,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:51:53,413 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 3 states. [2018-12-09 09:51:53,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:51:53,494 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-09 09:51:53,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:51:53,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 09:51:53,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:51:53,496 INFO L225 Difference]: With dead ends: 105 [2018-12-09 09:51:53,496 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 09:51:53,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:51:53,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 09:51:53,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-09 09:51:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 09:51:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-12-09 09:51:53,505 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 10 [2018-12-09 09:51:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:51:53,505 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-12-09 09:51:53,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:51:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-12-09 09:51:53,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 09:51:53,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:51:53,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:51:53,507 INFO L423 AbstractCegarLoop]: === Iteration 3 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:51:53,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:51:53,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1981617807, now seen corresponding path program 1 times [2018-12-09 09:51:53,508 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:51:53,508 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:51:53,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:53,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:51:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:53,564 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:51:53,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:51:53,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:51:53,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:51:53,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:51:53,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:51:53,566 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 5 states. [2018-12-09 09:51:53,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:51:53,595 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-12-09 09:51:53,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:51:53,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-12-09 09:51:53,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:51:53,597 INFO L225 Difference]: With dead ends: 114 [2018-12-09 09:51:53,597 INFO L226 Difference]: Without dead ends: 114 [2018-12-09 09:51:53,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:51:53,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-09 09:51:53,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2018-12-09 09:51:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-09 09:51:53,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-12-09 09:51:53,602 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 15 [2018-12-09 09:51:53,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:51:53,602 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-12-09 09:51:53,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:51:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-12-09 09:51:53,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 09:51:53,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:51:53,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:51:53,603 INFO L423 AbstractCegarLoop]: === Iteration 4 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:51:53,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:51:53,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1981616270, now seen corresponding path program 1 times [2018-12-09 09:51:53,603 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:51:53,603 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:51:53,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:53,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:51:53,660 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:51:53,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:53,664 INFO L267 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. [2018-12-09 09:51:53,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-09 09:51:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:53,672 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:51:53,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:51:53,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:51:53,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:51:53,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:51:53,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:51:53,674 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 4 states. [2018-12-09 09:51:53,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:51:53,770 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-09 09:51:53,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:51:53,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-09 09:51:53,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:51:53,771 INFO L225 Difference]: With dead ends: 105 [2018-12-09 09:51:53,771 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 09:51:53,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:51:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 09:51:53,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-09 09:51:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 09:51:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-12-09 09:51:53,775 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 15 [2018-12-09 09:51:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:51:53,775 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-12-09 09:51:53,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:51:53,776 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-12-09 09:51:53,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 09:51:53,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:51:53,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:51:53,776 INFO L423 AbstractCegarLoop]: === Iteration 5 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:51:53,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:51:53,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1981616269, now seen corresponding path program 1 times [2018-12-09 09:51:53,777 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:51:53,777 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:51:53,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:53,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:51:53,827 INFO L478 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 [2018-12-09 09:51:53,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:53,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:53,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 09:51:53,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:53,837 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:51:53,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:51:53,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:51:53,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:51:53,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:51:53,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:51:53,839 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 3 states. [2018-12-09 09:51:53,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:51:53,881 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-12-09 09:51:53,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:51:53,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-09 09:51:53,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:51:53,882 INFO L225 Difference]: With dead ends: 104 [2018-12-09 09:51:53,882 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 09:51:53,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:51:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 09:51:53,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-09 09:51:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-09 09:51:53,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2018-12-09 09:51:53,886 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 15 [2018-12-09 09:51:53,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:51:53,886 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2018-12-09 09:51:53,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:51:53,886 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2018-12-09 09:51:53,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 09:51:53,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:51:53,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:51:53,887 INFO L423 AbstractCegarLoop]: === Iteration 6 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:51:53,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:51:53,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1300562128, now seen corresponding path program 1 times [2018-12-09 09:51:53,887 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:51:53,887 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:51:53,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:53,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:51:53,946 INFO L478 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 [2018-12-09 09:51:53,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:53,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:53,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 09:51:53,958 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 09:51:53,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:53,968 INFO L267 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. [2018-12-09 09:51:53,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-09 09:51:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:53,974 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:51:53,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:51:53,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:51:53,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:51:53,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:51:53,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:51:53,976 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 4 states. [2018-12-09 09:51:54,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:51:54,102 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-12-09 09:51:54,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:51:54,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-09 09:51:54,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:51:54,103 INFO L225 Difference]: With dead ends: 108 [2018-12-09 09:51:54,103 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 09:51:54,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:51:54,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 09:51:54,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-12-09 09:51:54,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 09:51:54,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-12-09 09:51:54,107 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 16 [2018-12-09 09:51:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:51:54,107 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-12-09 09:51:54,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:51:54,107 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-12-09 09:51:54,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 09:51:54,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:51:54,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:51:54,108 INFO L423 AbstractCegarLoop]: === Iteration 7 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:51:54,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:51:54,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1300562127, now seen corresponding path program 1 times [2018-12-09 09:51:54,108 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:51:54,108 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:51:54,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:54,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:51:54,173 INFO L478 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 [2018-12-09 09:51:54,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:54,184 INFO L478 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 [2018-12-09 09:51:54,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:54,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:54,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 09:51:54,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:54,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 17 [2018-12-09 09:51:54,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:54,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:54,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:54,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 09:51:54,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:54,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:51:54,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-12-09 09:51:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:54,253 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:51:54,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:51:54,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:51:54,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:51:54,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:51:54,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:51:54,255 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 5 states. [2018-12-09 09:51:54,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:51:54,467 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-12-09 09:51:54,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:51:54,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-09 09:51:54,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:51:54,467 INFO L225 Difference]: With dead ends: 108 [2018-12-09 09:51:54,468 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 09:51:54,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:51:54,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 09:51:54,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-12-09 09:51:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 09:51:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-12-09 09:51:54,471 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 16 [2018-12-09 09:51:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:51:54,472 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-12-09 09:51:54,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:51:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-12-09 09:51:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 09:51:54,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:51:54,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:51:54,473 INFO L423 AbstractCegarLoop]: === Iteration 8 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:51:54,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:51:54,473 INFO L82 PathProgramCache]: Analyzing trace with hash -239657757, now seen corresponding path program 1 times [2018-12-09 09:51:54,474 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:51:54,474 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:51:54,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:54,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:51:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:54,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:51:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:54,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:51:54,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-12-09 09:51:54,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 09:51:54,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 09:51:54,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:51:54,609 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 10 states. [2018-12-09 09:51:54,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:51:54,670 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-12-09 09:51:54,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:51:54,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-12-09 09:51:54,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:51:54,672 INFO L225 Difference]: With dead ends: 115 [2018-12-09 09:51:54,672 INFO L226 Difference]: Without dead ends: 115 [2018-12-09 09:51:54,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:51:54,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-09 09:51:54,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2018-12-09 09:51:54,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 09:51:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-12-09 09:51:54,676 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 20 [2018-12-09 09:51:54,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:51:54,677 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-12-09 09:51:54,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 09:51:54,677 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-12-09 09:51:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 09:51:54,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:51:54,677 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:51:54,678 INFO L423 AbstractCegarLoop]: === Iteration 9 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:51:54,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:51:54,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1160591870, now seen corresponding path program 1 times [2018-12-09 09:51:54,679 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:51:54,679 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:51:54,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:54,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:51:54,759 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:51:54,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:54,763 INFO L267 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. [2018-12-09 09:51:54,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-09 09:51:54,778 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 09:51:54,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:54,783 INFO L267 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. [2018-12-09 09:51:54,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-09 09:51:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:54,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:51:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:54,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:51:54,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-12-09 09:51:54,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:51:54,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:51:54,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:51:54,804 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 5 states. [2018-12-09 09:51:54,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:51:54,962 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-12-09 09:51:54,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:51:54,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-09 09:51:54,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:51:54,963 INFO L225 Difference]: With dead ends: 107 [2018-12-09 09:51:54,963 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 09:51:54,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:51:54,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 09:51:54,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-09 09:51:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 09:51:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-12-09 09:51:54,966 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 21 [2018-12-09 09:51:54,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:51:54,966 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-12-09 09:51:54,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:51:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-12-09 09:51:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 09:51:54,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:51:54,966 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:51:54,967 INFO L423 AbstractCegarLoop]: === Iteration 10 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:51:54,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:51:54,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1160591871, now seen corresponding path program 1 times [2018-12-09 09:51:54,967 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:51:54,967 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:51:54,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:55,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:51:55,055 INFO L478 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 [2018-12-09 09:51:55,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:55,062 INFO L478 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 [2018-12-09 09:51:55,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:55,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:55,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 09:51:55,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:55,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 17 [2018-12-09 09:51:55,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:55,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:55,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:55,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 09:51:55,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:55,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:51:55,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-12-09 09:51:55,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:55,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:51:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:55,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:51:55,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-12-09 09:51:55,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:51:55,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:51:55,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:51:55,324 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 8 states. [2018-12-09 09:51:55,528 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2018-12-09 09:51:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:51:55,856 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-09 09:51:55,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:51:55,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-12-09 09:51:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:51:55,857 INFO L225 Difference]: With dead ends: 105 [2018-12-09 09:51:55,857 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 09:51:55,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:51:55,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 09:51:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-09 09:51:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 09:51:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-12-09 09:51:55,859 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 21 [2018-12-09 09:51:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:51:55,860 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-12-09 09:51:55,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:51:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-12-09 09:51:55,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 09:51:55,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:51:55,860 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:51:55,861 INFO L423 AbstractCegarLoop]: === Iteration 11 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:51:55,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:51:55,861 INFO L82 PathProgramCache]: Analyzing trace with hash 289957834, now seen corresponding path program 1 times [2018-12-09 09:51:55,861 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:51:55,861 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:51:55,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:55,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:51:55,951 INFO L478 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 [2018-12-09 09:51:55,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:55,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:55,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 09:51:55,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:51:55,995 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:51:55,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:51:55,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 09:51:55,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 09:51:55,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 09:51:55,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:51:55,998 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 9 states. [2018-12-09 09:51:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:51:56,367 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-12-09 09:51:56,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:51:56,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-12-09 09:51:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:51:56,368 INFO L225 Difference]: With dead ends: 102 [2018-12-09 09:51:56,368 INFO L226 Difference]: Without dead ends: 102 [2018-12-09 09:51:56,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:51:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-09 09:51:56,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-09 09:51:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-09 09:51:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-12-09 09:51:56,370 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 32 [2018-12-09 09:51:56,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:51:56,371 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-12-09 09:51:56,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 09:51:56,371 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-12-09 09:51:56,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 09:51:56,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:51:56,371 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:51:56,372 INFO L423 AbstractCegarLoop]: === Iteration 12 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:51:56,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:51:56,372 INFO L82 PathProgramCache]: Analyzing trace with hash 289957835, now seen corresponding path program 1 times [2018-12-09 09:51:56,372 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:51:56,372 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:51:56,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:56,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:51:56,470 INFO L478 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 [2018-12-09 09:51:56,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:56,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:56,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 09:51:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:51:56,539 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:51:56,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:51:56,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 09:51:56,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 09:51:56,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 09:51:56,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:51:56,542 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 9 states. [2018-12-09 09:51:57,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:51:57,028 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-12-09 09:51:57,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:51:57,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-12-09 09:51:57,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:51:57,029 INFO L225 Difference]: With dead ends: 95 [2018-12-09 09:51:57,029 INFO L226 Difference]: Without dead ends: 95 [2018-12-09 09:51:57,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:51:57,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-09 09:51:57,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-09 09:51:57,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-09 09:51:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-12-09 09:51:57,032 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 32 [2018-12-09 09:51:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:51:57,032 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-12-09 09:51:57,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 09:51:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-12-09 09:51:57,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 09:51:57,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:51:57,033 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:51:57,034 INFO L423 AbstractCegarLoop]: === Iteration 13 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:51:57,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:51:57,034 INFO L82 PathProgramCache]: Analyzing trace with hash 755090218, now seen corresponding path program 1 times [2018-12-09 09:51:57,034 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:51:57,034 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:51:57,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:57,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:51:57,157 INFO L478 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 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:51:57,159 INFO L478 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 10 treesize of output 9 [2018-12-09 09:51:57,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:57,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:57,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:57,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-09 09:51:57,243 INFO L478 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 11 [2018-12-09 09:51:57,244 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 09:51:57,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:57,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:57,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:57,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 09:51:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:51:57,269 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:51:57,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:51:57,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 09:51:57,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 09:51:57,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 09:51:57,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:51:57,272 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 13 states. [2018-12-09 09:51:57,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:51:57,760 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-12-09 09:51:57,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 09:51:57,761 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-12-09 09:51:57,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:51:57,761 INFO L225 Difference]: With dead ends: 90 [2018-12-09 09:51:57,761 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 09:51:57,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-12-09 09:51:57,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 09:51:57,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-09 09:51:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-09 09:51:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-12-09 09:51:57,763 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 38 [2018-12-09 09:51:57,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:51:57,763 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-12-09 09:51:57,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 09:51:57,763 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-12-09 09:51:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 09:51:57,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:51:57,764 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:51:57,764 INFO L423 AbstractCegarLoop]: === Iteration 14 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:51:57,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:51:57,764 INFO L82 PathProgramCache]: Analyzing trace with hash 755089322, now seen corresponding path program 1 times [2018-12-09 09:51:57,764 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:51:57,764 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:51:57,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:51:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:51:57,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:51:57,913 INFO L478 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 [2018-12-09 09:51:57,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:57,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:57,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-09 09:51:57,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:57,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:57,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:57,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-09 09:51:57,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:57,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:57,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:15 [2018-12-09 09:51:57,993 INFO L478 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 11 treesize of output 8 [2018-12-09 09:51:57,995 INFO L478 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 8 treesize of output 7 [2018-12-09 09:51:57,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:57,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:58,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:58,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-12-09 09:51:58,032 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-09 09:51:58,034 INFO L478 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 8 treesize of output 7 [2018-12-09 09:51:58,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:58,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:58,049 INFO L267 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. [2018-12-09 09:51:58,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-09 09:51:58,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2018-12-09 09:51:58,144 INFO L478 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 35 treesize of output 34 [2018-12-09 09:51:58,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:58,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:58,203 INFO L267 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. [2018-12-09 09:51:58,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-12-09 09:51:58,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2018-12-09 09:51:58,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:51:58,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 23 [2018-12-09 09:51:58,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:58,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:58,315 INFO L267 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. [2018-12-09 09:51:58,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:39 [2018-12-09 09:51:58,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2018-12-09 09:51:58,793 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-12-09 09:51:58,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:58,838 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2018-12-09 09:51:58,839 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:58,858 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 09:51:58,859 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:58,874 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 09:51:58,875 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 09:51:58,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:58,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:51:58,886 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:41, output treesize:3 [2018-12-09 09:51:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:51:58,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:51:59,483 WARN L180 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-12-09 09:51:59,729 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-09 09:51:59,979 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-09 09:52:00,203 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-09 09:52:00,622 INFO L478 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 0 case distinctions, treesize of input 67 treesize of output 45 [2018-12-09 09:52:00,628 INFO L478 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 9 treesize of output 8 [2018-12-09 09:52:00,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:00,699 INFO L478 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 44 treesize of output 52 [2018-12-09 09:52:00,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 33 [2018-12-09 09:52:00,794 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:00,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 33 treesize of output 32 [2018-12-09 09:52:00,796 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:00,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 33 treesize of output 32 [2018-12-09 09:52:00,799 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:00,801 INFO L478 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 33 treesize of output 32 [2018-12-09 09:52:00,802 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:01,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 40 [2018-12-09 09:52:01,209 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-09 09:52:01,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 41 [2018-12-09 09:52:01,371 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 09:52:01,463 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 40 [2018-12-09 09:52:01,463 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-09 09:52:01,944 INFO L478 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 32 treesize of output 32 [2018-12-09 09:52:01,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 18 treesize of output 10 [2018-12-09 09:52:01,948 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:02,071 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:52:02,073 INFO L303 Elim1Store]: Index analysis took 102 ms [2018-12-09 09:52:02,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-12-09 09:52:02,074 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:02,090 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:52:02,105 INFO L478 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 33 treesize of output 35 [2018-12-09 09:52:02,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 [2018-12-09 09:52:02,108 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:02,176 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:52:02,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-12-09 09:52:02,179 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:02,200 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:52:02,216 INFO L478 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 1 case distinctions, treesize of input 32 treesize of output 32 [2018-12-09 09:52:02,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 18 treesize of output 10 [2018-12-09 09:52:02,220 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:02,403 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:52:02,405 INFO L303 Elim1Store]: Index analysis took 156 ms [2018-12-09 09:52:02,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-12-09 09:52:02,405 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:02,423 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:52:02,689 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-12-09 09:52:02,692 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-12-09 09:52:02,693 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:02,700 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:02,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-09 09:52:02,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-09 09:52:02,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-09 09:52:02,870 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 2 variables, input treesize:67, output treesize:61 [2018-12-09 09:52:03,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:52:03,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:52:03,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2018-12-09 09:52:03,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-09 09:52:03,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-09 09:52:03,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2018-12-09 09:52:03,289 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 32 states. [2018-12-09 09:52:04,648 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2018-12-09 09:52:05,075 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2018-12-09 09:52:06,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:52:06,408 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-12-09 09:52:06,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 09:52:06,409 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2018-12-09 09:52:06,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:52:06,409 INFO L225 Difference]: With dead ends: 90 [2018-12-09 09:52:06,409 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 09:52:06,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=299, Invalid=1863, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 09:52:06,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 09:52:06,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2018-12-09 09:52:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 09:52:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-12-09 09:52:06,412 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 38 [2018-12-09 09:52:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:52:06,412 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-12-09 09:52:06,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-09 09:52:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-12-09 09:52:06,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 09:52:06,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:52:06,413 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:52:06,413 INFO L423 AbstractCegarLoop]: === Iteration 15 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:52:06,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:06,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1932960382, now seen corresponding path program 1 times [2018-12-09 09:52:06,414 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:52:06,414 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:52:06,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:52:06,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:52:06,517 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 09:52:06,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:06,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:06,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-09 09:52:06,544 INFO L478 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 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:52:06,545 INFO L478 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 10 treesize of output 9 [2018-12-09 09:52:06,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:06,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:06,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:06,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2018-12-09 09:52:06,646 INFO L478 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 13 [2018-12-09 09:52:06,647 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 09:52:06,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:06,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:06,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:06,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-12-09 09:52:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:52:06,678 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:52:06,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:52:06,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 09:52:06,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 09:52:06,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 09:52:06,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:52:06,681 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 13 states. [2018-12-09 09:52:07,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:52:07,331 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-12-09 09:52:07,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 09:52:07,332 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-12-09 09:52:07,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:52:07,332 INFO L225 Difference]: With dead ends: 85 [2018-12-09 09:52:07,332 INFO L226 Difference]: Without dead ends: 85 [2018-12-09 09:52:07,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-12-09 09:52:07,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-09 09:52:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-09 09:52:07,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-09 09:52:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-12-09 09:52:07,334 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 39 [2018-12-09 09:52:07,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:52:07,335 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-12-09 09:52:07,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 09:52:07,335 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-12-09 09:52:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 09:52:07,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:52:07,335 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:52:07,336 INFO L423 AbstractCegarLoop]: === Iteration 16 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:52:07,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:07,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1932932578, now seen corresponding path program 1 times [2018-12-09 09:52:07,336 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:52:07,336 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:52:07,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:52:07,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:52:07,468 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:52:07,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:07,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:07,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-09 09:52:07,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:07,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:07,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:07,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-09 09:52:07,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:07,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:07,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:12 [2018-12-09 09:52:07,520 INFO L478 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 11 treesize of output 8 [2018-12-09 09:52:07,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-09 09:52:07,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:07,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:07,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:07,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 09:52:07,558 INFO L478 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 37 [2018-12-09 09:52:07,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-12-09 09:52:07,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:07,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:07,586 INFO L267 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. [2018-12-09 09:52:07,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-12-09 09:52:07,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 61 [2018-12-09 09:52:07,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 51 treesize of output 50 [2018-12-09 09:52:07,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:07,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:07,772 INFO L267 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. [2018-12-09 09:52:07,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-09 09:52:07,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-12-09 09:52:07,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:07,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 35 treesize of output 46 [2018-12-09 09:52:07,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:07,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:07,887 INFO L267 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. [2018-12-09 09:52:07,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:57 [2018-12-09 09:52:08,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2018-12-09 09:52:08,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2018-12-09 09:52:08,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:08,311 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-12-09 09:52:08,311 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:08,342 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-12-09 09:52:08,342 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:08,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:08,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:08,359 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:7 [2018-12-09 09:52:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:52:08,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:52:09,096 WARN L180 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2018-12-09 09:52:09,301 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-09 09:52:09,570 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-09 09:52:09,869 WARN L180 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-09 09:52:10,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2018-12-09 09:52:10,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:10,247 INFO L267 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. [2018-12-09 09:52:10,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:35 [2018-12-09 09:52:10,397 INFO L478 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 0 case distinctions, treesize of input 67 treesize of output 45 [2018-12-09 09:52:10,404 INFO L478 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 9 treesize of output 8 [2018-12-09 09:52:10,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:10,426 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:52:10,439 INFO L478 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 0 case distinctions, treesize of input 44 treesize of output 38 [2018-12-09 09:52:10,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 [2018-12-09 09:52:10,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:10,517 INFO L478 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 19 treesize of output 18 [2018-12-09 09:52:10,521 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-09 09:52:10,521 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:10,531 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-09 09:52:10,531 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:10,533 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:10,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:10,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:10,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:10,553 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:67, output treesize:8 [2018-12-09 09:52:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:52:10,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:52:10,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 32 [2018-12-09 09:52:10,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-09 09:52:10,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-09 09:52:10,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 09:52:10,805 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 33 states. [2018-12-09 09:52:12,016 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2018-12-09 09:52:12,294 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2018-12-09 09:52:15,162 WARN L180 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-12-09 09:52:15,768 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2018-12-09 09:52:16,003 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2018-12-09 09:52:17,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:52:17,475 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-12-09 09:52:17,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 09:52:17,476 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2018-12-09 09:52:17,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:52:17,476 INFO L225 Difference]: With dead ends: 88 [2018-12-09 09:52:17,477 INFO L226 Difference]: Without dead ends: 88 [2018-12-09 09:52:17,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=372, Invalid=2078, Unknown=0, NotChecked=0, Total=2450 [2018-12-09 09:52:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-09 09:52:17,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-12-09 09:52:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-09 09:52:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-12-09 09:52:17,479 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 39 [2018-12-09 09:52:17,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:52:17,479 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-12-09 09:52:17,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-09 09:52:17,479 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-12-09 09:52:17,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 09:52:17,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:52:17,480 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:52:17,480 INFO L423 AbstractCegarLoop]: === Iteration 17 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:52:17,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:17,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1293048004, now seen corresponding path program 1 times [2018-12-09 09:52:17,481 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:52:17,481 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:52:17,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:52:17,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:52:17,650 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:52:17,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:17,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:17,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-09 09:52:17,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:17,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:17,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:17,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-09 09:52:17,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:17,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:17,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:12 [2018-12-09 09:52:17,706 INFO L478 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 11 treesize of output 8 [2018-12-09 09:52:17,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-09 09:52:17,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:17,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:17,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:17,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 09:52:17,741 INFO L478 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 37 [2018-12-09 09:52:17,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-12-09 09:52:17,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:17,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:17,766 INFO L267 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. [2018-12-09 09:52:17,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-12-09 09:52:17,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 61 [2018-12-09 09:52:17,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 44 treesize of output 45 [2018-12-09 09:52:17,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:17,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 38 [2018-12-09 09:52:17,963 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:17,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:18,006 INFO L267 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. [2018-12-09 09:52:18,006 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-09 09:52:18,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-12-09 09:52:18,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:18,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 35 treesize of output 46 [2018-12-09 09:52:18,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:18,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:18,123 INFO L267 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. [2018-12-09 09:52:18,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:57 [2018-12-09 09:52:18,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2018-12-09 09:52:18,538 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2018-12-09 09:52:18,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:18,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2018-12-09 09:52:18,583 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:18,616 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-12-09 09:52:18,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:18,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:18,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:18,634 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:59, output treesize:12 [2018-12-09 09:52:18,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:18,724 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-12-09 09:52:18,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:18,731 INFO L267 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. [2018-12-09 09:52:18,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2018-12-09 09:52:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:52:18,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:52:19,506 WARN L180 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2018-12-09 09:52:19,741 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-09 09:52:19,946 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-09 09:52:20,170 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-09 09:52:20,688 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-12-09 09:52:20,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:20,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-12-09 09:52:20,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:20,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 09:52:20,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:88, output treesize:72 [2018-12-09 09:52:21,035 INFO L478 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 0 case distinctions, treesize of input 67 treesize of output 45 [2018-12-09 09:52:21,042 INFO L478 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 9 treesize of output 8 [2018-12-09 09:52:21,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:21,069 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:52:21,081 INFO L478 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 0 case distinctions, treesize of input 44 treesize of output 38 [2018-12-09 09:52:21,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 [2018-12-09 09:52:21,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:21,172 INFO L478 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 19 treesize of output 18 [2018-12-09 09:52:21,175 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-09 09:52:21,175 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:21,186 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-09 09:52:21,186 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:21,188 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:21,195 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:21,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:21,235 INFO L478 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 0 case distinctions, treesize of input 68 treesize of output 46 [2018-12-09 09:52:21,239 INFO L478 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 9 treesize of output 8 [2018-12-09 09:52:21,239 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:21,307 INFO L478 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 45 treesize of output 53 [2018-12-09 09:52:21,452 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-12-09 09:52:21,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 30 [2018-12-09 09:52:21,455 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:21,541 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-12-09 09:52:21,541 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:21,617 INFO L478 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 19 [2018-12-09 09:52:21,621 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-12-09 09:52:21,621 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:21,623 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:21,693 INFO L478 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 30 treesize of output 32 [2018-12-09 09:52:21,696 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-12-09 09:52:21,697 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:21,741 INFO L478 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2018-12-09 09:52:21,741 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-12-09 09:52:21,758 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:21,776 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:52:21,783 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:52:21,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:52:21,796 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 6 variables, input treesize:136, output treesize:9 [2018-12-09 09:52:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:52:22,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:52:22,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 33 [2018-12-09 09:52:22,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-09 09:52:22,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-09 09:52:22,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 09:52:22,003 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 34 states. [2018-12-09 09:52:23,309 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2018-12-09 09:52:23,615 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2018-12-09 09:52:25,054 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-12-09 09:52:25,317 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2018-12-09 09:52:26,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:52:26,904 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-12-09 09:52:26,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 09:52:26,905 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2018-12-09 09:52:26,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:52:26,906 INFO L225 Difference]: With dead ends: 87 [2018-12-09 09:52:26,906 INFO L226 Difference]: Without dead ends: 87 [2018-12-09 09:52:26,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=352, Invalid=2300, Unknown=0, NotChecked=0, Total=2652 [2018-12-09 09:52:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-09 09:52:26,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-12-09 09:52:26,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-09 09:52:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-12-09 09:52:26,908 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 41 [2018-12-09 09:52:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:52:26,908 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-12-09 09:52:26,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-09 09:52:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-12-09 09:52:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 09:52:26,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:52:26,909 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:52:26,909 INFO L423 AbstractCegarLoop]: === Iteration 18 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:52:26,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:26,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1293057934, now seen corresponding path program 1 times [2018-12-09 09:52:26,910 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:52:26,910 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:52:26,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:52:27,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:52:27,029 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 09:52:27,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:27,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:27,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-09 09:52:27,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:27,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:27,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 09:52:27,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:27,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:27,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 09:52:27,070 INFO L478 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 13 treesize of output 10 [2018-12-09 09:52:27,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-09 09:52:27,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:27,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:27,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:27,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:27 [2018-12-09 09:52:27,213 INFO L478 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 19 [2018-12-09 09:52:27,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-12-09 09:52:27,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:27,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:27,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:27,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:10 [2018-12-09 09:52:27,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:27,268 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-12-09 09:52:27,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:27,276 INFO L267 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. [2018-12-09 09:52:27,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2018-12-09 09:52:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:52:27,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:52:27,920 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-12-09 09:52:27,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:27,925 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-09 09:52:27,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:27,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:27,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:4 [2018-12-09 09:52:27,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-12-09 09:52:27,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:27,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:27,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-12-09 09:52:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:52:28,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:52:28,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2018-12-09 09:52:28,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 09:52:28,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 09:52:28,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2018-12-09 09:52:28,002 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 26 states. [2018-12-09 09:52:29,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:52:29,482 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-12-09 09:52:29,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 09:52:29,482 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 41 [2018-12-09 09:52:29,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:52:29,483 INFO L225 Difference]: With dead ends: 82 [2018-12-09 09:52:29,483 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 09:52:29,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=142, Invalid=1048, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 09:52:29,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 09:52:29,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-09 09:52:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-09 09:52:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-12-09 09:52:29,485 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 41 [2018-12-09 09:52:29,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:52:29,485 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-12-09 09:52:29,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 09:52:29,485 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-12-09 09:52:29,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 09:52:29,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:52:29,485 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:52:29,485 INFO L423 AbstractCegarLoop]: === Iteration 19 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:52:29,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:29,486 INFO L82 PathProgramCache]: Analyzing trace with hash -2098648359, now seen corresponding path program 1 times [2018-12-09 09:52:29,486 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:52:29,486 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:52:29,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:52:29,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:52:29,609 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 09:52:29,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:29,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:29,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-09 09:52:29,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:29,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:29,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 09:52:29,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:29,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:29,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-12-09 09:52:29,660 INFO L478 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 13 treesize of output 10 [2018-12-09 09:52:29,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-09 09:52:29,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:29,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:29,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:29,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2018-12-09 09:52:29,790 INFO L478 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 19 [2018-12-09 09:52:29,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-12-09 09:52:29,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:29,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:29,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:29,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-12-09 09:52:29,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:29,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2018-12-09 09:52:29,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:29,854 INFO L267 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. [2018-12-09 09:52:29,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:11 [2018-12-09 09:52:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:52:29,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:52:30,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-12-09 09:52:30,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:30,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:30,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-12-09 09:52:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:52:30,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:52:30,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-12-09 09:52:30,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 09:52:30,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 09:52:30,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2018-12-09 09:52:30,472 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 26 states. [2018-12-09 09:52:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:52:33,920 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-12-09 09:52:33,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 09:52:33,920 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2018-12-09 09:52:33,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:52:33,921 INFO L225 Difference]: With dead ends: 80 [2018-12-09 09:52:33,921 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 09:52:33,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 09:52:33,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 09:52:33,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-09 09:52:33,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-09 09:52:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-12-09 09:52:33,922 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 42 [2018-12-09 09:52:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:52:33,922 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-12-09 09:52:33,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 09:52:33,923 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-12-09 09:52:33,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 09:52:33,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:52:33,923 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:52:33,923 INFO L423 AbstractCegarLoop]: === Iteration 20 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:52:33,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:33,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1367972239, now seen corresponding path program 1 times [2018-12-09 09:52:33,924 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:52:33,924 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:52:33,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:52:34,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:52:34,097 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:52:34,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:34,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:34,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-09 09:52:34,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:34,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:34,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:34,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-12-09 09:52:34,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:34,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:34,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:29 [2018-12-09 09:52:34,170 INFO L478 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 11 treesize of output 8 [2018-12-09 09:52:34,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-09 09:52:34,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:34,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:34,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:34,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-12-09 09:52:34,225 INFO L478 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 39 treesize of output 35 [2018-12-09 09:52:34,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-12-09 09:52:34,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:34,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:34,256 INFO L267 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. [2018-12-09 09:52:34,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-12-09 09:52:34,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 61 [2018-12-09 09:52:34,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 51 treesize of output 50 [2018-12-09 09:52:34,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:34,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:34,482 INFO L267 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. [2018-12-09 09:52:34,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2018-12-09 09:52:34,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-12-09 09:52:34,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:34,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 35 treesize of output 46 [2018-12-09 09:52:34,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:34,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:34,625 INFO L267 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. [2018-12-09 09:52:34,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:77 [2018-12-09 09:52:35,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 59 [2018-12-09 09:52:35,053 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-12-09 09:52:35,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:35,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2018-12-09 09:52:35,099 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:52:35,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 32 [2018-12-09 09:52:35,147 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:52:35,191 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-09 09:52:35,192 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:35,229 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-12-09 09:52:35,229 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:35,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 09:52:35,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 09:52:35,267 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-12-09 09:52:35,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:35,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2018-12-09 09:52:35,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:35,381 INFO L267 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. [2018-12-09 09:52:35,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:11 [2018-12-09 09:52:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:52:35,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:52:36,207 WARN L180 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2018-12-09 09:52:36,457 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-09 09:52:36,739 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-09 09:52:37,192 WARN L180 SmtUtils]: Spent 452.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-09 09:52:38,354 INFO L478 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 0 case distinctions, treesize of input 72 treesize of output 50 [2018-12-09 09:52:38,358 INFO L478 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 9 treesize of output 8 [2018-12-09 09:52:38,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:38,411 INFO L478 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 49 treesize of output 57 [2018-12-09 09:52:38,554 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2018-12-09 09:52:38,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 37 treesize of output 36 [2018-12-09 09:52:38,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:38,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 30 [2018-12-09 09:52:38,560 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:38,669 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-12-09 09:52:38,669 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:38,783 INFO L478 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 36 treesize of output 30 [2018-12-09 09:52:38,785 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-09 09:52:38,786 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:38,796 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-09 09:52:38,796 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:38,800 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:38,805 INFO L478 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 30 treesize of output 26 [2018-12-09 09:52:38,808 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-09 09:52:38,808 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:38,818 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-09 09:52:38,818 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:38,824 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:38,887 INFO L478 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 19 [2018-12-09 09:52:38,891 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-12-09 09:52:38,891 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:38,893 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:38,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:52:38,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:52:38,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:52:38,942 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:72, output treesize:15 [2018-12-09 09:52:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:52:41,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:52:41,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 35 [2018-12-09 09:52:41,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-09 09:52:41,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-09 09:52:41,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1127, Unknown=1, NotChecked=0, Total=1260 [2018-12-09 09:52:41,136 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 36 states. [2018-12-09 09:52:42,446 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2018-12-09 09:52:45,068 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-12-09 09:52:47,445 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-12-09 09:52:48,041 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2018-12-09 09:52:48,298 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-12-09 09:52:49,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:52:49,478 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-12-09 09:52:49,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 09:52:49,479 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 42 [2018-12-09 09:52:49,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:52:49,479 INFO L225 Difference]: With dead ends: 83 [2018-12-09 09:52:49,479 INFO L226 Difference]: Without dead ends: 83 [2018-12-09 09:52:49,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=387, Invalid=2474, Unknown=1, NotChecked=0, Total=2862 [2018-12-09 09:52:49,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-09 09:52:49,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-12-09 09:52:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-09 09:52:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-12-09 09:52:49,482 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 42 [2018-12-09 09:52:49,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:52:49,482 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-12-09 09:52:49,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-09 09:52:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-12-09 09:52:49,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 09:52:49,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:52:49,482 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:52:49,483 INFO L423 AbstractCegarLoop]: === Iteration 21 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:52:49,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:49,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1367982169, now seen corresponding path program 1 times [2018-12-09 09:52:49,483 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:52:49,483 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:52:49,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:52:49,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:52:49,631 INFO L478 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 [2018-12-09 09:52:49,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:49,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:49,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 09:52:49,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:49,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:49,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 09:52:49,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:49,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:49,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-12-09 09:52:49,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:49,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:49,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:49,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-09 09:52:49,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:49,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:49,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:16 [2018-12-09 09:52:49,707 INFO L478 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 11 treesize of output 8 [2018-12-09 09:52:49,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-09 09:52:49,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:49,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:49,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:49,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-09 09:52:49,749 INFO L478 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 38 treesize of output 34 [2018-12-09 09:52:49,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-12-09 09:52:49,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:49,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:49,779 INFO L267 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. [2018-12-09 09:52:49,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-12-09 09:52:49,861 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-12-09 09:52:49,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-09 09:52:49,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:49,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:49,903 INFO L267 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. [2018-12-09 09:52:49,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2018-12-09 09:52:49,986 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2018-12-09 09:52:49,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:49,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-12-09 09:52:49,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:50,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:50,043 INFO L267 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. [2018-12-09 09:52:50,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:75 [2018-12-09 09:52:50,679 INFO L478 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 76 treesize of output 50 [2018-12-09 09:52:50,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2018-12-09 09:52:50,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:50,706 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 09:52:50,706 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:50,718 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 09:52:50,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:50,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:50,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:50,732 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:10 [2018-12-09 09:52:50,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:50,829 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-12-09 09:52:50,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:50,835 INFO L267 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. [2018-12-09 09:52:50,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2018-12-09 09:52:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:52:50,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:52:51,913 WARN L180 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2018-12-09 09:52:52,164 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-09 09:52:52,729 WARN L180 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-09 09:52:53,230 WARN L180 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-09 09:52:53,494 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-12-09 09:52:53,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:53,503 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-09 09:52:53,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:53,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:52:53,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:21 [2018-12-09 09:52:53,959 INFO L478 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 0 case distinctions, treesize of input 37 treesize of output 31 [2018-12-09 09:52:53,962 INFO L478 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 9 treesize of output 8 [2018-12-09 09:52:53,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:54,000 INFO L478 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 30 treesize of output 48 [2018-12-09 09:52:54,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 33 [2018-12-09 09:52:54,003 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:54,069 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2018-12-09 09:52:54,070 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 09:52:54,155 INFO L478 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 33 treesize of output 27 [2018-12-09 09:52:54,176 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-09 09:52:54,176 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:54,188 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 09:52:54,188 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:54,195 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:54,263 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-12-09 09:52:54,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:52:54,278 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2018-12-09 09:52:54,278 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:54,283 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:54,284 INFO L478 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 22 treesize of output 20 [2018-12-09 09:52:54,292 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-09 09:52:54,292 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:54,296 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:54,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:52:54,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:52:54,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:52:54,333 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:37, output treesize:9 [2018-12-09 09:52:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:52:54,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:52:54,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2018-12-09 09:52:54,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-09 09:52:54,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-09 09:52:54,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1431, Unknown=0, NotChecked=0, Total=1560 [2018-12-09 09:52:54,826 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 40 states. [2018-12-09 09:52:55,965 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-12-09 09:52:56,738 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-12-09 09:52:57,549 WARN L180 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2018-12-09 09:52:57,796 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-12-09 09:52:58,969 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-12-09 09:52:59,309 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-12-09 09:53:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:53:00,310 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-12-09 09:53:00,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 09:53:00,311 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 42 [2018-12-09 09:53:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:53:00,311 INFO L225 Difference]: With dead ends: 80 [2018-12-09 09:53:00,311 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 09:53:00,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=374, Invalid=2818, Unknown=0, NotChecked=0, Total=3192 [2018-12-09 09:53:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 09:53:00,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-12-09 09:53:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 09:53:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-12-09 09:53:00,314 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 42 [2018-12-09 09:53:00,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:53:00,314 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-12-09 09:53:00,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-09 09:53:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-12-09 09:53:00,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 09:53:00,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:53:00,315 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:53:00,315 INFO L423 AbstractCegarLoop]: === Iteration 22 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:53:00,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:53:00,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1383128080, now seen corresponding path program 1 times [2018-12-09 09:53:00,316 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:53:00,316 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:53:00,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:53:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:53:00,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:53:00,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-12-09 09:53:00,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:00,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:00,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-12-09 09:53:00,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:00,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:00,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 09:53:00,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:00,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:00,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:19 [2018-12-09 09:53:00,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:00,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:00,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:00,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-09 09:53:00,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:00,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:00,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:20 [2018-12-09 09:53:00,559 INFO L478 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 11 treesize of output 8 [2018-12-09 09:53:00,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-09 09:53:00,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:00,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:00,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:00,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-12-09 09:53:00,609 INFO L478 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 49 treesize of output 45 [2018-12-09 09:53:00,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-12-09 09:53:00,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:00,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:00,644 INFO L267 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. [2018-12-09 09:53:00,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:52 [2018-12-09 09:53:00,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 54 [2018-12-09 09:53:00,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-09 09:53:00,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:00,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:00,787 INFO L267 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. [2018-12-09 09:53:00,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2018-12-09 09:53:00,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2018-12-09 09:53:00,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:00,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 41 treesize of output 54 [2018-12-09 09:53:00,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:00,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:00,919 INFO L267 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. [2018-12-09 09:53:00,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:81 [2018-12-09 09:53:01,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 58 [2018-12-09 09:53:01,549 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 09:53:01,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:01,569 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 09:53:01,569 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:01,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 24 [2018-12-09 09:53:01,583 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:01,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:01,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:01,598 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:24 [2018-12-09 09:53:01,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:01,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-12-09 09:53:01,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:01,732 INFO L267 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. [2018-12-09 09:53:01,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:25 [2018-12-09 09:53:01,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:01,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:01,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 36 [2018-12-09 09:53:01,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:01,818 INFO L267 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. [2018-12-09 09:53:01,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2018-12-09 09:53:01,889 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:53:01,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:53:03,318 WARN L180 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2018-12-09 09:53:03,600 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 09:53:03,878 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-12-09 09:53:04,161 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-12-09 09:53:05,032 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:05,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 63 treesize of output 69 [2018-12-09 09:53:05,129 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:05,130 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:05,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2018-12-09 09:53:05,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:05,136 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:05,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:05,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-12-09 09:53:05,139 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:05,217 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-12-09 09:53:05,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:05,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:05,227 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 9 [2018-12-09 09:53:05,227 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:05,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 09:53:05,378 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:05,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 79 [2018-12-09 09:53:05,538 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-12-09 09:53:05,542 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:05,546 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:05,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:05,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-12-09 09:53:05,549 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:05,552 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:05,553 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:05,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2018-12-09 09:53:05,553 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:05,631 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:05,638 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:05,638 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:05,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:05,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 87 [2018-12-09 09:53:05,642 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:05,646 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:05,650 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:05,650 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:05,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 48 [2018-12-09 09:53:05,651 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:05,700 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 09:53:05,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 5 xjuncts. [2018-12-09 09:53:05,839 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:128, output treesize:189 [2018-12-09 09:53:06,233 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-12-09 09:53:06,237 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 09:53:06,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:06,340 INFO L478 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 0 case distinctions, treesize of input 78 treesize of output 55 [2018-12-09 09:53:06,344 INFO L478 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 9 treesize of output 8 [2018-12-09 09:53:06,344 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:06,408 INFO L478 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 50 treesize of output 58 [2018-12-09 09:53:06,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 44 treesize of output 43 [2018-12-09 09:53:06,412 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:06,499 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-12-09 09:53:06,499 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:06,686 INFO L478 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 76 [2018-12-09 09:53:06,689 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 09:53:06,689 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:06,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:06,938 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:06,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 61 [2018-12-09 09:53:06,954 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 09:53:07,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:07,191 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-12-09 09:53:07,192 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:07,464 INFO L478 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 45 [2018-12-09 09:53:07,538 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:07,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:07,540 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:07,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 50 [2018-12-09 09:53:07,581 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-12-09 09:53:07,581 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:07,592 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:07,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:07,623 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 9 [2018-12-09 09:53:07,623 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:07,639 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:53:07,969 INFO L478 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 34 treesize of output 36 [2018-12-09 09:53:08,006 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2018-12-09 09:53:08,006 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:08,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:08,067 INFO L478 Elim1Store]: Elim1 applied some 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 35 [2018-12-09 09:53:08,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:08,074 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 9 [2018-12-09 09:53:08,074 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:08,122 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 23 [2018-12-09 09:53:08,122 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-12-09 09:53:08,137 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:53:08,143 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:08,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2018-12-09 09:53:08,216 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-12-09 09:53:08,216 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:08,240 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-12-09 09:53:08,240 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:08,262 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2018-12-09 09:53:08,262 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:08,269 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:08,301 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, 9 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:53:08,331 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:53:08,339 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:53:08,414 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 54 [2018-12-09 09:53:08,418 INFO L478 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 9 treesize of output 8 [2018-12-09 09:53:08,418 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:08,444 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:53:08,457 INFO L478 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 50 treesize of output 44 [2018-12-09 09:53:08,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 [2018-12-09 09:53:08,460 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:08,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:08,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 46 [2018-12-09 09:53:08,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 19 [2018-12-09 09:53:08,500 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:08,529 INFO L478 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 27 treesize of output 24 [2018-12-09 09:53:08,538 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-12-09 09:53:08,538 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:08,547 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-09 09:53:08,547 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:08,549 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:08,550 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:08,552 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:08,556 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:08,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 09:53:08,577 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 9 variables, input treesize:240, output treesize:35 [2018-12-09 09:53:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:53:09,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:53:09,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-12-09 09:53:09,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-09 09:53:09,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-09 09:53:09,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 09:53:09,155 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 42 states. [2018-12-09 09:53:12,103 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2018-12-09 09:53:12,415 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2018-12-09 09:53:13,355 WARN L180 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 94 [2018-12-09 09:53:13,670 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-12-09 09:53:15,255 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-12-09 09:53:15,653 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-12-09 09:53:17,998 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-12-09 09:53:22,320 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2018-12-09 09:53:22,888 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2018-12-09 09:53:25,222 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2018-12-09 09:53:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:53:27,805 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-12-09 09:53:27,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-09 09:53:27,805 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 43 [2018-12-09 09:53:27,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:53:27,807 INFO L225 Difference]: With dead ends: 80 [2018-12-09 09:53:27,807 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 09:53:27,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=425, Invalid=3607, Unknown=0, NotChecked=0, Total=4032 [2018-12-09 09:53:27,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 09:53:27,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-12-09 09:53:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 09:53:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-12-09 09:53:27,809 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 43 [2018-12-09 09:53:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:53:27,809 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-12-09 09:53:27,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-09 09:53:27,809 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-12-09 09:53:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 09:53:27,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:53:27,810 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:53:27,810 INFO L423 AbstractCegarLoop]: === Iteration 23 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:53:27,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:53:27,810 INFO L82 PathProgramCache]: Analyzing trace with hash 370874875, now seen corresponding path program 1 times [2018-12-09 09:53:27,810 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:53:27,810 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:53:27,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:53:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:53:27,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:53:27,998 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:53:27,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:28,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:28,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-09 09:53:28,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:28,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:28,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:28,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-12-09 09:53:28,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:28,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:28,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:29 [2018-12-09 09:53:28,071 INFO L478 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 11 treesize of output 8 [2018-12-09 09:53:28,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-09 09:53:28,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:28,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:28,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:28,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-12-09 09:53:28,136 INFO L478 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 37 [2018-12-09 09:53:28,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-12-09 09:53:28,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:28,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:28,167 INFO L267 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. [2018-12-09 09:53:28,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-12-09 09:53:28,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 61 [2018-12-09 09:53:28,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 51 treesize of output 50 [2018-12-09 09:53:28,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:28,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:28,372 INFO L267 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. [2018-12-09 09:53:28,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2018-12-09 09:53:28,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-12-09 09:53:28,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:28,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 35 treesize of output 46 [2018-12-09 09:53:28,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:28,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:28,504 INFO L267 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. [2018-12-09 09:53:28,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:77 [2018-12-09 09:53:30,859 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 37 [2018-12-09 09:53:31,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 59 [2018-12-09 09:53:31,151 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2018-12-09 09:53:31,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:31,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:31,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2018-12-09 09:53:31,206 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:31,252 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-09 09:53:31,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:31,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 33 [2018-12-09 09:53:31,292 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:31,333 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-12-09 09:53:31,333 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:31,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:31,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:31,363 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:80, output treesize:26 [2018-12-09 09:53:31,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:31,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2018-12-09 09:53:31,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 09:53:31,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 09:53:31,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2018-12-09 09:53:31,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:31,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:53:31,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-12-09 09:53:31,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:31,615 INFO L267 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. [2018-12-09 09:53:31,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-12-09 09:53:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:53:31,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:53:32,743 WARN L180 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2018-12-09 09:53:32,895 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-09 09:53:33,247 WARN L180 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-09 09:53:33,669 WARN L180 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-09 09:53:34,145 INFO L478 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 0 case distinctions, treesize of input 48 treesize of output 42 [2018-12-09 09:53:34,148 INFO L478 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 9 treesize of output 8 [2018-12-09 09:53:34,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:34,192 INFO L478 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 41 treesize of output 59 [2018-12-09 09:53:34,200 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-12-09 09:53:34,200 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:34,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 45 treesize of output 44 [2018-12-09 09:53:34,259 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:34,324 INFO L478 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 44 treesize of output 44 [2018-12-09 09:53:34,354 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-12-09 09:53:34,354 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 09:53:34,397 INFO L478 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2018-12-09 09:53:34,397 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-09 09:53:34,411 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:34,423 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:34,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:34,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:53:34,426 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:48, output treesize:13 [2018-12-09 09:53:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:53:36,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:53:36,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 41 [2018-12-09 09:53:36,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-09 09:53:36,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-09 09:53:36,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1560, Unknown=1, NotChecked=0, Total=1722 [2018-12-09 09:53:36,640 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 42 states. [2018-12-09 09:53:37,845 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-12-09 09:53:38,137 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2018-12-09 09:53:38,978 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-12-09 09:53:39,573 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2018-12-09 09:53:39,841 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2018-12-09 09:53:40,919 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2018-12-09 09:53:41,263 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2018-12-09 09:53:42,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:53:42,039 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-12-09 09:53:42,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 09:53:42,040 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 44 [2018-12-09 09:53:42,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:53:42,040 INFO L225 Difference]: With dead ends: 77 [2018-12-09 09:53:42,040 INFO L226 Difference]: Without dead ends: 77 [2018-12-09 09:53:42,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=441, Invalid=3337, Unknown=4, NotChecked=0, Total=3782 [2018-12-09 09:53:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-09 09:53:42,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-12-09 09:53:42,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 09:53:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-12-09 09:53:42,042 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 44 [2018-12-09 09:53:42,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:53:42,042 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-12-09 09:53:42,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-09 09:53:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-12-09 09:53:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 09:53:42,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:53:42,042 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:53:42,043 INFO L423 AbstractCegarLoop]: === Iteration 24 === [_destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2018-12-09 09:53:42,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:53:42,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1114704330, now seen corresponding path program 1 times [2018-12-09 09:53:42,043 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 09:53:42,043 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5123ad2-2d9e-4e05-bd19-3dd18fd941ac/bin-2019/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 09:53:42,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:53:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:53:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:53:42,451 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 09:53:42,465 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 09:53:42,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:53:42 BoogieIcfgContainer [2018-12-09 09:53:42,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:53:42,478 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:53:42,478 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:53:42,478 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:53:42,478 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:51:52" (3/4) ... [2018-12-09 09:53:42,481 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 09:53:42,481 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:53:42,482 INFO L168 Benchmark]: Toolchain (without parser) took 110280.61 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 258.5 MB). Free memory was 939.3 MB in the beginning and 992.2 MB in the end (delta: -52.8 MB). Peak memory consumption was 205.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:53:42,482 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:53:42,482 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -185.5 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2018-12-09 09:53:42,483 INFO L168 Benchmark]: Boogie Preprocessor took 34.35 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-09 09:53:42,483 INFO L168 Benchmark]: RCFGBuilder took 369.23 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: 61.5 MB). Peak memory consumption was 61.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:53:42,483 INFO L168 Benchmark]: TraceAbstraction took 109560.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.1 MB). Free memory was 1.1 GB in the beginning and 992.2 MB in the end (delta: 64.3 MB). Peak memory consumption was 184.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:53:42,483 INFO L168 Benchmark]: Witness Printer took 3.19 ms. Allocated memory is still 1.3 GB. Free memory is still 992.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:53:42,484 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 310.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -185.5 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.35 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 369.23 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: 61.5 MB). Peak memory consumption was 61.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 109560.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.1 MB). Free memory was 1.1 GB in the beginning and 992.2 MB in the end (delta: 64.3 MB). Peak memory consumption was 184.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.19 ms. Allocated memory is still 1.3 GB. Free memory is still 992.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 616]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 616. Possible FailurePath: [L617] const int len = 3; VAL [len=3] [L618] CALL, EXPR dll_circular_create(len) VAL [\old(len)=3] [L564] DLL last = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=3, last={-513614432:0}, len=3, malloc(sizeof(struct node))={-513614432:0}] [L565] COND FALSE !(((void *)0) == last) VAL [\old(len)=3, last={-513614432:0}, len=3, malloc(sizeof(struct node))={-513614432:0}] [L568] last->next = last VAL [\old(len)=3, last={-513614432:0}, len=3, malloc(sizeof(struct node))={-513614432:0}] [L569] last->prev = last VAL [\old(len)=3, last={-513614432:0}, len=3, malloc(sizeof(struct node))={-513614432:0}] [L570] DLL head = last; VAL [\old(len)=3, head={-513614432:0}, last={-513614432:0}, len=3, malloc(sizeof(struct node))={-513614432:0}] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={-513614432:0}, last={-513614432:0}, len=3, malloc(sizeof(struct node))={47522555:0}, malloc(sizeof(struct node))={-513614432:0}, new_head={47522555:0}] [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-513614432:0}, last={-513614432:0}, len=3, malloc(sizeof(struct node))={47522555:0}, malloc(sizeof(struct node))={-513614432:0}, new_head={47522555:0}] [L576] new_head->next = head VAL [\old(len)=3, head={-513614432:0}, last={-513614432:0}, len=3, malloc(sizeof(struct node))={47522555:0}, malloc(sizeof(struct node))={-513614432:0}, new_head={47522555:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={-513614432:0}, last={-513614432:0}, len=3, malloc(sizeof(struct node))={47522555:0}, malloc(sizeof(struct node))={-513614432:0}, new_head={47522555:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={47522555:0}, last={-513614432:0}, len=2, malloc(sizeof(struct node))={47522555:0}, malloc(sizeof(struct node))={-513614432:0}, new_head={47522555:0}] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={47522555:0}, last={-513614432:0}, len=2, malloc(sizeof(struct node))={472502084:0}, malloc(sizeof(struct node))={-513614432:0}, new_head={472502084:0}] [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={47522555:0}, last={-513614432:0}, len=2, malloc(sizeof(struct node))={472502084:0}, malloc(sizeof(struct node))={-513614432:0}, new_head={472502084:0}] [L576] new_head->next = head VAL [\old(len)=3, head={47522555:0}, last={-513614432:0}, len=2, malloc(sizeof(struct node))={472502084:0}, malloc(sizeof(struct node))={-513614432:0}, new_head={472502084:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={47522555:0}, last={-513614432:0}, len=2, malloc(sizeof(struct node))={472502084:0}, malloc(sizeof(struct node))={-513614432:0}, new_head={472502084:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={472502084:0}, last={-513614432:0}, len=1, malloc(sizeof(struct node))={472502084:0}, malloc(sizeof(struct node))={-513614432:0}, new_head={472502084:0}] [L571] COND FALSE !(len > 1) VAL [\old(len)=3, head={472502084:0}, last={-513614432:0}, len=1, malloc(sizeof(struct node))={472502084:0}, malloc(sizeof(struct node))={-513614432:0}, new_head={472502084:0}] [L581] last->next = head VAL [\old(len)=3, head={472502084:0}, last={-513614432:0}, len=1, malloc(sizeof(struct node))={472502084:0}, malloc(sizeof(struct node))={-513614432:0}, new_head={472502084:0}] [L582] head->prev = last VAL [\old(len)=3, head={472502084:0}, last={-513614432:0}, len=1, malloc(sizeof(struct node))={472502084:0}, malloc(sizeof(struct node))={-513614432:0}, new_head={472502084:0}] [L583] return head; VAL [\old(len)=3, \result={472502084:0}, head={472502084:0}, last={-513614432:0}, len=1, malloc(sizeof(struct node))={472502084:0}, malloc(sizeof(struct node))={-513614432:0}, new_head={472502084:0}] [L618] RET, EXPR dll_circular_create(len) VAL [dll_circular_create(len)={472502084:0}, len=3] [L618] DLL head = dll_circular_create(len); [L619] CALL _destroy_in_nondeterministic_order(head) VAL [head={472502084:0}] [L586] EXPR head->prev VAL [head={472502084:0}, head={472502084:0}, head->prev={-513614432:0}] [L586] DLL pred = head->prev; [L587] EXPR head->next VAL [head={472502084:0}, head={472502084:0}, head->next={47522555:0}, pred={-513614432:0}] [L587] DLL succ = head->next; [L588] COND FALSE !(__VERIFIER_nondet_int()) [L597] COND FALSE !(__VERIFIER_nondet_int()) [L607] free(pred) VAL [head={472502084:0}, head={472502084:0}, pred={-513614432:0}, succ={47522555:0}] [L607] free(pred) [L608] COND FALSE !(__VERIFIER_nondet_int()) [L612] free(head) VAL [head={472502084:0}, head={472502084:0}, pred={-513614432:0}, succ={47522555:0}] [L612] free(head) [L619] RET _destroy_in_nondeterministic_order(head) VAL [head={472502084:0}, len=3] [L620] head = ((void *)0) [L621] return 0; VAL [\result=0, head={0:0}, len=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 126 locations, 45 error locations. UNSAFE Result, 109.5s OverallTime, 24 OverallIterations, 2 TraceHistogramMax, 61.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1712 SDtfs, 1981 SDslu, 9020 SDs, 0 SdLazy, 10008 SolverSat, 656 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 28.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1262 GetRequests, 704 SyntacticMatches, 23 SemanticMatches, 535 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4752 ImplicationChecksByTransitivity, 53.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 46 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 45.6s InterpolantComputationTime, 718 NumberOfCodeBlocks, 718 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1071 ConstructedInterpolants, 182 QuantifiedInterpolants, 579269 SizeOfPredicates, 278 NumberOfNonLiveVariables, 2656 ConjunctsInSsa, 437 ConjunctsInUnsatCore, 35 InterpolantComputations, 11 PerfectInterpolantSequences, 46/172 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...