./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/960521-1_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b5699aa 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_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/960521-1_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9f95b6c839057502038c8f9c89c369852ea0865 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:46:58,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:46:58,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:46:58,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:46:58,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:46:58,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:46:58,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:46:58,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:46:58,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:46:58,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:46:58,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:46:58,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:46:58,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:46:58,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:46:58,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:46:58,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:46:58,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:46:58,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:46:58,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:46:58,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:46:58,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:46:58,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:46:58,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:46:58,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:46:58,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:46:58,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:46:58,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:46:58,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:46:58,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:46:58,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:46:58,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:46:58,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:46:58,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:46:58,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:46:58,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:46:58,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:46:58,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:46:58,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:46:58,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:46:58,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:46:58,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:46:58,662 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-11-26 02:46:58,674 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:46:58,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:46:58,675 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:46:58,675 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:46:58,676 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:46:58,676 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:46:58,676 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:46:58,676 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:46:58,676 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:46:58,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 02:46:58,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 02:46:58,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:46:58,678 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:46:58,678 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 02:46:58,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:46:58,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:46:58,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:46:58,678 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 02:46:58,679 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 02:46:58,679 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 02:46:58,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:46:58,679 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:46:58,679 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:46:58,679 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:46:58,680 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:46:58,680 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:46:58,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:46:58,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:46:58,680 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:46:58,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:46:58,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:46:58,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:46:58,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:46:58,681 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:46:58,682 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:46:58,682 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:46:58,682 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_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan 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 -> Taipan 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 -> e9f95b6c839057502038c8f9c89c369852ea0865 [2019-11-26 02:46:58,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:46:58,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:46:58,827 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:46:58,832 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:46:58,833 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:46:58,833 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/../../sv-benchmarks/c/list-ext-properties/960521-1_1-1.i [2019-11-26 02:46:58,891 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/data/69e8adced/e715de999c294f83b96ddbbde134da27/FLAG65414522e [2019-11-26 02:46:59,317 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:46:59,318 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/sv-benchmarks/c/list-ext-properties/960521-1_1-1.i [2019-11-26 02:46:59,339 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/data/69e8adced/e715de999c294f83b96ddbbde134da27/FLAG65414522e [2019-11-26 02:46:59,613 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/data/69e8adced/e715de999c294f83b96ddbbde134da27 [2019-11-26 02:46:59,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:46:59,617 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:46:59,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:46:59,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:46:59,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:46:59,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:46:59" (1/1) ... [2019-11-26 02:46:59,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58427f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:46:59, skipping insertion in model container [2019-11-26 02:46:59,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:46:59" (1/1) ... [2019-11-26 02:46:59,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:46:59,663 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:47:00,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:47:00,024 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:47:00,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:47:00,161 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:47:00,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:00 WrapperNode [2019-11-26 02:47:00,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:47:00,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:47:00,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:47:00,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:47:00,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:00" (1/1) ... [2019-11-26 02:47:00,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:00" (1/1) ... [2019-11-26 02:47:00,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:47:00,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:47:00,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:47:00,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:47:00,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:00" (1/1) ... [2019-11-26 02:47:00,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:00" (1/1) ... [2019-11-26 02:47:00,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:00" (1/1) ... [2019-11-26 02:47:00,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:00" (1/1) ... [2019-11-26 02:47:00,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:00" (1/1) ... [2019-11-26 02:47:00,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:00" (1/1) ... [2019-11-26 02:47:00,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:00" (1/1) ... [2019-11-26 02:47:00,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:47:00,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:47:00,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:47:00,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:47:00,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/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-11-26 02:47:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-26 02:47:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:47:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:47:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-26 02:47:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:47:00,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:47:00,723 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:47:00,724 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-26 02:47:00,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:47:00 BoogieIcfgContainer [2019-11-26 02:47:00,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:47:00,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:47:00,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:47:00,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:47:00,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:46:59" (1/3) ... [2019-11-26 02:47:00,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70fe6282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:47:00, skipping insertion in model container [2019-11-26 02:47:00,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:00" (2/3) ... [2019-11-26 02:47:00,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70fe6282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:47:00, skipping insertion in model container [2019-11-26 02:47:00,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:47:00" (3/3) ... [2019-11-26 02:47:00,733 INFO L109 eAbstractionObserver]: Analyzing ICFG 960521-1_1-1.i [2019-11-26 02:47:00,740 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:47:00,745 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2019-11-26 02:47:00,753 INFO L249 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2019-11-26 02:47:00,770 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:47:00,770 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 02:47:00,770 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:47:00,771 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:47:00,771 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:47:00,771 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:47:00,771 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:47:00,771 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:47:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-11-26 02:47:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-26 02:47:00,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:00,792 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-26 02:47:00,793 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:47:00,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:00,797 INFO L82 PathProgramCache]: Analyzing trace with hash 28697864, now seen corresponding path program 1 times [2019-11-26 02:47:00,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:47:00,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [892270842] [2019-11-26 02:47:00,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:00,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:47:00,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:47:00,989 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:47:00,990 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 02:47:00,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:01,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:01,003 INFO L496 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-11-26 02:47:01,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-26 02:47:01,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:01,024 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:47:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:01,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [892270842] [2019-11-26 02:47:01,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:47:01,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 02:47:01,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035392317] [2019-11-26 02:47:01,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:47:01,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:47:01,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:47:01,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:47:01,053 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2019-11-26 02:47:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:47:01,158 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-11-26 02:47:01,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:47:01,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-26 02:47:01,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:47:01,176 INFO L225 Difference]: With dead ends: 51 [2019-11-26 02:47:01,176 INFO L226 Difference]: Without dead ends: 49 [2019-11-26 02:47:01,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-11-26 02:47:01,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-26 02:47:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-26 02:47:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-26 02:47:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-11-26 02:47:01,217 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 5 [2019-11-26 02:47:01,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:47:01,218 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-11-26 02:47:01,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:47:01,218 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-11-26 02:47:01,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-26 02:47:01,218 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:01,218 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-26 02:47:01,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:01,421 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:47:01,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:01,422 INFO L82 PathProgramCache]: Analyzing trace with hash 28697865, now seen corresponding path program 1 times [2019-11-26 02:47:01,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:47:01,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1899529345] [2019-11-26 02:47:01,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:01,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:47:01,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:47:01,532 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:47:01,533 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 02:47:01,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:01,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:01,556 INFO L496 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-11-26 02:47:01,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-11-26 02:47:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:01,586 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:47:01,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:01,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1899529345] [2019-11-26 02:47:01,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:47:01,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-26 02:47:01,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570630534] [2019-11-26 02:47:01,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:47:01,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:47:01,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:47:01,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:47:01,653 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2019-11-26 02:47:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:47:01,945 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2019-11-26 02:47:01,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:47:01,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-11-26 02:47:01,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:47:01,953 INFO L225 Difference]: With dead ends: 141 [2019-11-26 02:47:01,954 INFO L226 Difference]: Without dead ends: 141 [2019-11-26 02:47:01,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:47:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-26 02:47:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 53. [2019-11-26 02:47:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-26 02:47:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-11-26 02:47:01,975 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 5 [2019-11-26 02:47:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:47:01,976 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-11-26 02:47:01,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:47:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-11-26 02:47:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:47:01,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:01,978 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-11-26 02:47:02,178 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:02,183 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:47:02,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:02,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1810564201, now seen corresponding path program 1 times [2019-11-26 02:47:02,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:47:02,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [608919904] [2019-11-26 02:47:02,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:02,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 02:47:02,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:47:02,321 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:47:02,321 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 02:47:02,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:02,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:02,338 INFO L496 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-11-26 02:47:02,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-11-26 02:47:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:02,370 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:47:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:02,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [608919904] [2019-11-26 02:47:02,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576221573] [2019-11-26 02:47:02,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:47:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:02,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 02:47:02,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:47:02,621 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:47:02,621 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 02:47:02,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:02,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:02,631 INFO L496 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-11-26 02:47:02,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-11-26 02:47:02,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:02,632 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:47:02,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:02,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:47:02,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5] total 9 [2019-11-26 02:47:02,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488658353] [2019-11-26 02:47:02,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:47:02,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:47:02,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:47:02,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:47:02,640 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 10 states. [2019-11-26 02:47:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:47:03,723 INFO L93 Difference]: Finished difference Result 325 states and 346 transitions. [2019-11-26 02:47:03,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-26 02:47:03,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-11-26 02:47:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:47:03,728 INFO L225 Difference]: With dead ends: 325 [2019-11-26 02:47:03,729 INFO L226 Difference]: Without dead ends: 325 [2019-11-26 02:47:03,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-11-26 02:47:03,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-11-26 02:47:03,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 57. [2019-11-26 02:47:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-26 02:47:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-11-26 02:47:03,743 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 7 [2019-11-26 02:47:03,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:47:03,743 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-11-26 02:47:03,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:47:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-11-26 02:47:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:47:03,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:03,744 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:47:04,145 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:47:04,145 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:47:04,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:04,146 INFO L82 PathProgramCache]: Analyzing trace with hash 239563854, now seen corresponding path program 1 times [2019-11-26 02:47:04,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:47:04,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [816602044] [2019-11-26 02:47:04,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:04,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:47:04,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:47:04,246 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:47:04,246 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 02:47:04,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:04,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:04,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:47:04,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:11 [2019-11-26 02:47:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:04,288 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:47:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:04,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [816602044] [2019-11-26 02:47:04,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:47:04,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-26 02:47:04,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320774209] [2019-11-26 02:47:04,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:47:04,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:47:04,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:47:04,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:47:04,316 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 5 states. [2019-11-26 02:47:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:47:04,391 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-11-26 02:47:04,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:47:04,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-11-26 02:47:04,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:47:04,395 INFO L225 Difference]: With dead ends: 54 [2019-11-26 02:47:04,395 INFO L226 Difference]: Without dead ends: 54 [2019-11-26 02:47:04,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:47:04,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-26 02:47:04,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-26 02:47:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-26 02:47:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-11-26 02:47:04,401 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 8 [2019-11-26 02:47:04,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:47:04,401 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-11-26 02:47:04,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:47:04,401 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-11-26 02:47:04,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:47:04,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:04,402 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:47:04,608 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:04,608 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:47:04,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:04,609 INFO L82 PathProgramCache]: Analyzing trace with hash 239563855, now seen corresponding path program 1 times [2019-11-26 02:47:04,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:47:04,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [765567170] [2019-11-26 02:47:04,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:04,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 02:47:04,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:47:04,721 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_20|], 1=[|v_#valid_36|]} [2019-11-26 02:47:04,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:47:04,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 02:47:04,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:04,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:04,763 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 10 treesize of output 8 [2019-11-26 02:47:04,764 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:04,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:04,777 INFO L496 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-11-26 02:47:04,777 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-11-26 02:47:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:04,842 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:47:04,970 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-26 02:47:04,975 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 10 treesize of output 8 [2019-11-26 02:47:04,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:04,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:04,985 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:47:04,989 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:04,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:04,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:47:04,997 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-11-26 02:47:05,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:05,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [765567170] [2019-11-26 02:47:05,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:47:05,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-26 02:47:05,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393745966] [2019-11-26 02:47:05,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:47:05,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:47:05,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:47:05,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:47:05,018 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 8 states. [2019-11-26 02:47:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:47:05,962 INFO L93 Difference]: Finished difference Result 172 states and 186 transitions. [2019-11-26 02:47:05,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:47:05,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-11-26 02:47:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:47:05,965 INFO L225 Difference]: With dead ends: 172 [2019-11-26 02:47:05,965 INFO L226 Difference]: Without dead ends: 172 [2019-11-26 02:47:05,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-26 02:47:05,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-26 02:47:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 73. [2019-11-26 02:47:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-26 02:47:05,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2019-11-26 02:47:05,973 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 8 [2019-11-26 02:47:05,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:47:05,973 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2019-11-26 02:47:05,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:47:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2019-11-26 02:47:05,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:47:05,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:05,975 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:47:06,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:06,177 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:47:06,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:06,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1976198929, now seen corresponding path program 1 times [2019-11-26 02:47:06,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:47:06,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1101153839] [2019-11-26 02:47:06,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:06,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 02:47:06,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:47:06,299 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_38|]} [2019-11-26 02:47:06,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:47:06,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 02:47:06,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:06,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:06,322 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 10 treesize of output 8 [2019-11-26 02:47:06,322 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:06,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:06,333 INFO L496 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-11-26 02:47:06,333 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-11-26 02:47:06,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:06,382 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:47:06,556 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-26 02:47:06,570 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 10 treesize of output 8 [2019-11-26 02:47:06,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:06,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:06,581 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:47:06,582 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:06,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:06,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:47:06,591 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-11-26 02:47:06,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:06,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1101153839] [2019-11-26 02:47:06,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967129415] [2019-11-26 02:47:06,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:47:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:06,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-26 02:47:06,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:47:06,771 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_40|]} [2019-11-26 02:47:06,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:47:06,780 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 02:47:06,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:06,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:06,801 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 10 treesize of output 8 [2019-11-26 02:47:06,801 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:06,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:06,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:47:06,813 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-11-26 02:47:06,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:06,915 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:47:07,173 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-11-26 02:47:07,180 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-26 02:47:07,184 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:47:07,189 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-26 02:47:07,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:07,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:07,191 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-26 02:47:07,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:47:07,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:1 [2019-11-26 02:47:07,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-26 02:47:07,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:47:07,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 6, 7] total 13 [2019-11-26 02:47:07,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183205745] [2019-11-26 02:47:07,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:47:07,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:47:07,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:47:07,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-11-26 02:47:07,195 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand 5 states. [2019-11-26 02:47:07,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:47:07,827 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2019-11-26 02:47:07,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:47:07,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-26 02:47:07,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:47:07,830 INFO L225 Difference]: With dead ends: 110 [2019-11-26 02:47:07,830 INFO L226 Difference]: Without dead ends: 110 [2019-11-26 02:47:07,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:47:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-26 02:47:07,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 70. [2019-11-26 02:47:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-26 02:47:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2019-11-26 02:47:07,837 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 10 [2019-11-26 02:47:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:47:07,838 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2019-11-26 02:47:07,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:47:07,838 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2019-11-26 02:47:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 02:47:07,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:07,839 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:47:08,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:08,244 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:47:08,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:08,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1388869610, now seen corresponding path program 1 times [2019-11-26 02:47:08,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:47:08,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1968805259] [2019-11-26 02:47:08,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:08,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:47:08,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:47:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:08,370 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:47:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:08,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1968805259] [2019-11-26 02:47:08,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523952250] [2019-11-26 02:47:08,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:47:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:08,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:47:08,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:47:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:08,479 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:47:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:08,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:47:08,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5] total 8 [2019-11-26 02:47:08,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076113792] [2019-11-26 02:47:08,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:47:08,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:47:08,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:47:08,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:47:08,485 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand 8 states. [2019-11-26 02:47:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:47:08,641 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2019-11-26 02:47:08,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:47:08,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-11-26 02:47:08,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:47:08,643 INFO L225 Difference]: With dead ends: 92 [2019-11-26 02:47:08,643 INFO L226 Difference]: Without dead ends: 92 [2019-11-26 02:47:08,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:47:08,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-26 02:47:08,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 69. [2019-11-26 02:47:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-26 02:47:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2019-11-26 02:47:08,649 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 11 [2019-11-26 02:47:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:47:08,649 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2019-11-26 02:47:08,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:47:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2019-11-26 02:47:08,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 02:47:08,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:08,651 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:47:09,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:47:09,054 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:47:09,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:09,054 INFO L82 PathProgramCache]: Analyzing trace with hash 738364296, now seen corresponding path program 1 times [2019-11-26 02:47:09,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:47:09,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [980795036] [2019-11-26 02:47:09,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:09,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:47:09,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:47:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:09,142 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:47:09,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:09,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [980795036] [2019-11-26 02:47:09,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160060073] [2019-11-26 02:47:09,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:47:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:09,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:47:09,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:47:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:47:09,245 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:47:09,256 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:09,257 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 12 treesize of output 16 [2019-11-26 02:47:09,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:47:09,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:09,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:09,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:47:09,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-26 02:47:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:47:09,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-11-26 02:47:09,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5, 5] total 10 [2019-11-26 02:47:09,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468725308] [2019-11-26 02:47:09,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:47:09,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:47:09,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:47:09,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:47:09,264 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand 4 states. [2019-11-26 02:47:09,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:47:09,363 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-11-26 02:47:09,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:47:09,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-26 02:47:09,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:47:09,364 INFO L225 Difference]: With dead ends: 67 [2019-11-26 02:47:09,364 INFO L226 Difference]: Without dead ends: 67 [2019-11-26 02:47:09,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:47:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-26 02:47:09,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-26 02:47:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-26 02:47:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2019-11-26 02:47:09,370 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 11 [2019-11-26 02:47:09,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:47:09,370 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2019-11-26 02:47:09,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:47:09,370 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2019-11-26 02:47:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 02:47:09,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:09,371 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:47:09,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:47:09,773 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:47:09,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:09,774 INFO L82 PathProgramCache]: Analyzing trace with hash 738364297, now seen corresponding path program 1 times [2019-11-26 02:47:09,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:47:09,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1401128174] [2019-11-26 02:47:09,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:09,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:47:09,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:47:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:09,905 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:47:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:09,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1401128174] [2019-11-26 02:47:09,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625989832] [2019-11-26 02:47:09,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:47:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:10,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:47:10,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:47:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:10,027 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:47:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:10,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:47:10,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5] total 10 [2019-11-26 02:47:10,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53052833] [2019-11-26 02:47:10,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:47:10,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:47:10,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:47:10,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:47:10,098 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 10 states. [2019-11-26 02:47:10,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:47:10,772 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2019-11-26 02:47:10,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:47:10,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-11-26 02:47:10,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:47:10,774 INFO L225 Difference]: With dead ends: 140 [2019-11-26 02:47:10,774 INFO L226 Difference]: Without dead ends: 140 [2019-11-26 02:47:10,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-11-26 02:47:10,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-26 02:47:10,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 70. [2019-11-26 02:47:10,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-26 02:47:10,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2019-11-26 02:47:10,780 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 11 [2019-11-26 02:47:10,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:47:10,781 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2019-11-26 02:47:10,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:47:10,781 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2019-11-26 02:47:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 02:47:10,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:10,782 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-11-26 02:47:11,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:47:11,184 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:47:11,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:11,184 INFO L82 PathProgramCache]: Analyzing trace with hash 522992425, now seen corresponding path program 2 times [2019-11-26 02:47:11,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:47:11,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1383739825] [2019-11-26 02:47:11,186 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:11,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 02:47:11,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:47:11,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:47:11,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:47:11,402 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:47:11,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 02:47:11,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:11,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:11,411 INFO L496 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-11-26 02:47:11,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-11-26 02:47:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:11,473 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:47:11,903 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:11,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1383739825] [2019-11-26 02:47:11,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053386102] [2019-11-26 02:47:11,903 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:47:11,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 02:47:11,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:47:11,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:47:11,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:47:11,998 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:47:11,999 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 02:47:11,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:12,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:12,007 INFO L496 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-11-26 02:47:12,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-11-26 02:47:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:12,008 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:47:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:12,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:47:12,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 17 [2019-11-26 02:47:12,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50209300] [2019-11-26 02:47:12,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-26 02:47:12,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:47:12,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-26 02:47:12,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-11-26 02:47:12,016 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 18 states. [2019-11-26 02:47:15,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:47:15,875 INFO L93 Difference]: Finished difference Result 683 states and 726 transitions. [2019-11-26 02:47:15,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-26 02:47:15,878 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 11 [2019-11-26 02:47:15,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:47:15,882 INFO L225 Difference]: With dead ends: 683 [2019-11-26 02:47:15,882 INFO L226 Difference]: Without dead ends: 683 [2019-11-26 02:47:15,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=463, Invalid=1019, Unknown=0, NotChecked=0, Total=1482 [2019-11-26 02:47:15,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-11-26 02:47:15,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 78. [2019-11-26 02:47:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-26 02:47:15,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2019-11-26 02:47:15,891 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 11 [2019-11-26 02:47:15,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:47:15,891 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2019-11-26 02:47:15,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-26 02:47:15,892 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2019-11-26 02:47:15,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 02:47:15,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:15,892 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:47:16,293 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:47:16,293 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:47:16,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:16,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1416054993, now seen corresponding path program 1 times [2019-11-26 02:47:16,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:47:16,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1580766666] [2019-11-26 02:47:16,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:16,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 02:47:16,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:47:16,387 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_36|], 1=[|v_#valid_50|]} [2019-11-26 02:47:16,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:47:16,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 02:47:16,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:16,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:16,406 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 10 treesize of output 8 [2019-11-26 02:47:16,407 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:16,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:16,415 INFO L496 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-11-26 02:47:16,415 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-11-26 02:47:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:16,491 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:47:16,935 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-26 02:47:16,947 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 10 treesize of output 8 [2019-11-26 02:47:16,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:16,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:16,969 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:47:16,970 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:16,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:16,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:47:16,988 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2019-11-26 02:47:17,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:17,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1580766666] [2019-11-26 02:47:17,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860498003] [2019-11-26 02:47:17,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:47:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:17,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:47:17,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:47:17,149 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_38|], 1=[|v_#valid_52|]} [2019-11-26 02:47:17,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:47:17,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 02:47:17,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:17,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:17,165 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 10 treesize of output 8 [2019-11-26 02:47:17,165 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:17,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:17,173 INFO L496 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-11-26 02:47:17,173 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-11-26 02:47:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:17,206 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:47:17,476 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-26 02:47:17,481 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 10 treesize of output 8 [2019-11-26 02:47:17,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:17,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:17,496 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:47:17,497 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:47:17,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:47:17,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:47:17,508 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2019-11-26 02:47:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:17,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:47:17,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6, 7] total 14 [2019-11-26 02:47:17,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014348974] [2019-11-26 02:47:17,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-26 02:47:17,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:47:17,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-26 02:47:17,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:47:17,511 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. Second operand 15 states. [2019-11-26 02:47:18,443 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-26 02:47:19,002 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-26 02:47:19,566 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-11-26 02:47:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:47:21,204 INFO L93 Difference]: Finished difference Result 251 states and 275 transitions. [2019-11-26 02:47:21,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-26 02:47:21,205 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2019-11-26 02:47:21,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:47:21,207 INFO L225 Difference]: With dead ends: 251 [2019-11-26 02:47:21,207 INFO L226 Difference]: Without dead ends: 251 [2019-11-26 02:47:21,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2019-11-26 02:47:21,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-26 02:47:21,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 107. [2019-11-26 02:47:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-26 02:47:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 132 transitions. [2019-11-26 02:47:21,213 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 132 transitions. Word has length 12 [2019-11-26 02:47:21,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:47:21,213 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 132 transitions. [2019-11-26 02:47:21,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-26 02:47:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 132 transitions. [2019-11-26 02:47:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 02:47:21,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:21,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:47:21,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:21,615 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:47:21,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:21,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1031081387, now seen corresponding path program 1 times [2019-11-26 02:47:21,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:47:21,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1502992614] [2019-11-26 02:47:21,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:47:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:47:21,783 INFO L174 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2019-11-26 02:47:21,783 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:47:21,983 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:47:22,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:47:22 BoogieIcfgContainer [2019-11-26 02:47:22,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:47:22,012 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:47:22,012 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:47:22,012 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:47:22,012 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:47:00" (3/4) ... [2019-11-26 02:47:22,014 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 02:47:22,056 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e3c4a697-ced7-4171-a169-ca52d250d9f1/bin/utaipan/witness.graphml [2019-11-26 02:47:22,056 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:47:22,057 INFO L168 Benchmark]: Toolchain (without parser) took 22440.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 944.7 MB in the beginning and 958.2 MB in the end (delta: -13.4 MB). Peak memory consumption was 159.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:47:22,057 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:47:22,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:47:22,057 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:47:22,058 INFO L168 Benchmark]: Boogie Preprocessor took 27.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:47:22,058 INFO L168 Benchmark]: RCFGBuilder took 475.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:47:22,058 INFO L168 Benchmark]: TraceAbstraction took 21285.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.9 MB). Free memory was 1.1 GB in the beginning and 960.2 MB in the end (delta: 119.4 MB). Peak memory consumption was 160.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:47:22,058 INFO L168 Benchmark]: Witness Printer took 44.17 ms. Allocated memory is still 1.2 GB. Free memory was 960.2 MB in the beginning and 958.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:47:22,060 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 544.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 475.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21285.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.9 MB). Free memory was 1.1 GB in the beginning and 960.2 MB in the end (delta: 119.4 MB). Peak memory consumption was 160.3 MB. Max. memory is 11.5 GB. * Witness Printer took 44.17 ms. Allocated memory is still 1.2 GB. Free memory was 960.2 MB in the beginning and 958.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 533]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L512] int *a, *b; [L513] int n; VAL [a={0:0}, b={0:0}, n=0] [L525] n = 1 VAL [a={0:0}, b={0:0}, n=1] [L526] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L529] a = malloc(n * sizeof(*a)) [L530] b = malloc(n * sizeof(*b)) [L531] EXPR b++ VAL [a={1:0}, b={-2:4}, n=1] [L531] *b++ = 0 VAL [a={1:0}, b={-2:4}, n=1] [L517] int i; [L518] i = 0 VAL [a={1:0}, b={-2:4}, n=1] [L518] COND TRUE i < n VAL [a={1:0}, b={-2:4}, n=1] [L519] a[i] = n VAL [a={1:0}, b={-2:4}, n=1] [L518] i++ VAL [a={1:0}, b={-2:4}, n=1] [L518] COND FALSE !(i < n) VAL [a={1:0}, b={-2:4}, n=1] [L520] i = 0 VAL [a={1:0}, b={-2:4}, n=1] [L520] COND FALSE !(i < n - 1) VAL [a={1:0}, b={-2:4}, n=1] [L533] b[-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 21 error locations. Result: UNSAFE, OverallTime: 21.2s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 775 SDtfs, 5333 SDslu, 3665 SDs, 0 SdLazy, 1995 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 369 GetRequests, 212 SyntacticMatches, 11 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 1337 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 308 ConstructedInterpolants, 26 QuantifiedInterpolants, 24352 SizeOfPredicates, 77 NumberOfNonLiveVariables, 774 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 36 InterpolantComputations, 11 PerfectInterpolantSequences, 9/136 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...