./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/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 0db1674e58e1126b93b48759a00b2e69f0d5f058 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/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 0db1674e58e1126b93b48759a00b2e69f0d5f058 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:22:36,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:22:36,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:22:36,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:22:36,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:22:36,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:22:36,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:22:36,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:22:36,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:22:36,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:22:36,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:22:36,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:22:36,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:22:36,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:22:36,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:22:36,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:22:36,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:22:36,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:22:36,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:22:36,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:22:36,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:22:36,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:22:36,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:22:36,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:22:36,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:22:36,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:22:36,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:22:36,593 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:22:36,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:22:36,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:22:36,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:22:36,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:22:36,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:22:36,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:22:36,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:22:36,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:22:36,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:22:36,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:22:36,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:22:36,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:22:36,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:22:36,600 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 18:22:36,612 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:22:36,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:22:36,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:22:36,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:22:36,614 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:22:36,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:22:36,614 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:22:36,614 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:22:36,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:22:36,615 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:22:36,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:22:36,615 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 18:22:36,615 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 18:22:36,615 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 18:22:36,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:22:36,616 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 18:22:36,616 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:22:36,616 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:22:36,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:22:36,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:22:36,616 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:22:36,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:22:36,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:22:36,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:22:36,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:22:36,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:22:36,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:22:36,618 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:22:36,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 0db1674e58e1126b93b48759a00b2e69f0d5f058 [2019-12-07 18:22:36,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:22:36,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:22:36,727 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:22:36,728 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:22:36,728 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:22:36,728 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-12-07 18:22:36,765 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/data/331c8ecf8/7a93f42996e54f41aba60f20129646f7/FLAG3e85ee194 [2019-12-07 18:22:37,124 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:22:37,125 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-12-07 18:22:37,135 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/data/331c8ecf8/7a93f42996e54f41aba60f20129646f7/FLAG3e85ee194 [2019-12-07 18:22:37,143 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/data/331c8ecf8/7a93f42996e54f41aba60f20129646f7 [2019-12-07 18:22:37,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:22:37,146 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 18:22:37,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:22:37,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:22:37,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:22:37,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:22:37" (1/1) ... [2019-12-07 18:22:37,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61001065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:37, skipping insertion in model container [2019-12-07 18:22:37,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:22:37" (1/1) ... [2019-12-07 18:22:37,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:22:37,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:22:37,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:22:37,400 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:22:37,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:22:37,469 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:22:37,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:37 WrapperNode [2019-12-07 18:22:37,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:22:37,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:22:37,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:22:37,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:22:37,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:37" (1/1) ... [2019-12-07 18:22:37,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:37" (1/1) ... [2019-12-07 18:22:37,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:37" (1/1) ... [2019-12-07 18:22:37,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:37" (1/1) ... [2019-12-07 18:22:37,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:37" (1/1) ... [2019-12-07 18:22:37,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:37" (1/1) ... [2019-12-07 18:22:37,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:37" (1/1) ... [2019-12-07 18:22:37,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:22:37,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:22:37,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:22:37,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:22:37,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:22:37,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 18:22:37,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:22:37,555 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 18:22:37,555 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 18:22:37,555 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 18:22:37,555 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 18:22:37,555 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 18:22:37,556 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-12-07 18:22:37,556 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 18:22:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 18:22:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 18:22:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 18:22:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 18:22:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 18:22:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 18:22:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 18:22:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 18:22:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 18:22:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 18:22:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 18:22:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 18:22:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 18:22:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 18:22:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 18:22:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 18:22:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 18:22:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 18:22:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 18:22:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 18:22:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 18:22:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 18:22:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 18:22:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 18:22:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 18:22:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 18:22:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 18:22:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 18:22:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 18:22:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 18:22:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 18:22:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 18:22:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 18:22:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 18:22:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 18:22:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 18:22:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 18:22:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 18:22:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 18:22:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 18:22:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 18:22:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 18:22:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 18:22:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 18:22:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 18:22:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 18:22:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 18:22:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 18:22:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 18:22:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 18:22:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 18:22:37,560 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 18:22:37,560 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 18:22:37,560 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 18:22:37,560 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 18:22:37,560 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 18:22:37,560 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 18:22:37,560 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 18:22:37,560 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 18:22:37,560 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 18:22:37,560 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 18:22:37,560 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 18:22:37,560 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 18:22:37,560 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 18:22:37,560 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 18:22:37,561 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 18:22:37,561 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 18:22:37,561 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 18:22:37,561 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 18:22:37,561 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 18:22:37,561 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 18:22:37,561 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 18:22:37,561 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 18:22:37,561 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 18:22:37,561 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 18:22:37,561 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 18:22:37,561 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 18:22:37,561 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 18:22:37,561 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 18:22:37,562 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 18:22:37,562 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 18:22:37,562 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 18:22:37,562 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 18:22:37,562 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 18:22:37,562 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 18:22:37,562 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 18:22:37,562 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 18:22:37,562 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 18:22:37,562 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 18:22:37,562 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 18:22:37,563 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 18:22:37,563 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 18:22:37,563 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 18:22:37,563 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 18:22:37,563 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 18:22:37,563 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 18:22:37,563 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 18:22:37,563 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 18:22:37,563 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 18:22:37,563 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 18:22:37,564 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 18:22:37,564 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 18:22:37,564 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 18:22:37,564 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 18:22:37,564 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 18:22:37,564 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 18:22:37,564 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 18:22:37,564 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 18:22:37,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 18:22:37,564 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-12-07 18:22:37,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:22:37,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:22:37,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:22:37,565 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 18:22:37,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:22:37,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 18:22:37,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:22:37,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 18:22:37,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:22:37,868 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:22:37,869 INFO L287 CfgBuilder]: Removed 2 assume(true) statements. [2019-12-07 18:22:37,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:22:37 BoogieIcfgContainer [2019-12-07 18:22:37,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:22:37,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:22:37,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:22:37,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:22:37,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:22:37" (1/3) ... [2019-12-07 18:22:37,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c17145a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:22:37, skipping insertion in model container [2019-12-07 18:22:37,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:37" (2/3) ... [2019-12-07 18:22:37,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c17145a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:22:37, skipping insertion in model container [2019-12-07 18:22:37,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:22:37" (3/3) ... [2019-12-07 18:22:37,875 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2019-12-07 18:22:37,881 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:22:37,886 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2019-12-07 18:22:37,894 INFO L249 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2019-12-07 18:22:37,907 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:22:37,907 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 18:22:37,907 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:22:37,907 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:22:37,907 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:22:37,907 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:22:37,907 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:22:37,907 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:22:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2019-12-07 18:22:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 18:22:37,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:37,926 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:37,927 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:37,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:37,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1513027048, now seen corresponding path program 1 times [2019-12-07 18:22:37,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:37,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813337244] [2019-12-07 18:22:37,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:38,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813337244] [2019-12-07 18:22:38,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:38,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:22:38,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994730116] [2019-12-07 18:22:38,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:22:38,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:38,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:22:38,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:22:38,126 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 6 states. [2019-12-07 18:22:38,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:38,421 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2019-12-07 18:22:38,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:22:38,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 18:22:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:38,432 INFO L225 Difference]: With dead ends: 130 [2019-12-07 18:22:38,432 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 18:22:38,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:22:38,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 18:22:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2019-12-07 18:22:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 18:22:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2019-12-07 18:22:38,466 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 9 [2019-12-07 18:22:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:38,467 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2019-12-07 18:22:38,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:22:38,467 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2019-12-07 18:22:38,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 18:22:38,467 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:38,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:38,468 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:38,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:38,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1513027049, now seen corresponding path program 1 times [2019-12-07 18:22:38,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:38,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134186191] [2019-12-07 18:22:38,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:38,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134186191] [2019-12-07 18:22:38,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:38,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:22:38,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619259336] [2019-12-07 18:22:38,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:22:38,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:38,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:22:38,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:22:38,521 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 6 states. [2019-12-07 18:22:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:38,687 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2019-12-07 18:22:38,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:22:38,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 18:22:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:38,689 INFO L225 Difference]: With dead ends: 100 [2019-12-07 18:22:38,689 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 18:22:38,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:22:38,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 18:22:38,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-12-07 18:22:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 18:22:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2019-12-07 18:22:38,696 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 9 [2019-12-07 18:22:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:38,696 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2019-12-07 18:22:38,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:22:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2019-12-07 18:22:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 18:22:38,697 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:38,697 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:38,697 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:38,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:38,698 INFO L82 PathProgramCache]: Analyzing trace with hash 340801820, now seen corresponding path program 1 times [2019-12-07 18:22:38,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:38,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120204125] [2019-12-07 18:22:38,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:38,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120204125] [2019-12-07 18:22:38,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:38,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:22:38,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249230677] [2019-12-07 18:22:38,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:22:38,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:38,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:22:38,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:38,732 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 4 states. [2019-12-07 18:22:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:38,833 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2019-12-07 18:22:38,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:22:38,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 18:22:38,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:38,834 INFO L225 Difference]: With dead ends: 96 [2019-12-07 18:22:38,835 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 18:22:38,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 18:22:38,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-12-07 18:22:38,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 18:22:38,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2019-12-07 18:22:38,840 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 10 [2019-12-07 18:22:38,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:38,840 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2019-12-07 18:22:38,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:22:38,841 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2019-12-07 18:22:38,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 18:22:38,841 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:38,841 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:38,841 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:38,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:38,842 INFO L82 PathProgramCache]: Analyzing trace with hash 340801821, now seen corresponding path program 1 times [2019-12-07 18:22:38,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:38,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481936769] [2019-12-07 18:22:38,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:38,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481936769] [2019-12-07 18:22:38,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:38,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:22:38,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526929840] [2019-12-07 18:22:38,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:22:38,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:38,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:22:38,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:38,879 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 4 states. [2019-12-07 18:22:38,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:38,974 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2019-12-07 18:22:38,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:22:38,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 18:22:38,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:38,975 INFO L225 Difference]: With dead ends: 92 [2019-12-07 18:22:38,975 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 18:22:38,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:38,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 18:22:38,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-12-07 18:22:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 18:22:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2019-12-07 18:22:38,980 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 10 [2019-12-07 18:22:38,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:38,981 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2019-12-07 18:22:38,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:22:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2019-12-07 18:22:38,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:22:38,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:38,981 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:38,982 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:38,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:38,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1768427773, now seen corresponding path program 1 times [2019-12-07 18:22:38,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:38,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579995286] [2019-12-07 18:22:38,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:39,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579995286] [2019-12-07 18:22:39,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:39,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:22:39,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103094664] [2019-12-07 18:22:39,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:22:39,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:39,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:22:39,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:22:39,068 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 9 states. [2019-12-07 18:22:39,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:39,282 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2019-12-07 18:22:39,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:22:39,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-07 18:22:39,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:39,283 INFO L225 Difference]: With dead ends: 103 [2019-12-07 18:22:39,283 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 18:22:39,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:22:39,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 18:22:39,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-12-07 18:22:39,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 18:22:39,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2019-12-07 18:22:39,290 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 15 [2019-12-07 18:22:39,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:39,291 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2019-12-07 18:22:39,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:22:39,291 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2019-12-07 18:22:39,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:22:39,291 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:39,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:39,292 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:39,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:39,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1013592001, now seen corresponding path program 1 times [2019-12-07 18:22:39,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:39,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798460173] [2019-12-07 18:22:39,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:39,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798460173] [2019-12-07 18:22:39,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:39,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:22:39,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110034432] [2019-12-07 18:22:39,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:22:39,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:39,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:22:39,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:22:39,371 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 8 states. [2019-12-07 18:22:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:39,513 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2019-12-07 18:22:39,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:22:39,513 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-12-07 18:22:39,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:39,514 INFO L225 Difference]: With dead ends: 98 [2019-12-07 18:22:39,514 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 18:22:39,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:22:39,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 18:22:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2019-12-07 18:22:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 18:22:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2019-12-07 18:22:39,519 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 16 [2019-12-07 18:22:39,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:39,519 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2019-12-07 18:22:39,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:22:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2019-12-07 18:22:39,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:22:39,520 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:39,520 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:39,520 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:39,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:39,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1478502648, now seen corresponding path program 1 times [2019-12-07 18:22:39,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:39,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474285122] [2019-12-07 18:22:39,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:39,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:39,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474285122] [2019-12-07 18:22:39,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:39,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:22:39,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436904316] [2019-12-07 18:22:39,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:22:39,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:39,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:22:39,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:22:39,577 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand 6 states. [2019-12-07 18:22:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:39,676 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2019-12-07 18:22:39,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:22:39,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 18:22:39,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:39,677 INFO L225 Difference]: With dead ends: 74 [2019-12-07 18:22:39,677 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 18:22:39,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:22:39,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 18:22:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-12-07 18:22:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 18:22:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-12-07 18:22:39,681 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 25 [2019-12-07 18:22:39,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:39,683 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-12-07 18:22:39,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:22:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-12-07 18:22:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:22:39,684 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:39,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:39,684 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:39,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:39,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1477280452, now seen corresponding path program 1 times [2019-12-07 18:22:39,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:39,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801812261] [2019-12-07 18:22:39,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:39,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:39,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801812261] [2019-12-07 18:22:39,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:39,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:22:39,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286850616] [2019-12-07 18:22:39,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:22:39,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:39,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:22:39,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:22:39,771 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 9 states. [2019-12-07 18:22:39,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:39,944 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2019-12-07 18:22:39,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:22:39,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-07 18:22:39,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:39,945 INFO L225 Difference]: With dead ends: 72 [2019-12-07 18:22:39,945 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 18:22:39,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:22:39,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 18:22:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-12-07 18:22:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 18:22:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2019-12-07 18:22:39,948 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 25 [2019-12-07 18:22:39,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:39,949 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2019-12-07 18:22:39,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:22:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2019-12-07 18:22:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:22:39,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:39,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:39,950 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:39,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:39,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1477280453, now seen corresponding path program 1 times [2019-12-07 18:22:39,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:39,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741641374] [2019-12-07 18:22:39,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:40,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741641374] [2019-12-07 18:22:40,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:40,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:22:40,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207046780] [2019-12-07 18:22:40,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:22:40,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:40,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:22:40,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:22:40,060 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 9 states. [2019-12-07 18:22:40,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:40,260 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2019-12-07 18:22:40,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:22:40,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-07 18:22:40,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:40,261 INFO L225 Difference]: With dead ends: 71 [2019-12-07 18:22:40,261 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 18:22:40,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:22:40,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 18:22:40,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-12-07 18:22:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 18:22:40,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2019-12-07 18:22:40,263 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2019-12-07 18:22:40,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:40,264 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2019-12-07 18:22:40,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:22:40,264 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2019-12-07 18:22:40,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:22:40,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:40,264 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:40,265 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:40,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:40,265 INFO L82 PathProgramCache]: Analyzing trace with hash -867915693, now seen corresponding path program 1 times [2019-12-07 18:22:40,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:40,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338998612] [2019-12-07 18:22:40,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:40,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338998612] [2019-12-07 18:22:40,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:40,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:22:40,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340974636] [2019-12-07 18:22:40,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:22:40,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:40,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:22:40,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:22:40,330 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 8 states. [2019-12-07 18:22:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:40,477 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-12-07 18:22:40,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:22:40,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-12-07 18:22:40,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:40,478 INFO L225 Difference]: With dead ends: 70 [2019-12-07 18:22:40,478 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 18:22:40,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:22:40,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 18:22:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-12-07 18:22:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 18:22:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-12-07 18:22:40,480 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 28 [2019-12-07 18:22:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:40,480 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-12-07 18:22:40,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:22:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-12-07 18:22:40,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:22:40,481 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:40,481 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:40,481 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:40,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:40,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1135582619, now seen corresponding path program 1 times [2019-12-07 18:22:40,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:40,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211671238] [2019-12-07 18:22:40,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:40,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211671238] [2019-12-07 18:22:40,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:40,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:22:40,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384259951] [2019-12-07 18:22:40,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:22:40,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:40,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:22:40,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:22:40,559 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 8 states. [2019-12-07 18:22:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:40,733 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-12-07 18:22:40,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:22:40,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-07 18:22:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:40,734 INFO L225 Difference]: With dead ends: 69 [2019-12-07 18:22:40,734 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 18:22:40,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:22:40,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 18:22:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-12-07 18:22:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 18:22:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-12-07 18:22:40,737 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 29 [2019-12-07 18:22:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:40,737 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-12-07 18:22:40,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:22:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-12-07 18:22:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:22:40,738 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:40,738 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:40,738 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:40,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash -97727638, now seen corresponding path program 1 times [2019-12-07 18:22:40,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:40,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395497081] [2019-12-07 18:22:40,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:40,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395497081] [2019-12-07 18:22:40,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089273278] [2019-12-07 18:22:40,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:22:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:40,960 INFO L264 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 54 conjunts are in the unsatisfiable core [2019-12-07 18:22:40,965 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:41,029 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:22:41,030 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:41,037 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:41,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:22:41,040 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:41,046 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:41,047 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:41,047 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2019-12-07 18:22:41,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:22:41,107 INFO L377 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 0 case distinctions, treesize of input 16 treesize of output 18 [2019-12-07 18:22:41,107 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:41,115 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:41,121 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:41,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 18:22:41,122 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:41,128 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:41,128 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:41,128 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2019-12-07 18:22:41,192 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 18:22:41,193 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 18:22:41,193 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:41,202 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:41,212 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 18:22:41,212 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-12-07 18:22:41,213 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:41,221 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:41,222 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:41,222 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2019-12-07 18:22:41,268 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:41,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2019-12-07 18:22:41,269 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:41,276 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:41,281 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:41,281 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-12-07 18:22:41,282 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:41,287 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:41,287 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:41,287 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2019-12-07 18:22:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:41,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:22:41,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-07 18:22:41,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775303875] [2019-12-07 18:22:41,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 18:22:41,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:41,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 18:22:41,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:22:41,314 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 19 states. [2019-12-07 18:22:42,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:42,045 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2019-12-07 18:22:42,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:22:42,046 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-07 18:22:42,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:42,046 INFO L225 Difference]: With dead ends: 75 [2019-12-07 18:22:42,046 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 18:22:42,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2019-12-07 18:22:42,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 18:22:42,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-12-07 18:22:42,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 18:22:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-12-07 18:22:42,050 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 30 [2019-12-07 18:22:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:42,051 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-12-07 18:22:42,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 18:22:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-12-07 18:22:42,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:22:42,052 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:42,052 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:42,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:22:42,253 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:42,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:42,253 INFO L82 PathProgramCache]: Analyzing trace with hash -97727639, now seen corresponding path program 1 times [2019-12-07 18:22:42,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:42,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811652713] [2019-12-07 18:22:42,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:42,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811652713] [2019-12-07 18:22:42,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420930048] [2019-12-07 18:22:42,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:22:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:42,435 INFO L264 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 18:22:42,437 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:42,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:22:42,450 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:42,453 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:42,453 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:42,454 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-12-07 18:22:42,492 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:42,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 59 [2019-12-07 18:22:42,493 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:42,505 INFO L614 ElimStorePlain]: treesize reduction 26, result has 50.0 percent of original size [2019-12-07 18:22:42,506 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:42,506 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:26 [2019-12-07 18:22:42,553 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 18:22:42,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-12-07 18:22:42,553 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:42,559 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:42,559 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:42,559 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2019-12-07 18:22:42,590 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:42,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2019-12-07 18:22:42,590 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:42,594 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:42,595 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:42,595 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:15 [2019-12-07 18:22:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:42,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:22:42,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-07 18:22:42,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031913067] [2019-12-07 18:22:42,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 18:22:42,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:42,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 18:22:42,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:22:42,616 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 19 states. [2019-12-07 18:22:43,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:43,322 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2019-12-07 18:22:43,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:22:43,323 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-07 18:22:43,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:43,323 INFO L225 Difference]: With dead ends: 74 [2019-12-07 18:22:43,323 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 18:22:43,324 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2019-12-07 18:22:43,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 18:22:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-12-07 18:22:43,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 18:22:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-12-07 18:22:43,326 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 30 [2019-12-07 18:22:43,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:43,326 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-12-07 18:22:43,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 18:22:43,326 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-12-07 18:22:43,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:22:43,327 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:43,327 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:43,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:22:43,528 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:43,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:43,529 INFO L82 PathProgramCache]: Analyzing trace with hash -843322731, now seen corresponding path program 1 times [2019-12-07 18:22:43,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:43,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55598080] [2019-12-07 18:22:43,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:43,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:43,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55598080] [2019-12-07 18:22:43,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:43,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:22:43,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977241764] [2019-12-07 18:22:43,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:22:43,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:43,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:22:43,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:22:43,610 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 7 states. [2019-12-07 18:22:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:43,727 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-12-07 18:22:43,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:22:43,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-12-07 18:22:43,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:43,728 INFO L225 Difference]: With dead ends: 71 [2019-12-07 18:22:43,728 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 18:22:43,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:22:43,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 18:22:43,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-12-07 18:22:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 18:22:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-12-07 18:22:43,731 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 30 [2019-12-07 18:22:43,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:43,731 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-12-07 18:22:43,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:22:43,731 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-12-07 18:22:43,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 18:22:43,731 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:43,732 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:43,732 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:43,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:43,732 INFO L82 PathProgramCache]: Analyzing trace with hash -373200792, now seen corresponding path program 1 times [2019-12-07 18:22:43,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:43,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670649608] [2019-12-07 18:22:43,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:43,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670649608] [2019-12-07 18:22:43,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:43,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:22:43,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308715361] [2019-12-07 18:22:43,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:22:43,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:43,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:22:43,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:22:43,820 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 9 states. [2019-12-07 18:22:43,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:43,980 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-12-07 18:22:43,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:22:43,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-12-07 18:22:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:43,981 INFO L225 Difference]: With dead ends: 70 [2019-12-07 18:22:43,981 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 18:22:43,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:22:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 18:22:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-12-07 18:22:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 18:22:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-12-07 18:22:43,983 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 31 [2019-12-07 18:22:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:43,983 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-12-07 18:22:43,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:22:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-12-07 18:22:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 18:22:43,984 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:43,984 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:43,984 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:43,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:43,984 INFO L82 PathProgramCache]: Analyzing trace with hash -373200791, now seen corresponding path program 1 times [2019-12-07 18:22:43,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:43,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340241474] [2019-12-07 18:22:43,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:44,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340241474] [2019-12-07 18:22:44,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:44,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:22:44,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396237600] [2019-12-07 18:22:44,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:22:44,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:44,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:22:44,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:44,024 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 5 states. [2019-12-07 18:22:44,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:44,117 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-12-07 18:22:44,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:22:44,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 18:22:44,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:44,118 INFO L225 Difference]: With dead ends: 66 [2019-12-07 18:22:44,118 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 18:22:44,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:22:44,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 18:22:44,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-12-07 18:22:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 18:22:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-12-07 18:22:44,120 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 31 [2019-12-07 18:22:44,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:44,120 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-12-07 18:22:44,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:22:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-12-07 18:22:44,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:22:44,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:44,121 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:44,121 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:44,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:44,121 INFO L82 PathProgramCache]: Analyzing trace with hash -526970094, now seen corresponding path program 1 times [2019-12-07 18:22:44,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:44,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128830292] [2019-12-07 18:22:44,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:22:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:22:44,162 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:22:44,162 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:22:44,175 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-12-07 18:22:44,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:22:44 BoogieIcfgContainer [2019-12-07 18:22:44,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:22:44,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:22:44,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:22:44,189 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:22:44,189 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:22:37" (3/4) ... [2019-12-07 18:22:44,192 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 18:22:44,192 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:22:44,193 INFO L168 Benchmark]: Toolchain (without parser) took 7046.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 932.6 MB in the beginning and 976.3 MB in the end (delta: -43.7 MB). Peak memory consumption was 124.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:44,193 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 954.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:22:44,193 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -141.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:44,194 INFO L168 Benchmark]: Boogie Preprocessor took 45.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:44,194 INFO L168 Benchmark]: RCFGBuilder took 353.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:44,194 INFO L168 Benchmark]: TraceAbstraction took 6318.43 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.0 GB in the beginning and 976.3 MB in the end (delta: 34.3 MB). Peak memory consumption was 113.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:44,194 INFO L168 Benchmark]: Witness Printer took 3.23 ms. Allocated memory is still 1.2 GB. Free memory is still 976.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:22:44,196 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 954.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -141.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 353.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6318.43 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.0 GB in the beginning and 976.3 MB in the end (delta: 34.3 MB). Peak memory consumption was 113.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.23 ms. Allocated memory is still 1.2 GB. Free memory is still 976.3 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: 528]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 528. Possible FailurePath: [L513] int c = 0; VAL [\old(c)=11, c=0] [L530] struct item *list = ((void *)0); [L531] int length = 0; VAL [\old(c)=0, c=0, length=0, list={9:0}] [L533] CALL append(&list) VAL [\old(c)=0, c=0, plist={9:0}] [L520] c++ [L521] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={7:0}, malloc(sizeof *item)={7:0}, plist={9:0}, plist={9:0}] [L522] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={7:0}, malloc(sizeof *item)={7:0}, plist={9:0}, plist={9:0}] [L522] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={7:0}, malloc(sizeof *item)={7:0}, plist={9:0}, plist={9:0}] [L523] EXPR item->next VAL [\old(c)=0, c=1, item={7:0}, item->next={0:0}, malloc(sizeof *item)={7:0}, plist={9:0}, plist={9:0}] [L523-L525] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L523-L525] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, \old(c)=0, c=1, item={7:0}, item->next={0:0}, malloc(sizeof *item)={7:0}, malloc(sizeof *item)={-1:0}, plist={9:0}, plist={9:0}] [L523-L525] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, \old(c)=0, c=1, item={7:0}, item->next={0:0}, malloc(sizeof *item)={7:0}, malloc(sizeof *item)={-1:0}, plist={9:0}, plist={9:0}] [L526] *plist = item VAL [\old(c)=0, c=1, item={7:0}, malloc(sizeof *item)={7:0}, malloc(sizeof *item)={-1:0}, plist={9:0}, plist={9:0}] [L533] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={9:0}] [L534] length++ VAL [\old(c)=0, c=1, length=1, list={9:0}] [L535] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L536] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={9:0}] [L537] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={9:0}] [L540] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={7:0}, c=1, length=1, list={9:0}] [L540] EXPR list->next VAL [\old(c)=0, \read(*list)={7:0}, c=1, length=1, list={9:0}, list->next={0:0}] [L540] struct item *next = list->next; [L541] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={7:0}, c=1, length=1, list={9:0}, next={0:0}] [L541] free(list) VAL [\old(c)=0, \read(*list)={7:0}, c=1, length=1, list={9:0}, next={0:0}] [L541] free(list) VAL [\old(c)=0, \read(*list)={7:0}, c=1, length=1, list={9:0}, next={0:0}] [L541] free(list) [L542] list = next VAL [\old(c)=0, c=1, length=1, list={9:0}, next={0:0}] [L543] length-- VAL [\old(c)=0, c=1, length=0, list={9:0}, next={0:0}] [L545] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={9:0}, next={0:0}] [L551] return 0; [L530] struct item *list = ((void *)0); [L551] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 114 locations, 44 error locations. Result: UNSAFE, OverallTime: 6.2s, OverallIterations: 17, TraceHistogramMax: 2, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 852 SDtfs, 731 SDslu, 2703 SDs, 0 SdLazy, 3864 SolverSat, 158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 34 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 448 NumberOfCodeBlocks, 448 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 395 ConstructedInterpolants, 13 QuantifiedInterpolants, 93593 SizeOfPredicates, 35 NumberOfNonLiveVariables, 430 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 6/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 18:22:45,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:22:45,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:22:45,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:22:45,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:22:45,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:22:45,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:22:45,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:22:45,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:22:45,638 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:22:45,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:22:45,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:22:45,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:22:45,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:22:45,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:22:45,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:22:45,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:22:45,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:22:45,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:22:45,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:22:45,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:22:45,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:22:45,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:22:45,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:22:45,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:22:45,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:22:45,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:22:45,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:22:45,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:22:45,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:22:45,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:22:45,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:22:45,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:22:45,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:22:45,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:22:45,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:22:45,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:22:45,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:22:45,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:22:45,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:22:45,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:22:45,657 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-12-07 18:22:45,667 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:22:45,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:22:45,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:22:45,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:22:45,668 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:22:45,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:22:45,668 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:22:45,668 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:22:45,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:22:45,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:22:45,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:22:45,669 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 18:22:45,669 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 18:22:45,669 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 18:22:45,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:22:45,669 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 18:22:45,669 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 18:22:45,670 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 18:22:45,670 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:22:45,670 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:22:45,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:22:45,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:22:45,670 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:22:45,670 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:22:45,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:22:45,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:22:45,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:22:45,671 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 18:22:45,671 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 18:22:45,671 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:22:45,671 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 18:22:45,671 INFO L138 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/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 0db1674e58e1126b93b48759a00b2e69f0d5f058 [2019-12-07 18:22:45,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:22:45,843 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:22:45,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:22:45,847 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:22:45,847 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:22:45,848 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-12-07 18:22:45,894 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/data/1422dd271/5aaaf26307e241d4a9693eb3750ff712/FLAG6417ea604 [2019-12-07 18:22:46,260 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:22:46,260 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-12-07 18:22:46,269 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/data/1422dd271/5aaaf26307e241d4a9693eb3750ff712/FLAG6417ea604 [2019-12-07 18:22:46,669 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/data/1422dd271/5aaaf26307e241d4a9693eb3750ff712 [2019-12-07 18:22:46,673 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:22:46,674 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 18:22:46,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:22:46,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:22:46,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:22:46,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:22:46" (1/1) ... [2019-12-07 18:22:46,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e089cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:46, skipping insertion in model container [2019-12-07 18:22:46,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:22:46" (1/1) ... [2019-12-07 18:22:46,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:22:46,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:22:46,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:22:46,885 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:22:46,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:22:46,989 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:22:46,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:46 WrapperNode [2019-12-07 18:22:46,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:22:46,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:22:46,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:22:46,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:22:46,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:46" (1/1) ... [2019-12-07 18:22:47,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:46" (1/1) ... [2019-12-07 18:22:47,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:46" (1/1) ... [2019-12-07 18:22:47,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:46" (1/1) ... [2019-12-07 18:22:47,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:46" (1/1) ... [2019-12-07 18:22:47,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:46" (1/1) ... [2019-12-07 18:22:47,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:46" (1/1) ... [2019-12-07 18:22:47,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:22:47,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:22:47,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:22:47,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:22:47,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:22:47,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 18:22:47,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:22:47,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 18:22:47,078 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 18:22:47,078 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 18:22:47,078 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 18:22:47,078 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 18:22:47,078 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 18:22:47,078 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-12-07 18:22:47,078 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 18:22:47,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 18:22:47,078 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 18:22:47,078 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 18:22:47,078 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 18:22:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 18:22:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 18:22:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 18:22:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 18:22:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 18:22:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 18:22:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 18:22:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 18:22:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 18:22:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 18:22:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 18:22:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 18:22:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 18:22:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 18:22:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 18:22:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 18:22:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 18:22:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 18:22:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 18:22:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 18:22:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 18:22:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 18:22:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 18:22:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 18:22:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 18:22:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 18:22:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 18:22:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 18:22:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 18:22:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 18:22:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 18:22:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 18:22:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 18:22:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 18:22:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 18:22:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 18:22:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 18:22:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 18:22:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 18:22:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 18:22:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 18:22:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 18:22:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 18:22:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 18:22:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 18:22:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 18:22:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 18:22:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 18:22:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 18:22:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 18:22:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 18:22:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 18:22:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 18:22:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 18:22:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 18:22:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 18:22:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 18:22:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 18:22:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 18:22:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 18:22:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 18:22:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 18:22:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 18:22:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 18:22:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 18:22:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 18:22:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 18:22:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 18:22:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 18:22:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 18:22:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 18:22:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 18:22:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 18:22:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 18:22:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 18:22:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 18:22:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 18:22:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 18:22:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 18:22:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 18:22:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 18:22:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 18:22:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 18:22:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 18:22:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 18:22:47,088 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 18:22:47,088 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 18:22:47,088 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 18:22:47,088 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 18:22:47,088 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 18:22:47,088 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 18:22:47,088 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 18:22:47,089 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 18:22:47,089 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 18:22:47,089 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 18:22:47,089 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 18:22:47,089 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 18:22:47,089 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 18:22:47,089 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 18:22:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 18:22:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 18:22:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 18:22:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 18:22:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 18:22:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 18:22:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-12-07 18:22:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:22:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:22:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:22:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 18:22:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:22:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 18:22:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:22:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 18:22:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:22:47,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 18:22:47,522 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:22:47,522 INFO L287 CfgBuilder]: Removed 2 assume(true) statements. [2019-12-07 18:22:47,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:22:47 BoogieIcfgContainer [2019-12-07 18:22:47,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:22:47,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:22:47,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:22:47,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:22:47,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:22:46" (1/3) ... [2019-12-07 18:22:47,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9fff14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:22:47, skipping insertion in model container [2019-12-07 18:22:47,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:46" (2/3) ... [2019-12-07 18:22:47,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9fff14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:22:47, skipping insertion in model container [2019-12-07 18:22:47,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:22:47" (3/3) ... [2019-12-07 18:22:47,528 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2019-12-07 18:22:47,534 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:22:47,539 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2019-12-07 18:22:47,547 INFO L249 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2019-12-07 18:22:47,559 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:22:47,560 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 18:22:47,560 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:22:47,560 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:22:47,560 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:22:47,560 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:22:47,560 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:22:47,560 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:22:47,572 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2019-12-07 18:22:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 18:22:47,578 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:47,579 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:47,579 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:47,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:47,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1838750763, now seen corresponding path program 1 times [2019-12-07 18:22:47,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:22:47,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514777040] [2019-12-07 18:22:47,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 18:22:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:47,686 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:22:47,690 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:47,731 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 18:22:47,731 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:47,736 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:47,737 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:47,737 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:22:47,775 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:47,776 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 18:22:47,777 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:47,796 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 18:22:47,797 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:47,797 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-12-07 18:22:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:47,814 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:22:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:47,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514777040] [2019-12-07 18:22:47,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:47,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 18:22:47,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509831841] [2019-12-07 18:22:47,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:22:47,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:22:47,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:22:47,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:22:47,889 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 8 states. [2019-12-07 18:22:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:48,256 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2019-12-07 18:22:48,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:22:48,258 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-12-07 18:22:48,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:48,265 INFO L225 Difference]: With dead ends: 94 [2019-12-07 18:22:48,265 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 18:22:48,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:22:48,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 18:22:48,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-12-07 18:22:48,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 18:22:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2019-12-07 18:22:48,295 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 9 [2019-12-07 18:22:48,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:48,295 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2019-12-07 18:22:48,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:22:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2019-12-07 18:22:48,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 18:22:48,296 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:48,296 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:48,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 18:22:48,498 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:48,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:48,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1838750764, now seen corresponding path program 1 times [2019-12-07 18:22:48,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:22:48,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926394113] [2019-12-07 18:22:48,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 18:22:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:48,627 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 18:22:48,629 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:48,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 18:22:48,636 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:48,643 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:48,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 18:22:48,646 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:48,652 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:48,652 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:48,653 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 18:22:48,689 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:48,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 18:22:48,690 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:48,700 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:48,704 INFO L377 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 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 18:22:48,704 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:48,719 INFO L614 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2019-12-07 18:22:48,719 INFO L534 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. [2019-12-07 18:22:48,720 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-12-07 18:22:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:48,733 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:22:48,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:22:48,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:48,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926394113] [2019-12-07 18:22:48,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:48,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 18:22:48,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973140469] [2019-12-07 18:22:48,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:22:48,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:22:48,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:22:48,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:22:48,922 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 8 states. [2019-12-07 18:22:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:51,213 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2019-12-07 18:22:51,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:22:51,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-12-07 18:22:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:51,216 INFO L225 Difference]: With dead ends: 125 [2019-12-07 18:22:51,216 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 18:22:51,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:22:51,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 18:22:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 95. [2019-12-07 18:22:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 18:22:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2019-12-07 18:22:51,225 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 9 [2019-12-07 18:22:51,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:51,225 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2019-12-07 18:22:51,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:22:51,226 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2019-12-07 18:22:51,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 18:22:51,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:51,226 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:51,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 18:22:51,428 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:51,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:51,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1166698909, now seen corresponding path program 1 times [2019-12-07 18:22:51,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:22:51,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288761765] [2019-12-07 18:22:51,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 18:22:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:51,533 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:22:51,534 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:51,538 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 18:22:51,538 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:51,540 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:51,540 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:51,540 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:22:51,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:51,543 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:22:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:51,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288761765] [2019-12-07 18:22:51,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:51,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 18:22:51,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301496253] [2019-12-07 18:22:51,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:51,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:22:51,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:51,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:51,549 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 3 states. [2019-12-07 18:22:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:51,646 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-12-07 18:22:51,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:51,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 18:22:51,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:51,647 INFO L225 Difference]: With dead ends: 91 [2019-12-07 18:22:51,647 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 18:22:51,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:51,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 18:22:51,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-12-07 18:22:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 18:22:51,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2019-12-07 18:22:51,653 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 10 [2019-12-07 18:22:51,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:51,653 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2019-12-07 18:22:51,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:51,654 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2019-12-07 18:22:51,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 18:22:51,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:51,654 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:51,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 18:22:51,856 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:51,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:51,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1166698910, now seen corresponding path program 1 times [2019-12-07 18:22:51,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:22:51,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228448411] [2019-12-07 18:22:51,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 18:22:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:51,978 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:22:51,979 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:51,984 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 18:22:51,984 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:51,988 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:51,989 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:51,989 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:22:51,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:51,995 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:22:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:52,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228448411] [2019-12-07 18:22:52,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:52,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 18:22:52,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89692850] [2019-12-07 18:22:52,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:22:52,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:22:52,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:22:52,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:52,029 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 4 states. [2019-12-07 18:22:52,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:52,226 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2019-12-07 18:22:52,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:52,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 18:22:52,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:52,228 INFO L225 Difference]: With dead ends: 87 [2019-12-07 18:22:52,228 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 18:22:52,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:52,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 18:22:52,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-12-07 18:22:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 18:22:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2019-12-07 18:22:52,233 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 10 [2019-12-07 18:22:52,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:52,234 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2019-12-07 18:22:52,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:22:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2019-12-07 18:22:52,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:22:52,234 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:52,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:52,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 18:22:52,436 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:52,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:52,436 INFO L82 PathProgramCache]: Analyzing trace with hash -544296458, now seen corresponding path program 1 times [2019-12-07 18:22:52,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:22:52,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720715837] [2019-12-07 18:22:52,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 18:22:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:52,543 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 18:22:52,544 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:52,615 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 18:22:52,615 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 18:22:52,616 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:52,628 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:52,645 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 18:22:52,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 18:22:52,646 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:52,655 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:52,656 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:52,656 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:37 [2019-12-07 18:22:52,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 18:22:52,690 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:52,697 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:52,699 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 18:22:52,699 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:52,702 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:52,702 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:52,702 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-12-07 18:22:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:52,715 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:22:52,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:52,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720715837] [2019-12-07 18:22:52,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:52,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 9 [2019-12-07 18:22:52,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149650202] [2019-12-07 18:22:52,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:22:52,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:22:52,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:22:52,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:22:52,737 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand 9 states. [2019-12-07 18:22:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:53,280 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-12-07 18:22:53,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:22:53,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-07 18:22:53,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:53,282 INFO L225 Difference]: With dead ends: 99 [2019-12-07 18:22:53,282 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 18:22:53,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:22:53,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 18:22:53,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2019-12-07 18:22:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 18:22:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2019-12-07 18:22:53,289 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 15 [2019-12-07 18:22:53,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:53,289 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2019-12-07 18:22:53,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:22:53,289 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2019-12-07 18:22:53,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:22:53,290 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:53,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:53,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 18:22:53,493 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:53,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:53,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1237872333, now seen corresponding path program 1 times [2019-12-07 18:22:53,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:22:53,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106363554] [2019-12-07 18:22:53,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 18:22:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:53,645 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:22:53,647 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:53,656 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:22:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:53,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106363554] [2019-12-07 18:22:53,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:53,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:22:53,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903717711] [2019-12-07 18:22:53,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:22:53,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:22:53,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:22:53,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:22:53,674 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 6 states. [2019-12-07 18:22:53,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:53,739 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-12-07 18:22:53,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:22:53,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 18:22:53,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:53,742 INFO L225 Difference]: With dead ends: 140 [2019-12-07 18:22:53,742 INFO L226 Difference]: Without dead ends: 140 [2019-12-07 18:22:53,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:22:53,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-07 18:22:53,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 98. [2019-12-07 18:22:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 18:22:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2019-12-07 18:22:53,749 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 24 [2019-12-07 18:22:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:53,750 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2019-12-07 18:22:53,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:22:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2019-12-07 18:22:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:22:53,750 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:53,750 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:53,951 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 18:22:53,952 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:53,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:53,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1239095717, now seen corresponding path program 1 times [2019-12-07 18:22:53,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:22:53,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013473394] [2019-12-07 18:22:53,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 18:22:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:54,106 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:22:54,107 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:54,129 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:22:54,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:54,133 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:54,134 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:54,134 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 18:22:54,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 18:22:54,150 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:54,151 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:54,151 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:54,152 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:7 [2019-12-07 18:22:54,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:54,160 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:22:54,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2019-12-07 18:22:54,221 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:54,239 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:54,240 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:54,240 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-12-07 18:22:54,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:22:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:54,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013473394] [2019-12-07 18:22:54,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:54,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2019-12-07 18:22:54,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524612204] [2019-12-07 18:22:54,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:22:54,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:22:54,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:22:54,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:22:54,303 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand 8 states. [2019-12-07 18:22:54,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:54,615 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2019-12-07 18:22:54,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:22:54,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-07 18:22:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:54,616 INFO L225 Difference]: With dead ends: 106 [2019-12-07 18:22:54,616 INFO L226 Difference]: Without dead ends: 106 [2019-12-07 18:22:54,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:22:54,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-12-07 18:22:54,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2019-12-07 18:22:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 18:22:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2019-12-07 18:22:54,620 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 24 [2019-12-07 18:22:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:54,620 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2019-12-07 18:22:54,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:22:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2019-12-07 18:22:54,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:22:54,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:54,621 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:54,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 18:22:54,823 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:54,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:54,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1239095716, now seen corresponding path program 1 times [2019-12-07 18:22:54,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:22:54,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846500722] [2019-12-07 18:22:54,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 18:22:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:54,979 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 18:22:54,980 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:55,011 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:22:55,012 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:55,023 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:55,027 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:22:55,027 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:55,037 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:55,038 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:55,038 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2019-12-07 18:22:55,078 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 18:22:55,079 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:55,088 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:55,091 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 18:22:55,091 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:55,097 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:55,098 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:55,098 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2019-12-07 18:22:55,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:55,118 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:22:55,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2019-12-07 18:22:55,456 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 18:22:55,481 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:55,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:22:55,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:22:55,485 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:55,503 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:55,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:22:55,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:22:55,507 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:55,523 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:55,523 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 18:22:55,523 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:19 [2019-12-07 18:22:55,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:22:55,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 18:22:55,607 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:55,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 18:22:55,619 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:55,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-12-07 18:22:55,633 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:55,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 18:22:55,647 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:55,695 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:55,696 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-12-07 18:22:55,696 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:45 [2019-12-07 18:22:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:55,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846500722] [2019-12-07 18:22:55,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:55,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 18:22:55,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677158315] [2019-12-07 18:22:55,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:22:55,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:22:55,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:22:55,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:22:55,853 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand 12 states. [2019-12-07 18:22:56,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:56,872 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2019-12-07 18:22:56,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:22:56,873 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-12-07 18:22:56,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:56,874 INFO L225 Difference]: With dead ends: 108 [2019-12-07 18:22:56,874 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 18:22:56,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:22:56,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 18:22:56,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2019-12-07 18:22:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 18:22:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2019-12-07 18:22:56,878 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 24 [2019-12-07 18:22:56,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:56,878 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2019-12-07 18:22:56,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:22:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2019-12-07 18:22:56,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:22:56,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:56,879 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:57,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 18:22:57,080 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:57,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:57,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1343445713, now seen corresponding path program 1 times [2019-12-07 18:22:57,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:22:57,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037346397] [2019-12-07 18:22:57,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 18:22:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:57,256 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:22:57,257 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:57,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:22:57,268 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:57,270 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:57,270 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:57,270 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 18:22:57,282 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 18:22:57,283 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:57,284 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:57,284 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:57,284 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 18:22:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:57,290 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:22:57,349 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-12-07 18:22:57,350 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 18:22:57,355 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:57,356 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 18:22:57,356 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-12-07 18:22:57,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:57,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037346397] [2019-12-07 18:22:57,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:57,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 18:22:57,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119990500] [2019-12-07 18:22:57,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:22:57,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:22:57,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:22:57,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:22:57,361 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand 6 states. [2019-12-07 18:22:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:57,551 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2019-12-07 18:22:57,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:22:57,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 18:22:57,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:57,552 INFO L225 Difference]: With dead ends: 107 [2019-12-07 18:22:57,552 INFO L226 Difference]: Without dead ends: 107 [2019-12-07 18:22:57,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:22:57,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-07 18:22:57,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2019-12-07 18:22:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 18:22:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2019-12-07 18:22:57,556 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 27 [2019-12-07 18:22:57,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:57,556 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2019-12-07 18:22:57,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:22:57,556 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2019-12-07 18:22:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:22:57,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:57,557 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:57,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 18:22:57,758 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:57,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:57,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1302855748, now seen corresponding path program 1 times [2019-12-07 18:22:57,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:22:57,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861086277] [2019-12-07 18:22:57,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 18:22:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:57,911 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 18:22:57,913 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:57,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:22:57,943 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:57,951 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:57,951 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:57,951 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2019-12-07 18:22:57,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 18:22:57,987 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:57,992 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:57,993 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:57,993 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2019-12-07 18:22:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:58,010 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:22:58,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-12-07 18:22:58,146 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:58,169 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:58,169 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:58,169 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:24 [2019-12-07 18:22:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:58,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861086277] [2019-12-07 18:22:58,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:58,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-12-07 18:22:58,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172251720] [2019-12-07 18:22:58,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:22:58,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:22:58,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:22:58,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:22:58,239 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand 11 states. [2019-12-07 18:22:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:58,727 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2019-12-07 18:22:58,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:22:58,728 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-12-07 18:22:58,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:58,728 INFO L225 Difference]: With dead ends: 106 [2019-12-07 18:22:58,728 INFO L226 Difference]: Without dead ends: 106 [2019-12-07 18:22:58,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:22:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-12-07 18:22:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2019-12-07 18:22:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 18:22:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2019-12-07 18:22:58,731 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 28 [2019-12-07 18:22:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:58,732 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2019-12-07 18:22:58,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:22:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2019-12-07 18:22:58,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:22:58,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:58,733 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:58,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 18:22:58,934 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:22:58,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:58,934 INFO L82 PathProgramCache]: Analyzing trace with hash -988227321, now seen corresponding path program 1 times [2019-12-07 18:22:58,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:22:58,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918308765] [2019-12-07 18:22:58,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 18:22:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:59,054 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 18:22:59,055 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:59,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:22:59,077 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:59,081 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:59,082 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:59,082 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 18:22:59,111 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:59,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 46 [2019-12-07 18:22:59,112 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:59,128 INFO L614 ElimStorePlain]: treesize reduction 26, result has 36.6 percent of original size [2019-12-07 18:22:59,128 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:59,128 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:15 [2019-12-07 18:22:59,178 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 18:22:59,179 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2019-12-07 18:22:59,179 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:59,186 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:59,187 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:59,187 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-12-07 18:22:59,212 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-12-07 18:22:59,213 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:59,216 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:59,217 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:59,217 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:13 [2019-12-07 18:22:59,239 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:59,239 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:22:59,363 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2019-12-07 18:22:59,364 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:59,380 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:59,380 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:22:59,381 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-12-07 18:22:59,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:22:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:59,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918308765] [2019-12-07 18:22:59,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:22:59,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-12-07 18:22:59,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620206825] [2019-12-07 18:22:59,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 18:22:59,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:22:59,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 18:22:59,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:22:59,462 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand 14 states. [2019-12-07 18:23:00,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:00,253 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2019-12-07 18:23:00,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:23:00,254 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-12-07 18:23:00,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:00,254 INFO L225 Difference]: With dead ends: 109 [2019-12-07 18:23:00,254 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 18:23:00,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:23:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 18:23:00,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2019-12-07 18:23:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 18:23:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2019-12-07 18:23:00,257 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 29 [2019-12-07 18:23:00,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:00,257 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2019-12-07 18:23:00,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 18:23:00,258 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2019-12-07 18:23:00,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:23:00,258 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:00,258 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:00,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 18:23:00,459 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:23:00,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:00,460 INFO L82 PathProgramCache]: Analyzing trace with hash -988227320, now seen corresponding path program 1 times [2019-12-07 18:23:00,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:23:00,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4478702] [2019-12-07 18:23:00,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 18:23:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:00,648 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 18:23:00,650 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:23:00,656 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 18:23:00,656 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:00,667 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:00,669 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 18:23:00,670 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:00,679 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:00,680 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:00,680 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2019-12-07 18:23:00,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:23:00,699 INFO L377 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 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 18:23:00,699 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:00,714 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:00,722 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:00,722 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 18:23:00,722 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:00,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:00,735 INFO L534 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. [2019-12-07 18:23:00,735 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2019-12-07 18:23:00,786 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:23:00,786 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:00,806 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:00,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:23:00,811 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:00,825 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:00,825 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:00,826 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:45 [2019-12-07 18:23:00,911 INFO L430 ElimStorePlain]: Different costs {1=[|v_#valid_153|], 3=[|v_#length_100|]} [2019-12-07 18:23:00,922 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:00,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-12-07 18:23:00,923 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:00,938 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:00,953 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:00,953 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 44 [2019-12-07 18:23:00,954 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:00,991 INFO L614 ElimStorePlain]: treesize reduction 14, result has 75.4 percent of original size [2019-12-07 18:23:00,992 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:00,992 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:43 [2019-12-07 18:23:01,102 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 18:23:01,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-12-07 18:23:01,102 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:01,120 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:01,137 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 18:23:01,137 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 18:23:01,137 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:01,151 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:01,151 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:01,152 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:52 [2019-12-07 18:23:01,202 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:01,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2019-12-07 18:23:01,203 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:01,217 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:01,225 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:01,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-12-07 18:23:01,226 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:01,232 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:01,233 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:01,233 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:66, output treesize:20 [2019-12-07 18:23:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:01,276 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:23:01,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:02,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2019-12-07 18:23:02,410 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 18:23:02,466 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:02,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2019-12-07 18:23:02,474 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:02,556 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:02,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2019-12-07 18:23:02,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:02,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:02,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:02,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:02,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:02,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:02,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:02,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:02,567 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:02,765 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-07 18:23:02,765 INFO L614 ElimStorePlain]: treesize reduction 56, result has 54.1 percent of original size [2019-12-07 18:23:02,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:02,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:02,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:02,767 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-12-07 18:23:02,767 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:80, output treesize:66 [2019-12-07 18:23:02,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:02,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:02,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:02,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:02,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:02,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:03,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:03,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:03,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:03,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:03,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:03,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:03,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:03,196 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:03,196 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 18:23:03,196 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:03,217 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:03,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 18:23:03,218 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:03,239 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:03,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 18:23:03,239 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:03,270 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:03,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 18:23:03,271 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:03,288 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:03,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 18:23:03,288 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:03,455 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-12-07 18:23:03,455 INFO L614 ElimStorePlain]: treesize reduction 24, result has 73.9 percent of original size [2019-12-07 18:23:03,456 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-12-07 18:23:03,456 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:137, output treesize:64 [2019-12-07 18:23:03,806 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 22 [2019-12-07 18:23:03,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:23:04,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:04,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:04,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:04,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:04,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:04,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:04,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:04,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:04,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:04,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:04,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:04,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:04,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4478702] [2019-12-07 18:23:04,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:23:04,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2019-12-07 18:23:04,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140649257] [2019-12-07 18:23:04,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 18:23:04,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:23:04,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 18:23:04,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:23:04,760 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 19 states. [2019-12-07 18:23:05,741 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2019-12-07 18:23:05,903 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 42 [2019-12-07 18:23:06,348 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2019-12-07 18:23:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:08,680 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-12-07 18:23:08,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:23:08,681 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2019-12-07 18:23:08,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:08,682 INFO L225 Difference]: With dead ends: 111 [2019-12-07 18:23:08,682 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 18:23:08,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:23:08,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 18:23:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2019-12-07 18:23:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 18:23:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2019-12-07 18:23:08,685 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 29 [2019-12-07 18:23:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:08,685 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2019-12-07 18:23:08,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 18:23:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2019-12-07 18:23:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:23:08,686 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:08,686 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:08,887 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 18:23:08,888 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:23:08,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:08,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1733822413, now seen corresponding path program 1 times [2019-12-07 18:23:08,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:23:08,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944382739] [2019-12-07 18:23:08,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 18:23:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:09,065 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:23:09,066 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:23:09,083 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:23:09,083 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:09,087 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:09,087 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:09,088 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 18:23:09,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-12-07 18:23:09,102 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:09,103 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:09,104 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:09,104 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2019-12-07 18:23:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:09,112 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:23:09,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2019-12-07 18:23:09,166 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:09,183 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:09,183 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:09,183 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-12-07 18:23:09,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:23:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:09,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944382739] [2019-12-07 18:23:09,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:09,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2019-12-07 18:23:09,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716515338] [2019-12-07 18:23:09,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:23:09,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:23:09,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:23:09,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:23:09,241 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand 8 states. [2019-12-07 18:23:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:09,563 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2019-12-07 18:23:09,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:23:09,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-07 18:23:09,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:09,564 INFO L225 Difference]: With dead ends: 105 [2019-12-07 18:23:09,564 INFO L226 Difference]: Without dead ends: 105 [2019-12-07 18:23:09,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:23:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-12-07 18:23:09,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2019-12-07 18:23:09,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 18:23:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2019-12-07 18:23:09,567 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 29 [2019-12-07 18:23:09,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:09,567 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2019-12-07 18:23:09,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:23:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2019-12-07 18:23:09,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:23:09,568 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:09,568 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:09,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 18:23:09,769 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:23:09,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:09,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2086080159, now seen corresponding path program 1 times [2019-12-07 18:23:09,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:23:09,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782442148] [2019-12-07 18:23:09,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 18:23:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:09,882 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 18:23:09,883 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:23:09,886 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 18:23:09,886 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:09,888 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:09,888 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:09,888 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:23:09,909 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:23:09,909 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:09,915 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:09,915 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:09,915 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-12-07 18:23:09,932 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:09,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 18:23:09,932 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:09,936 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:09,936 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:09,936 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-12-07 18:23:09,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-12-07 18:23:09,950 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:09,954 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:09,954 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:09,954 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2019-12-07 18:23:09,968 INFO L377 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 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 18:23:09,968 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:09,975 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-07 18:23:09,976 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:09,976 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-12-07 18:23:09,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:09,991 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:23:10,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:10,083 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-12-07 18:23:10,083 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:10,085 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-12-07 18:23:10,085 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:10,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:10,086 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:10,086 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:6 [2019-12-07 18:23:10,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:10,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-12-07 18:23:10,111 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:10,119 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:10,120 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-12-07 18:23:10,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:10,120 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:10,142 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:10,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:23:10,146 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-12-07 18:23:10,146 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-12-07 18:23:10,175 INFO L614 ElimStorePlain]: treesize reduction 5, result has 85.7 percent of original size [2019-12-07 18:23:10,175 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 18:23:10,176 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:54, output treesize:30 [2019-12-07 18:23:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:10,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782442148] [2019-12-07 18:23:10,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:10,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 11 [2019-12-07 18:23:10,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450567982] [2019-12-07 18:23:10,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:23:10,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:23:10,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:23:10,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:23:10,222 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand 12 states. [2019-12-07 18:23:14,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:14,828 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2019-12-07 18:23:14,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:23:14,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-12-07 18:23:14,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:14,829 INFO L225 Difference]: With dead ends: 118 [2019-12-07 18:23:14,829 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 18:23:14,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:23:14,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 18:23:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 95. [2019-12-07 18:23:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 18:23:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-12-07 18:23:14,832 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 30 [2019-12-07 18:23:14,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:14,832 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-12-07 18:23:14,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:23:14,833 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-12-07 18:23:14,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:23:14,833 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:14,833 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:15,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 18:23:15,034 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:23:15,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:15,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2086080160, now seen corresponding path program 1 times [2019-12-07 18:23:15,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:23:15,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202890633] [2019-12-07 18:23:15,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 18:23:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:15,127 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:23:15,128 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:23:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:15,142 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:23:15,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:15,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 18:23:15,177 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:15,192 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:15,193 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:15,193 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2019-12-07 18:23:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:15,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202890633] [2019-12-07 18:23:15,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:15,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 18:23:15,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491249709] [2019-12-07 18:23:15,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:23:15,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:23:15,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:23:15,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:23:15,226 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 6 states. [2019-12-07 18:23:15,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:15,345 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2019-12-07 18:23:15,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:23:15,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-07 18:23:15,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:15,346 INFO L225 Difference]: With dead ends: 92 [2019-12-07 18:23:15,346 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 18:23:15,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:23:15,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 18:23:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2019-12-07 18:23:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 18:23:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2019-12-07 18:23:15,349 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 30 [2019-12-07 18:23:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:15,349 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2019-12-07 18:23:15,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:23:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2019-12-07 18:23:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:23:15,349 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:15,349 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:15,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 18:23:15,550 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 18:23:15,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:15,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1190830857, now seen corresponding path program 1 times [2019-12-07 18:23:15,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:23:15,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116754282] [2019-12-07 18:23:15,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87319ce6-c219-4784-acda-881f11441cde/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 18:23:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:23:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:23:15,776 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 18:23:15,777 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:23:15,977 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 18:23:16,003 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-12-07 18:23:16,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:23:16 BoogieIcfgContainer [2019-12-07 18:23:16,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:23:16,016 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:23:16,016 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:23:16,016 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:23:16,017 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:22:47" (3/4) ... [2019-12-07 18:23:16,019 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 18:23:16,019 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:23:16,020 INFO L168 Benchmark]: Toolchain (without parser) took 29346.04 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -128.1 MB). Peak memory consumption was 195.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:23:16,020 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:23:16,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -147.7 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:23:16,020 INFO L168 Benchmark]: Boogie Preprocessor took 45.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:23:16,021 INFO L168 Benchmark]: RCFGBuilder took 487.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:23:16,021 INFO L168 Benchmark]: TraceAbstraction took 28492.09 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 203.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -45.8 MB). Peak memory consumption was 158.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:23:16,021 INFO L168 Benchmark]: Witness Printer took 2.84 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:23:16,022 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -147.7 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 487.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28492.09 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 203.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -45.8 MB). Peak memory consumption was 158.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.84 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 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: 528]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 528. Possible FailurePath: [L513] int c = 0; VAL [\old(c)=5, c=0] [L530] struct item *list = ((void *)0); [L531] int length = 0; VAL [\old(c)=0, c=0, length=0, list={15:0}] [L533] CALL append(&list) VAL [\old(c)=0, c=0, plist={15:0}] [L520] c++ [L521] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={1:0}, malloc(sizeof *item)={1:0}, plist={15:0}, plist={15:0}] [L522] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={1:0}, malloc(sizeof *item)={1:0}, plist={15:0}, plist={15:0}] [L522] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={1:0}, malloc(sizeof *item)={1:0}, plist={15:0}, plist={15:0}] [L523] EXPR item->next VAL [\old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, plist={15:0}, plist={15:0}] [L523-L525] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L523-L525] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={3:0}, \old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={3:0}, malloc(sizeof *item)={1:0}, plist={15:0}, plist={15:0}] [L523-L525] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={3:0}, \old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={3:0}, malloc(sizeof *item)={1:0}, plist={15:0}, plist={15:0}] [L526] *plist = item VAL [\old(c)=0, c=1, item={1:0}, malloc(sizeof *item)={3:0}, malloc(sizeof *item)={1:0}, plist={15:0}, plist={15:0}] [L533] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={15:0}] [L534] length++ VAL [\old(c)=0, c=1, length=1, list={15:0}] [L535] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L536] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={15:0}] [L537] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={15:0}] [L540] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={15:0}] [L540] EXPR list->next VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={15:0}, list->next={0:0}] [L540] struct item *next = list->next; [L541] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={15:0}, next={0:0}] [L541] free(list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={15:0}, next={0:0}] [L541] free(list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={15:0}, next={0:0}] [L541] free(list) [L542] list = next VAL [\old(c)=0, c=1, length=1, list={15:0}, next={0:0}] [L543] length-- VAL [\old(c)=0, c=1, length=0, list={15:0}, next={0:0}] [L545] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={15:0}, next={0:0}] [L551] return 0; [L530] struct item *list = ((void *)0); [L551] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 119 locations, 44 error locations. Result: UNSAFE, OverallTime: 28.4s, OverallIterations: 16, TraceHistogramMax: 2, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 879 SDtfs, 1078 SDslu, 3395 SDs, 0 SdLazy, 3069 SolverSat, 156 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 681 GetRequests, 518 SyntacticMatches, 17 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 186 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 361 NumberOfCodeBlocks, 361 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 624 ConstructedInterpolants, 51 QuantifiedInterpolants, 153165 SizeOfPredicates, 154 NumberOfNonLiveVariables, 1719 ConjunctsInSsa, 171 ConjunctsInUnsatCore, 30 InterpolantComputations, 26 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...