./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/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 cfdde8b1798318c3bb26b76a748741913b280952 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/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 cfdde8b1798318c3bb26b76a748741913b280952 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:23:03,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:23:03,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:23:03,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:23:03,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:23:03,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:23:03,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:23:03,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:23:03,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:23:03,140 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:23:03,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:23:03,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:23:03,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:23:03,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:23:03,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:23:03,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:23:03,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:23:03,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:23:03,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:23:03,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:23:03,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:23:03,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:23:03,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:23:03,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:23:03,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:23:03,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:23:03,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:23:03,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:23:03,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:23:03,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:23:03,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:23:03,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:23:03,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:23:03,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:23:03,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:23:03,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:23:03,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:23:03,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:23:03,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:23:03,157 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:23:03,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:23:03,158 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 14:23:03,168 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:23:03,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:23:03,169 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:23:03,169 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:23:03,169 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:23:03,169 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:23:03,169 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:23:03,170 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:23:03,170 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:23:03,170 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:23:03,170 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:23:03,170 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:23:03,170 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:23:03,170 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:23:03,170 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:23:03,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:23:03,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:23:03,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:23:03,171 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:23:03,171 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:23:03,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:23:03,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:23:03,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:23:03,172 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 14:23:03,172 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 14:23:03,172 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 14:23:03,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:23:03,172 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:23:03,172 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:23:03,173 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:23:03,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:23:03,173 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:23:03,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:23:03,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:23:03,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:23:03,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:23:03,173 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:23:03,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:23:03,174 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:23:03,174 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:23:03,174 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_2dbc7b15-0807-4485-b277-4874be31c845/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 -> cfdde8b1798318c3bb26b76a748741913b280952 [2019-12-07 14:23:03,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:23:03,281 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:23:03,283 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:23:03,284 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:23:03,285 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:23:03,285 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2019-12-07 14:23:03,323 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/data/7d46af77b/511150c8e3a74151aa139afe6b431b68/FLAG3408968ae [2019-12-07 14:23:03,679 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:23:03,679 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2019-12-07 14:23:03,688 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/data/7d46af77b/511150c8e3a74151aa139afe6b431b68/FLAG3408968ae [2019-12-07 14:23:03,696 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/data/7d46af77b/511150c8e3a74151aa139afe6b431b68 [2019-12-07 14:23:03,698 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:23:03,699 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:23:03,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:23:03,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:23:03,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:23:03,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:23:03" (1/1) ... [2019-12-07 14:23:03,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e799b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:03, skipping insertion in model container [2019-12-07 14:23:03,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:23:03" (1/1) ... [2019-12-07 14:23:03,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:23:03,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:23:03,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:23:03,980 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:23:04,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:23:04,056 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:23:04,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:04 WrapperNode [2019-12-07 14:23:04,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:23:04,057 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:23:04,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:23:04,057 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:23:04,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:04" (1/1) ... [2019-12-07 14:23:04,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:04" (1/1) ... [2019-12-07 14:23:04,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:23:04,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:23:04,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:23:04,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:23:04,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:04" (1/1) ... [2019-12-07 14:23:04,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:04" (1/1) ... [2019-12-07 14:23:04,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:04" (1/1) ... [2019-12-07 14:23:04,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:04" (1/1) ... [2019-12-07 14:23:04,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:04" (1/1) ... [2019-12-07 14:23:04,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:04" (1/1) ... [2019-12-07 14:23:04,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:04" (1/1) ... [2019-12-07 14:23:04,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:23:04,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:23:04,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:23:04,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:23:04,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/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-12-07 14:23:04,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 14:23:04,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:23:04,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:23:04,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 14:23:04,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 14:23:04,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:23:04,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:23:04,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:23:04,453 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:23:04,454 INFO L287 CfgBuilder]: Removed 20 assume(true) statements. [2019-12-07 14:23:04,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:23:04 BoogieIcfgContainer [2019-12-07 14:23:04,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:23:04,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:23:04,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:23:04,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:23:04,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:23:03" (1/3) ... [2019-12-07 14:23:04,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dfd89f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:23:04, skipping insertion in model container [2019-12-07 14:23:04,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:04" (2/3) ... [2019-12-07 14:23:04,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dfd89f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:23:04, skipping insertion in model container [2019-12-07 14:23:04,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:23:04" (3/3) ... [2019-12-07 14:23:04,461 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2019-12-07 14:23:04,469 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:23:04,475 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-12-07 14:23:04,485 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-12-07 14:23:04,499 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:23:04,499 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 14:23:04,499 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:23:04,499 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:23:04,499 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:23:04,499 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:23:04,500 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:23:04,500 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:23:04,510 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-12-07 14:23:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 14:23:04,515 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:04,515 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 14:23:04,515 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:04,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:04,519 INFO L82 PathProgramCache]: Analyzing trace with hash 5403289, now seen corresponding path program 1 times [2019-12-07 14:23:04,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:04,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581341292] [2019-12-07 14:23:04,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:04,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581341292] [2019-12-07 14:23:04,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:04,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:23:04,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828065242] [2019-12-07 14:23:04,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:04,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:04,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:04,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:04,640 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-12-07 14:23:04,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:04,706 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2019-12-07 14:23:04,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:04,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 14:23:04,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:04,714 INFO L225 Difference]: With dead ends: 80 [2019-12-07 14:23:04,714 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 14:23:04,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 14:23:04,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 45. [2019-12-07 14:23:04,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 14:23:04,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-12-07 14:23:04,739 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 4 [2019-12-07 14:23:04,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:04,740 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-12-07 14:23:04,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2019-12-07 14:23:04,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 14:23:04,740 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:04,740 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 14:23:04,740 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:04,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:04,741 INFO L82 PathProgramCache]: Analyzing trace with hash 5403290, now seen corresponding path program 1 times [2019-12-07 14:23:04,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:04,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017644392] [2019-12-07 14:23:04,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:04,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017644392] [2019-12-07 14:23:04,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:04,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:23:04,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412567253] [2019-12-07 14:23:04,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:04,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:04,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:04,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:04,783 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 3 states. [2019-12-07 14:23:04,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:04,826 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-12-07 14:23:04,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:04,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 14:23:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:04,827 INFO L225 Difference]: With dead ends: 74 [2019-12-07 14:23:04,827 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 14:23:04,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:04,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 14:23:04,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2019-12-07 14:23:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 14:23:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-12-07 14:23:04,832 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 4 [2019-12-07 14:23:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:04,832 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-12-07 14:23:04,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:04,832 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-12-07 14:23:04,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:23:04,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:04,832 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:23:04,833 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:04,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:04,833 INFO L82 PathProgramCache]: Analyzing trace with hash 172007816, now seen corresponding path program 1 times [2019-12-07 14:23:04,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:04,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014654642] [2019-12-07 14:23:04,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:04,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:04,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014654642] [2019-12-07 14:23:04,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:04,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:23:04,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71347135] [2019-12-07 14:23:04,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:04,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:04,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:04,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:04,848 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 3 states. [2019-12-07 14:23:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:04,856 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-12-07 14:23:04,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:04,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 14:23:04,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:04,857 INFO L225 Difference]: With dead ends: 52 [2019-12-07 14:23:04,857 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 14:23:04,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:04,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 14:23:04,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2019-12-07 14:23:04,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 14:23:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-12-07 14:23:04,861 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 5 [2019-12-07 14:23:04,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:04,862 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-12-07 14:23:04,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:04,862 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-12-07 14:23:04,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 14:23:04,862 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:04,862 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:04,862 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:04,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:04,862 INFO L82 PathProgramCache]: Analyzing trace with hash -701380515, now seen corresponding path program 1 times [2019-12-07 14:23:04,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:04,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304347119] [2019-12-07 14:23:04,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:04,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:04,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304347119] [2019-12-07 14:23:04,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:04,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:23:04,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769354694] [2019-12-07 14:23:04,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:04,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:04,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:04,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:04,893 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 3 states. [2019-12-07 14:23:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:04,907 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-12-07 14:23:04,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:04,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 14:23:04,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:04,908 INFO L225 Difference]: With dead ends: 49 [2019-12-07 14:23:04,908 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 14:23:04,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:04,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 14:23:04,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-12-07 14:23:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 14:23:04,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-12-07 14:23:04,912 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 8 [2019-12-07 14:23:04,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:04,912 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-12-07 14:23:04,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:04,912 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-12-07 14:23:04,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 14:23:04,913 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:04,913 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:04,913 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:04,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:04,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1715799504, now seen corresponding path program 1 times [2019-12-07 14:23:04,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:04,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820148406] [2019-12-07 14:23:04,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:04,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820148406] [2019-12-07 14:23:04,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139817582] [2019-12-07 14:23:04,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:04,991 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:23:04,996 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:05,015 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:05,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [738403392] [2019-12-07 14:23:05,039 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:23:05,040 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:23:05,043 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:23:05,047 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:23:05,048 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:23:05,141 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:05,328 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:05,862 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:06,345 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:23:06,644 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 92 [2019-12-07 14:23:07,008 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 98 [2019-12-07 14:23:07,161 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-12-07 14:23:07,564 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 92 [2019-12-07 14:23:08,235 WARN L192 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 92 [2019-12-07 14:23:08,897 WARN L192 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 97 [2019-12-07 14:23:09,193 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 70 [2019-12-07 14:23:09,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:23:09,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [3, 3, 3] total 11 [2019-12-07 14:23:09,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796492684] [2019-12-07 14:23:09,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:23:09,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:09,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:23:09,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:23:09,196 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2019-12-07 14:23:10,164 WARN L192 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 90 [2019-12-07 14:23:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:10,445 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-12-07 14:23:10,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:23:10,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-07 14:23:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:10,446 INFO L225 Difference]: With dead ends: 59 [2019-12-07 14:23:10,446 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 14:23:10,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:23:10,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 14:23:10,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2019-12-07 14:23:10,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 14:23:10,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-12-07 14:23:10,450 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 12 [2019-12-07 14:23:10,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:10,450 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-12-07 14:23:10,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:23:10,450 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-12-07 14:23:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 14:23:10,451 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:10,451 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 14:23:10,651 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:10,652 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:10,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:10,654 INFO L82 PathProgramCache]: Analyzing trace with hash -113008875, now seen corresponding path program 1 times [2019-12-07 14:23:10,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:10,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961716870] [2019-12-07 14:23:10,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:10,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:10,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961716870] [2019-12-07 14:23:10,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088828538] [2019-12-07 14:23:10,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:10,750 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:23:10,751 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:10,774 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:10,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [922748652] [2019-12-07 14:23:10,789 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 14:23:10,789 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:23:10,789 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:23:10,789 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:23:10,789 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:23:10,818 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:10,950 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:11,294 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:11,752 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:23:12,057 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 92 [2019-12-07 14:23:12,342 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 85 [2019-12-07 14:23:12,489 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-12-07 14:23:12,829 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2019-12-07 14:23:13,307 WARN L192 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2019-12-07 14:23:13,835 WARN L192 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 97 [2019-12-07 14:23:14,158 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 70 [2019-12-07 14:23:14,529 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 91 [2019-12-07 14:23:14,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:23:14,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 4, 4] total 14 [2019-12-07 14:23:14,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225785667] [2019-12-07 14:23:14,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:23:14,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:14,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:23:14,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:23:14,531 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 10 states. [2019-12-07 14:23:14,848 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 90 [2019-12-07 14:23:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:15,140 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-12-07 14:23:15,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:23:15,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-12-07 14:23:15,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:15,141 INFO L225 Difference]: With dead ends: 57 [2019-12-07 14:23:15,141 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 14:23:15,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:23:15,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 14:23:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-12-07 14:23:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 14:23:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2019-12-07 14:23:15,146 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 15 [2019-12-07 14:23:15,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:15,146 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2019-12-07 14:23:15,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:23:15,146 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2019-12-07 14:23:15,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:23:15,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:15,147 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:15,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:15,349 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:15,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:15,349 INFO L82 PathProgramCache]: Analyzing trace with hash -811854236, now seen corresponding path program 1 times [2019-12-07 14:23:15,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:15,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362782479] [2019-12-07 14:23:15,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:23:15,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362782479] [2019-12-07 14:23:15,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:15,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:23:15,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285625000] [2019-12-07 14:23:15,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:23:15,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:15,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:23:15,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:23:15,393 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 6 states. [2019-12-07 14:23:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:15,489 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2019-12-07 14:23:15,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:23:15,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-07 14:23:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:15,490 INFO L225 Difference]: With dead ends: 97 [2019-12-07 14:23:15,490 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 14:23:15,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:23:15,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 14:23:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 58. [2019-12-07 14:23:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 14:23:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2019-12-07 14:23:15,494 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 20 [2019-12-07 14:23:15,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:15,494 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2019-12-07 14:23:15,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:23:15,494 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2019-12-07 14:23:15,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:23:15,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:15,495 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:15,495 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:15,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:15,495 INFO L82 PathProgramCache]: Analyzing trace with hash -811854235, now seen corresponding path program 1 times [2019-12-07 14:23:15,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:15,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983652808] [2019-12-07 14:23:15,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:23:15,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983652808] [2019-12-07 14:23:15,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671212095] [2019-12-07 14:23:15,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:15,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:23:15,570 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:15,572 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:23:15,573 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:23:15,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:23:15,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 5 [2019-12-07 14:23:15,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812496656] [2019-12-07 14:23:15,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:23:15,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:15,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:23:15,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:23:15,584 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 5 states. [2019-12-07 14:23:15,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:15,613 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2019-12-07 14:23:15,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:23:15,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 14:23:15,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:15,615 INFO L225 Difference]: With dead ends: 58 [2019-12-07 14:23:15,615 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 14:23:15,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:23:15,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 14:23:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2019-12-07 14:23:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 14:23:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2019-12-07 14:23:15,619 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 20 [2019-12-07 14:23:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:15,619 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2019-12-07 14:23:15,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:23:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2019-12-07 14:23:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:23:15,620 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:15,620 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:15,820 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:15,822 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:15,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:15,823 INFO L82 PathProgramCache]: Analyzing trace with hash -811857466, now seen corresponding path program 1 times [2019-12-07 14:23:15,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:15,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573383401] [2019-12-07 14:23:15,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:15,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:23:15,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573383401] [2019-12-07 14:23:15,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:15,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:23:15,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226711611] [2019-12-07 14:23:15,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:23:15,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:15,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:23:15,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:23:15,983 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 6 states. [2019-12-07 14:23:16,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:16,075 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-12-07 14:23:16,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:23:16,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-07 14:23:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:16,076 INFO L225 Difference]: With dead ends: 64 [2019-12-07 14:23:16,076 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 14:23:16,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:23:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 14:23:16,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2019-12-07 14:23:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 14:23:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-12-07 14:23:16,078 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 20 [2019-12-07 14:23:16,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:16,079 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-12-07 14:23:16,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:23:16,079 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-12-07 14:23:16,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 14:23:16,079 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:16,079 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:16,079 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:16,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:16,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1489120455, now seen corresponding path program 1 times [2019-12-07 14:23:16,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:16,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026970878] [2019-12-07 14:23:16,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:16,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026970878] [2019-12-07 14:23:16,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445069765] [2019-12-07 14:23:16,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/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-12-07 14:23:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:16,259 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 14:23:16,261 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:16,541 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 14:23:16,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1452333871] [2019-12-07 14:23:16,694 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 14:23:16,694 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:23:16,694 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:23:16,694 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:23:16,694 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:23:16,727 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:16,873 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:17,477 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:17,507 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:17,528 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:17,544 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:18,191 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:23:18,436 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 81 [2019-12-07 14:23:19,073 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 92 [2019-12-07 14:23:19,618 WARN L192 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 94 [2019-12-07 14:23:20,219 WARN L192 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 99 [2019-12-07 14:23:20,917 WARN L192 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 99 [2019-12-07 14:23:21,533 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 93 [2019-12-07 14:23:21,970 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 83 [2019-12-07 14:23:22,397 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 61 [2019-12-07 14:23:22,894 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 78 [2019-12-07 14:23:22,897 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 14:23:22,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:23:22,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 7] total 24 [2019-12-07 14:23:22,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479642859] [2019-12-07 14:23:22,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 14:23:22,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:22,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 14:23:22,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1160, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 14:23:22,899 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 25 states. [2019-12-07 14:23:23,789 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-12-07 14:23:24,181 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-12-07 14:23:24,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:24,817 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2019-12-07 14:23:24,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 14:23:24,818 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 22 [2019-12-07 14:23:24,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:24,821 INFO L225 Difference]: With dead ends: 102 [2019-12-07 14:23:24,821 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 14:23:24,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=500, Invalid=2692, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 14:23:24,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 14:23:24,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 52. [2019-12-07 14:23:24,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 14:23:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2019-12-07 14:23:24,830 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 22 [2019-12-07 14:23:24,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:24,830 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2019-12-07 14:23:24,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 14:23:24,830 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2019-12-07 14:23:24,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 14:23:24,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:24,832 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:25,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:25,033 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:25,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:25,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1489120456, now seen corresponding path program 1 times [2019-12-07 14:23:25,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:25,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178706656] [2019-12-07 14:23:25,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:25,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:25,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178706656] [2019-12-07 14:23:25,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814636104] [2019-12-07 14:23:25,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:25,302 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 14:23:25,303 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:25,775 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:26,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1658533128] [2019-12-07 14:23:26,623 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 14:23:26,623 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:23:26,623 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:23:26,623 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:23:26,624 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:23:26,652 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:26,765 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:27,260 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:27,292 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:27,297 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:27,324 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:28,004 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:23:28,308 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 90 [2019-12-07 14:23:28,961 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 88 [2019-12-07 14:23:29,521 WARN L192 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 94 [2019-12-07 14:23:30,175 WARN L192 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 99 [2019-12-07 14:23:30,892 WARN L192 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 99 [2019-12-07 14:23:31,518 WARN L192 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 93 [2019-12-07 14:23:32,094 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 90 [2019-12-07 14:23:32,484 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 69 [2019-12-07 14:23:32,912 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 85 [2019-12-07 14:23:32,913 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 14:23:32,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:23:32,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 32 [2019-12-07 14:23:32,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202891773] [2019-12-07 14:23:32,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 14:23:32,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:32,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 14:23:32,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1710, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 14:23:32,915 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 33 states. [2019-12-07 14:23:33,380 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-12-07 14:23:34,192 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-12-07 14:23:34,764 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2019-12-07 14:23:35,146 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 126 [2019-12-07 14:23:36,212 WARN L192 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 102 [2019-12-07 14:23:36,523 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-12-07 14:23:37,519 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 128 [2019-12-07 14:23:37,951 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 94 [2019-12-07 14:23:38,302 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 33 [2019-12-07 14:23:38,697 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 120 [2019-12-07 14:23:39,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:39,086 INFO L93 Difference]: Finished difference Result 232 states and 252 transitions. [2019-12-07 14:23:39,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 14:23:39,086 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 22 [2019-12-07 14:23:39,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:39,088 INFO L225 Difference]: With dead ends: 232 [2019-12-07 14:23:39,088 INFO L226 Difference]: Without dead ends: 232 [2019-12-07 14:23:39,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1342 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1004, Invalid=4696, Unknown=0, NotChecked=0, Total=5700 [2019-12-07 14:23:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-12-07 14:23:39,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 57. [2019-12-07 14:23:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 14:23:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2019-12-07 14:23:39,095 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 22 [2019-12-07 14:23:39,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:39,095 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2019-12-07 14:23:39,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 14:23:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2019-12-07 14:23:39,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 14:23:39,096 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:39,096 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:39,296 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:39,297 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:39,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:39,297 INFO L82 PathProgramCache]: Analyzing trace with hash 817641066, now seen corresponding path program 2 times [2019-12-07 14:23:39,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:39,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333043694] [2019-12-07 14:23:39,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:23:39,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333043694] [2019-12-07 14:23:39,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721696162] [2019-12-07 14:23:39,329 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:39,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 14:23:39,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:23:39,378 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:23:39,379 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:23:39,381 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:23:39,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:23:39,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 6 [2019-12-07 14:23:39,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797208797] [2019-12-07 14:23:39,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:23:39,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:39,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:23:39,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:23:39,392 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 6 states. [2019-12-07 14:23:39,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:39,421 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2019-12-07 14:23:39,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:23:39,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 14:23:39,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:39,422 INFO L225 Difference]: With dead ends: 46 [2019-12-07 14:23:39,422 INFO L226 Difference]: Without dead ends: 46 [2019-12-07 14:23:39,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:23:39,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-07 14:23:39,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-12-07 14:23:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 14:23:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2019-12-07 14:23:39,424 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 24 [2019-12-07 14:23:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:39,424 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-12-07 14:23:39,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:23:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2019-12-07 14:23:39,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:23:39,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:39,424 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:39,625 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:39,626 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:39,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:39,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1549881209, now seen corresponding path program 1 times [2019-12-07 14:23:39,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:39,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599597475] [2019-12-07 14:23:39,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:39,673 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:23:39,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599597475] [2019-12-07 14:23:39,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:39,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:23:39,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061021729] [2019-12-07 14:23:39,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:23:39,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:39,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:23:39,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:23:39,674 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 7 states. [2019-12-07 14:23:39,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:39,744 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2019-12-07 14:23:39,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:23:39,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-12-07 14:23:39,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:39,745 INFO L225 Difference]: With dead ends: 55 [2019-12-07 14:23:39,745 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 14:23:39,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:23:39,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 14:23:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-12-07 14:23:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 14:23:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-12-07 14:23:39,746 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 26 [2019-12-07 14:23:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:39,746 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-12-07 14:23:39,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:23:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-12-07 14:23:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:23:39,747 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:39,747 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:39,747 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:39,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:39,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1549882528, now seen corresponding path program 1 times [2019-12-07 14:23:39,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:39,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227093831] [2019-12-07 14:23:39,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:23:39,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227093831] [2019-12-07 14:23:39,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:39,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:23:39,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378977995] [2019-12-07 14:23:39,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:23:39,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:39,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:23:39,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:23:39,772 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 6 states. [2019-12-07 14:23:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:39,844 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-12-07 14:23:39,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:23:39,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 14:23:39,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:39,844 INFO L225 Difference]: With dead ends: 48 [2019-12-07 14:23:39,844 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 14:23:39,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:23:39,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 14:23:39,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-12-07 14:23:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 14:23:39,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-12-07 14:23:39,846 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 26 [2019-12-07 14:23:39,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:39,846 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-12-07 14:23:39,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:23:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-12-07 14:23:39,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:23:39,847 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:39,847 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:39,847 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:39,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:39,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1549882527, now seen corresponding path program 1 times [2019-12-07 14:23:39,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:39,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231863124] [2019-12-07 14:23:39,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:39,878 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:23:39,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231863124] [2019-12-07 14:23:39,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215999301] [2019-12-07 14:23:39,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:39,924 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:23:39,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:39,927 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:23:39,928 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:39,935 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:23:39,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1608765942] [2019-12-07 14:23:39,936 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 14:23:39,936 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:23:39,936 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:23:39,936 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:23:39,937 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:23:39,962 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:40,070 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:40,575 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:40,599 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:40,629 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:41,278 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:41,554 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:23:41,806 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 86 [2019-12-07 14:23:42,277 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 92 [2019-12-07 14:23:42,741 WARN L192 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94 [2019-12-07 14:23:43,272 WARN L192 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 99 [2019-12-07 14:23:43,861 WARN L192 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 107 [2019-12-07 14:23:44,305 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 93 [2019-12-07 14:23:44,705 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-12-07 14:23:45,090 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-12-07 14:23:45,343 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2019-12-07 14:23:45,721 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2019-12-07 14:23:45,722 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 14:23:45,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:23:45,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2019-12-07 14:23:45,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680210495] [2019-12-07 14:23:45,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:23:45,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:45,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:23:45,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2019-12-07 14:23:45,723 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 6 states. [2019-12-07 14:23:45,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:45,777 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-12-07 14:23:45,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:23:45,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 14:23:45,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:45,778 INFO L225 Difference]: With dead ends: 44 [2019-12-07 14:23:45,778 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 14:23:45,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-12-07 14:23:45,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 14:23:45,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-07 14:23:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 14:23:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-12-07 14:23:45,782 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 26 [2019-12-07 14:23:45,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:45,782 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-12-07 14:23:45,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:23:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-12-07 14:23:45,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:23:45,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:45,784 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:45,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:45,985 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:45,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:45,985 INFO L82 PathProgramCache]: Analyzing trace with hash -908308195, now seen corresponding path program 1 times [2019-12-07 14:23:45,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:45,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311156298] [2019-12-07 14:23:45,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:23:46,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311156298] [2019-12-07 14:23:46,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183281702] [2019-12-07 14:23:46,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/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-12-07 14:23:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:46,088 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:23:46,089 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:23:46,091 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:23:46,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [711078228] [2019-12-07 14:23:46,103 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 14:23:46,103 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:23:46,103 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:23:46,103 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:23:46,103 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:23:46,125 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:46,244 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:46,701 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:46,773 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:46,795 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:46,824 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:47,435 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:23:47,678 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:23:48,278 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 94 [2019-12-07 14:23:48,764 WARN L192 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 94 [2019-12-07 14:23:49,297 WARN L192 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 99 [2019-12-07 14:23:49,902 WARN L192 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 107 [2019-12-07 14:23:50,384 WARN L192 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 93 [2019-12-07 14:23:50,750 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-12-07 14:23:50,917 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-12-07 14:23:50,918 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 14:23:50,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:23:50,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2019-12-07 14:23:50,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783527449] [2019-12-07 14:23:50,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:23:50,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:50,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:23:50,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-07 14:23:50,919 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 7 states. [2019-12-07 14:23:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:50,970 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-12-07 14:23:50,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:23:50,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-12-07 14:23:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:50,971 INFO L225 Difference]: With dead ends: 40 [2019-12-07 14:23:50,971 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 14:23:50,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2019-12-07 14:23:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 14:23:50,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-07 14:23:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 14:23:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-12-07 14:23:50,973 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 27 [2019-12-07 14:23:50,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:50,973 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-12-07 14:23:50,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:23:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-12-07 14:23:50,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 14:23:50,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:50,974 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:51,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:51,175 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:51,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1965221204, now seen corresponding path program 2 times [2019-12-07 14:23:51,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:51,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078062511] [2019-12-07 14:23:51,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:51,233 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:23:51,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078062511] [2019-12-07 14:23:51,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:51,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:23:51,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155022160] [2019-12-07 14:23:51,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:23:51,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:51,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:23:51,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:23:51,234 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 6 states. [2019-12-07 14:23:51,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:51,316 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-12-07 14:23:51,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:23:51,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-07 14:23:51,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:51,317 INFO L225 Difference]: With dead ends: 44 [2019-12-07 14:23:51,317 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 14:23:51,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:23:51,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 14:23:51,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-12-07 14:23:51,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 14:23:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-12-07 14:23:51,319 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 29 [2019-12-07 14:23:51,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:51,319 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-12-07 14:23:51,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:23:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-12-07 14:23:51,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 14:23:51,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:51,319 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:51,320 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:51,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:51,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1208003953, now seen corresponding path program 1 times [2019-12-07 14:23:51,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:51,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197027007] [2019-12-07 14:23:51,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:23:51,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197027007] [2019-12-07 14:23:51,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:51,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:23:51,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771649728] [2019-12-07 14:23:51,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:23:51,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:51,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:23:51,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:23:51,355 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 6 states. [2019-12-07 14:23:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:51,403 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-12-07 14:23:51,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:23:51,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-07 14:23:51,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:51,404 INFO L225 Difference]: With dead ends: 42 [2019-12-07 14:23:51,404 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 14:23:51,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:23:51,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 14:23:51,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-07 14:23:51,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 14:23:51,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-12-07 14:23:51,405 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 31 [2019-12-07 14:23:51,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:51,405 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-12-07 14:23:51,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:23:51,405 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-12-07 14:23:51,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 14:23:51,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:51,405 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:51,406 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:51,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:51,406 INFO L82 PathProgramCache]: Analyzing trace with hash -114623806, now seen corresponding path program 1 times [2019-12-07 14:23:51,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:23:51,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566269417] [2019-12-07 14:23:51,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:23:51,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566269417] [2019-12-07 14:23:51,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157668981] [2019-12-07 14:23:51,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:51,718 INFO L264 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 62 conjunts are in the unsatisfiable core [2019-12-07 14:23:51,719 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:52,746 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:52,746 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:54,656 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@6119a400 [2019-12-07 14:23:54,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1043445766] [2019-12-07 14:23:54,658 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-12-07 14:23:54,658 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:23:54,658 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:23:54,658 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:23:54,658 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:23:54,666 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@6119a400 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:555) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:428) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:23:54,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:23:54,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-12-07 14:23:54,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297984518] [2019-12-07 14:23:54,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 14:23:54,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:23:54,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 14:23:54,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1939, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 14:23:54,668 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 19 states. [2019-12-07 14:23:54,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 14:23:54,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:54,869 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@6119a400 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:23:54,871 INFO L168 Benchmark]: Toolchain (without parser) took 51172.10 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.1 MB). Free memory was 938.0 MB in the beginning and 885.5 MB in the end (delta: 52.6 MB). Peak memory consumption was 442.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:54,871 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:23:54,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -145.5 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:54,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:54,872 INFO L168 Benchmark]: Boogie Preprocessor took 21.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:23:54,872 INFO L168 Benchmark]: RCFGBuilder took 344.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:54,873 INFO L168 Benchmark]: TraceAbstraction took 50414.68 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 285.2 MB). Free memory was 1.0 GB in the beginning and 885.5 MB in the end (delta: 147.4 MB). Peak memory consumption was 432.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:54,874 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 355.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -145.5 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 344.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 50414.68 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 285.2 MB). Free memory was 1.0 GB in the beginning and 885.5 MB in the end (delta: 147.4 MB). Peak memory consumption was 432.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@6119a400 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@6119a400: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 14:23:56,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:23:56,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:23:56,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:23:56,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:23:56,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:23:56,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:23:56,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:23:56,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:23:56,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:23:56,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:23:56,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:23:56,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:23:56,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:23:56,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:23:56,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:23:56,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:23:56,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:23:56,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:23:56,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:23:56,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:23:56,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:23:56,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:23:56,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:23:56,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:23:56,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:23:56,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:23:56,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:23:56,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:23:56,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:23:56,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:23:56,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:23:56,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:23:56,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:23:56,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:23:56,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:23:56,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:23:56,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:23:56,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:23:56,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:23:56,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:23:56,226 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 14:23:56,236 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:23:56,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:23:56,237 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:23:56,237 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:23:56,237 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:23:56,237 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:23:56,237 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:23:56,238 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:23:56,238 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:23:56,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:23:56,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:23:56,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:23:56,239 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:23:56,239 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:23:56,239 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:23:56,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:23:56,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:23:56,240 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 14:23:56,240 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 14:23:56,240 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 14:23:56,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:23:56,240 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:23:56,240 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 14:23:56,240 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 14:23:56,241 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:23:56,241 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:23:56,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:23:56,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:23:56,241 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:23:56,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:23:56,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:23:56,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:23:56,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:23:56,242 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 14:23:56,242 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 14:23:56,242 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:23:56,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:23:56,242 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_2dbc7b15-0807-4485-b277-4874be31c845/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 -> cfdde8b1798318c3bb26b76a748741913b280952 [2019-12-07 14:23:56,413 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:23:56,421 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:23:56,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:23:56,424 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:23:56,424 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:23:56,425 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2019-12-07 14:23:56,462 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/data/6fa841abe/bdddd28a3c8540ad9baba5360b016207/FLAG94fd90040 [2019-12-07 14:23:56,865 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:23:56,866 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2019-12-07 14:23:56,874 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/data/6fa841abe/bdddd28a3c8540ad9baba5360b016207/FLAG94fd90040 [2019-12-07 14:23:57,238 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/data/6fa841abe/bdddd28a3c8540ad9baba5360b016207 [2019-12-07 14:23:57,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:23:57,241 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:23:57,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:23:57,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:23:57,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:23:57,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:23:57" (1/1) ... [2019-12-07 14:23:57,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be58f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:57, skipping insertion in model container [2019-12-07 14:23:57,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:23:57" (1/1) ... [2019-12-07 14:23:57,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:23:57,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:23:57,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:23:57,507 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:23:57,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:23:57,589 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:23:57,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:57 WrapperNode [2019-12-07 14:23:57,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:23:57,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:23:57,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:23:57,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:23:57,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:57" (1/1) ... [2019-12-07 14:23:57,607 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:57" (1/1) ... [2019-12-07 14:23:57,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:23:57,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:23:57,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:23:57,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:23:57,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:57" (1/1) ... [2019-12-07 14:23:57,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:57" (1/1) ... [2019-12-07 14:23:57,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:57" (1/1) ... [2019-12-07 14:23:57,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:57" (1/1) ... [2019-12-07 14:23:57,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:57" (1/1) ... [2019-12-07 14:23:57,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:57" (1/1) ... [2019-12-07 14:23:57,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:57" (1/1) ... [2019-12-07 14:23:57,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:23:57,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:23:57,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:23:57,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:23:57,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/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-12-07 14:23:57,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 14:23:57,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:23:57,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 14:23:57,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 14:23:57,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:23:57,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 14:23:57,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:23:57,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:23:57,995 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:23:57,995 INFO L287 CfgBuilder]: Removed 20 assume(true) statements. [2019-12-07 14:23:57,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:23:57 BoogieIcfgContainer [2019-12-07 14:23:57,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:23:57,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:23:57,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:23:57,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:23:57,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:23:57" (1/3) ... [2019-12-07 14:23:57,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc123ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:23:57, skipping insertion in model container [2019-12-07 14:23:57,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:57" (2/3) ... [2019-12-07 14:23:58,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc123ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:23:57, skipping insertion in model container [2019-12-07 14:23:58,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:23:57" (3/3) ... [2019-12-07 14:23:58,001 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2019-12-07 14:23:58,007 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:23:58,012 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-12-07 14:23:58,019 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-12-07 14:23:58,031 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:23:58,032 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 14:23:58,032 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:23:58,032 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:23:58,032 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:23:58,032 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:23:58,032 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:23:58,032 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:23:58,043 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2019-12-07 14:23:58,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:23:58,048 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:58,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:23:58,049 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:58,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:58,053 INFO L82 PathProgramCache]: Analyzing trace with hash 28699851, now seen corresponding path program 1 times [2019-12-07 14:23:58,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:23:58,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313518066] [2019-12-07 14:23:58,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 14:23:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:58,107 INFO L264 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:23:58,111 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:58,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:23:58,150 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:23:58,156 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:23:58,157 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:23:58,157 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:23:58,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:58,164 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:58,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313518066] [2019-12-07 14:23:58,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:58,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 14:23:58,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515952960] [2019-12-07 14:23:58,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:58,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:23:58,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:58,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:58,184 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2019-12-07 14:23:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:58,327 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2019-12-07 14:23:58,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:58,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 14:23:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:58,336 INFO L225 Difference]: With dead ends: 107 [2019-12-07 14:23:58,336 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 14:23:58,337 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-12-07 14:23:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 14:23:58,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 58. [2019-12-07 14:23:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 14:23:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2019-12-07 14:23:58,362 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 5 [2019-12-07 14:23:58,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:58,362 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2019-12-07 14:23:58,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:58,363 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2019-12-07 14:23:58,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:23:58,363 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:58,363 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:23:58,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 14:23:58,565 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:58,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:58,566 INFO L82 PathProgramCache]: Analyzing trace with hash 28699852, now seen corresponding path program 1 times [2019-12-07 14:23:58,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:23:58,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125803352] [2019-12-07 14:23:58,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 14:23:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:58,662 INFO L264 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:23:58,663 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:58,671 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:23:58,671 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:23:58,678 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:23:58,678 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:23:58,679 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:23:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:58,687 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:58,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125803352] [2019-12-07 14:23:58,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:58,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 14:23:58,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345352794] [2019-12-07 14:23:58,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:58,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:23:58,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:58,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:58,724 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 4 states. [2019-12-07 14:23:58,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:58,877 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2019-12-07 14:23:58,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:58,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-07 14:23:58,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:58,880 INFO L225 Difference]: With dead ends: 99 [2019-12-07 14:23:58,880 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 14:23:58,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 14:23:58,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 55. [2019-12-07 14:23:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 14:23:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-12-07 14:23:58,888 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 5 [2019-12-07 14:23:58,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:58,888 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-12-07 14:23:58,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-12-07 14:23:58,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 14:23:58,889 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:58,889 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:59,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 14:23:59,090 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:59,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:59,090 INFO L82 PathProgramCache]: Analyzing trace with hash 264411510, now seen corresponding path program 1 times [2019-12-07 14:23:59,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:23:59,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758686153] [2019-12-07 14:23:59,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 14:23:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:59,122 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:23:59,123 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:59,129 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:59,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758686153] [2019-12-07 14:23:59,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:59,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:23:59,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542095928] [2019-12-07 14:23:59,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:59,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:23:59,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:59,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:59,138 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 4 states. [2019-12-07 14:23:59,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:59,152 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2019-12-07 14:23:59,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:59,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 14:23:59,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:59,154 INFO L225 Difference]: With dead ends: 66 [2019-12-07 14:23:59,154 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 14:23:59,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:59,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 14:23:59,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-12-07 14:23:59,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 14:23:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2019-12-07 14:23:59,159 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 8 [2019-12-07 14:23:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:59,159 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2019-12-07 14:23:59,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2019-12-07 14:23:59,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 14:23:59,160 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:59,160 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:59,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 14:23:59,362 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:59,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:59,363 INFO L82 PathProgramCache]: Analyzing trace with hash 671668623, now seen corresponding path program 1 times [2019-12-07 14:23:59,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:23:59,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992888624] [2019-12-07 14:23:59,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 14:23:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:59,407 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:23:59,408 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:59,418 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:59,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992888624] [2019-12-07 14:23:59,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:59,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 14:23:59,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553035062] [2019-12-07 14:23:59,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:59,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:23:59,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:59,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:59,422 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 3 states. [2019-12-07 14:23:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:59,451 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2019-12-07 14:23:59,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:59,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 14:23:59,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:59,453 INFO L225 Difference]: With dead ends: 64 [2019-12-07 14:23:59,453 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 14:23:59,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:59,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 14:23:59,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-12-07 14:23:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 14:23:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-12-07 14:23:59,458 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 9 [2019-12-07 14:23:59,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:59,459 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-12-07 14:23:59,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:59,459 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-12-07 14:23:59,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:23:59,459 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:59,460 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:59,660 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 14:23:59,661 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:23:59,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:59,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1971466659, now seen corresponding path program 1 times [2019-12-07 14:23:59,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:23:59,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097142723] [2019-12-07 14:23:59,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 14:23:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:59,774 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:23:59,775 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:59,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:23:59,779 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:23:59,781 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:23:59,781 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:23:59,781 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:23:59,816 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:23:59,817 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-12-07 14:23:59,818 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:23:59,832 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 14:23:59,832 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:23:59,833 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 14:23:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:59,841 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:23:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:59,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097142723] [2019-12-07 14:23:59,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1936137155] [2019-12-07 14:23:59,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/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-12-07 14:23:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:59,960 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:23:59,961 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:59,964 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:23:59,964 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:23:59,966 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:23:59,966 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:23:59,966 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:23:59,980 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:23:59,980 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-12-07 14:23:59,981 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:23:59,998 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 14:23:59,999 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:23:59,999 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 14:24:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:00,007 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:00,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514093612] [2019-12-07 14:24:00,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:24:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:00,098 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:24:00,100 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:00,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:00,104 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:00,106 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:00,106 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:00,106 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:24:00,126 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:00,127 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-12-07 14:24:00,128 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:00,142 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 14:24:00,143 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:24:00,143 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-12-07 14:24:00,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:00,161 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:00,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:24:00,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3, 3, 4, 4] total 6 [2019-12-07 14:24:00,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070665088] [2019-12-07 14:24:00,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:24:00,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:24:00,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:24:00,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:24:00,195 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 7 states. [2019-12-07 14:24:00,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:00,381 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2019-12-07 14:24:00,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:24:00,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-07 14:24:00,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:00,382 INFO L225 Difference]: With dead ends: 76 [2019-12-07 14:24:00,382 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 14:24:00,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:24:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 14:24:00,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2019-12-07 14:24:00,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 14:24:00,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-12-07 14:24:00,386 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 16 [2019-12-07 14:24:00,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:00,386 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-12-07 14:24:00,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:24:00,386 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-12-07 14:24:00,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:24:00,386 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:00,386 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:00,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 mathsat -unsat_core_generation=3,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:24:00,990 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:24:00,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:00,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1971466660, now seen corresponding path program 1 times [2019-12-07 14:24:00,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:24:00,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021506384] [2019-12-07 14:24:00,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:01,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:24:01,098 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:01,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:01,104 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:01,110 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:01,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:01,113 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:01,118 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:01,119 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:01,119 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 14:24:01,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:01,144 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 14:24:01,145 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:01,154 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:01,162 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:01,162 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 14:24:01,163 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:01,170 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:01,171 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:24:01,171 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-12-07 14:24:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:01,195 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:01,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:01,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021506384] [2019-12-07 14:24:01,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [723146175] [2019-12-07 14:24:01,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/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-12-07 14:24:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:01,489 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:24:01,491 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:01,496 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:01,496 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:01,504 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:01,506 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:01,507 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:01,517 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:01,518 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:01,518 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 14:24:01,530 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:01,530 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 14:24:01,531 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:01,540 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:01,542 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 14:24:01,542 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:01,549 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:01,550 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:24:01,550 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-12-07 14:24:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:01,557 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:01,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:01,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:01,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184661846] [2019-12-07 14:24:01,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/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-12-07 14:24:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:01,693 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:24:01,694 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:01,700 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:01,701 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:01,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:01,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:01,711 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:01,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:01,716 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:01,716 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 14:24:01,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:01,722 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 14:24:01,723 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:01,731 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:01,737 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:01,738 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 14:24:01,738 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:01,746 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:01,746 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:24:01,747 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-12-07 14:24:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:01,752 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:01,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:01,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:24:01,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 7 [2019-12-07 14:24:01,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461848090] [2019-12-07 14:24:01,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:24:01,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:24:01,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:24:01,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:24:01,839 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 8 states. [2019-12-07 14:24:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:02,283 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2019-12-07 14:24:02,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:24:02,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-12-07 14:24:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:02,285 INFO L225 Difference]: With dead ends: 89 [2019-12-07 14:24:02,285 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 14:24:02,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:24:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 14:24:02,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-12-07 14:24:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 14:24:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2019-12-07 14:24:02,289 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 16 [2019-12-07 14:24:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:02,290 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2019-12-07 14:24:02,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:24:02,290 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2019-12-07 14:24:02,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 14:24:02,290 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:02,291 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:02,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3,10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:24:02,893 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:24:02,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:02,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1383602186, now seen corresponding path program 1 times [2019-12-07 14:24:02,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:24:02,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006481088] [2019-12-07 14:24:02,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:02,967 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:24:02,968 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:02,976 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:02,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006481088] [2019-12-07 14:24:02,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [977756331] [2019-12-07 14:24:02,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:24:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:03,035 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:24:03,036 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:03,037 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:03,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:03,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406337619] [2019-12-07 14:24:03,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:24:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:03,082 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:24:03,083 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:03,084 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:03,084 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:03,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:03,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:24:03,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 4 [2019-12-07 14:24:03,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242821715] [2019-12-07 14:24:03,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:24:03,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:24:03,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:24:03,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:24:03,087 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 4 states. [2019-12-07 14:24:03,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:03,150 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2019-12-07 14:24:03,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:24:03,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 14:24:03,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:03,151 INFO L225 Difference]: With dead ends: 61 [2019-12-07 14:24:03,151 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 14:24:03,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:24:03,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 14:24:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-12-07 14:24:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 14:24:03,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2019-12-07 14:24:03,154 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 22 [2019-12-07 14:24:03,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:03,154 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2019-12-07 14:24:03,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:24:03,154 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2019-12-07 14:24:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 14:24:03,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:03,154 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:03,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 cvc4 --incremental --print-success --lang smt --rewrite-divk,12 mathsat -unsat_core_generation=3 [2019-12-07 14:24:03,758 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:24:03,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:03,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1095456886, now seen corresponding path program 1 times [2019-12-07 14:24:03,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:24:03,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975921751] [2019-12-07 14:24:03,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:03,841 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:24:03,842 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:03,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:24:03,853 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:24:03,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975921751] [2019-12-07 14:24:03,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:24:03,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 14:24:03,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893745433] [2019-12-07 14:24:03,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:24:03,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:24:03,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:24:03,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:24:03,882 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 8 states. [2019-12-07 14:24:03,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:03,946 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-12-07 14:24:03,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:24:03,946 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-12-07 14:24:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:03,947 INFO L225 Difference]: With dead ends: 62 [2019-12-07 14:24:03,947 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 14:24:03,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:24:03,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 14:24:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2019-12-07 14:24:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 14:24:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-12-07 14:24:03,949 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 23 [2019-12-07 14:24:03,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:03,949 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-12-07 14:24:03,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:24:03,949 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-12-07 14:24:03,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 14:24:03,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:03,950 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:04,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 14:24:04,151 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:24:04,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:04,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1095456941, now seen corresponding path program 1 times [2019-12-07 14:24:04,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:24:04,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808384397] [2019-12-07 14:24:04,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:04,280 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:24:04,281 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:04,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:04,284 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:04,286 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:04,286 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:04,286 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:24:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:24:04,309 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:24:04,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808384397] [2019-12-07 14:24:04,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:24:04,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-12-07 14:24:04,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915795640] [2019-12-07 14:24:04,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:24:04,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:24:04,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:24:04,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:24:04,320 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 7 states. [2019-12-07 14:24:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:04,614 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-12-07 14:24:04,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:24:04,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-07 14:24:04,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:04,615 INFO L225 Difference]: With dead ends: 68 [2019-12-07 14:24:04,615 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 14:24:04,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:24:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 14:24:04,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 52. [2019-12-07 14:24:04,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 14:24:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-12-07 14:24:04,618 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 23 [2019-12-07 14:24:04,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:04,618 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-12-07 14:24:04,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:24:04,618 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-12-07 14:24:04,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 14:24:04,618 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:04,618 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:04,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 14:24:04,820 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:24:04,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:04,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1095456942, now seen corresponding path program 1 times [2019-12-07 14:24:04,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:24:04,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094361808] [2019-12-07 14:24:04,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:04,958 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 14:24:04,960 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:04,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:04,963 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:04,967 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:04,967 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:04,968 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:24:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:24:05,008 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:05,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:24:05,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094361808] [2019-12-07 14:24:05,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:24:05,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 14:24:05,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280977503] [2019-12-07 14:24:05,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:24:05,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:24:05,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:24:05,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:24:05,278 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 12 states. [2019-12-07 14:24:05,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:05,857 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-12-07 14:24:05,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:24:05,858 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-07 14:24:05,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:05,859 INFO L225 Difference]: With dead ends: 72 [2019-12-07 14:24:05,859 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 14:24:05,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:24:05,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 14:24:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2019-12-07 14:24:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 14:24:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-12-07 14:24:05,862 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 23 [2019-12-07 14:24:05,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:05,862 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-12-07 14:24:05,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:24:05,862 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-12-07 14:24:05,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:24:05,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:05,863 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:06,064 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 14:24:06,064 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:24:06,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:06,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1596247903, now seen corresponding path program 1 times [2019-12-07 14:24:06,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:24:06,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062682516] [2019-12-07 14:24:06,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:06,180 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 14:24:06,181 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:06,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:06,185 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:06,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:06,187 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:06,187 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:24:06,199 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:06,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 14:24:06,200 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:06,204 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:06,204 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:06,204 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-12-07 14:24:06,215 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:24:06,216 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:06,222 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:06,222 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:06,223 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 14:24:06,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:06,240 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:24:06,240 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:06,250 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:06,250 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:06,250 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-12-07 14:24:06,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:06,333 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:06,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 111 [2019-12-07 14:24:06,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:24:06,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:06,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:24:06,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:06,336 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 14:24:06,409 INFO L614 ElimStorePlain]: treesize reduction 313, result has 13.5 percent of original size [2019-12-07 14:24:06,410 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:24:06,410 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:49 [2019-12-07 14:24:06,642 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:06,642 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2019-12-07 14:24:06,643 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:06,651 INFO L614 ElimStorePlain]: treesize reduction 14, result has 41.7 percent of original size [2019-12-07 14:24:06,651 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:06,651 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:5 [2019-12-07 14:24:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:06,700 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:06,980 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:06,980 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 30 treesize of output 34 [2019-12-07 14:24:06,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:06,981 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:06,985 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:06,985 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:24:06,985 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2019-12-07 14:24:07,122 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:07,122 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:07,123 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:07,123 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:1 [2019-12-07 14:24:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 14:24:07,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062682516] [2019-12-07 14:24:07,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [493736569] [2019-12-07 14:24:07,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:24:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:07,253 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 14:24:07,254 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:07,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:07,257 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:07,259 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:07,259 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:07,259 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:24:07,273 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:07,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-12-07 14:24:07,274 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:07,289 INFO L614 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-12-07 14:24:07,289 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:07,290 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 14:24:07,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:24:07,330 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:07,339 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:07,339 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:07,339 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-12-07 14:24:07,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:07,397 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:24:07,397 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:07,408 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:07,409 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:07,409 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2019-12-07 14:24:07,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:07,533 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:07,533 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 111 [2019-12-07 14:24:07,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:24:07,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:24:07,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:07,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:07,535 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-12-07 14:24:07,641 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 30 [2019-12-07 14:24:07,642 INFO L614 ElimStorePlain]: treesize reduction 287, result has 16.3 percent of original size [2019-12-07 14:24:07,642 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:24:07,642 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2019-12-07 14:24:08,066 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:08,067 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 52 [2019-12-07 14:24:08,067 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:08,079 INFO L614 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-12-07 14:24:08,079 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:24:08,079 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:17 [2019-12-07 14:24:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:08,198 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:08,610 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:08,629 INFO L614 ElimStorePlain]: treesize reduction 33, result has 17.5 percent of original size [2019-12-07 14:24:08,629 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:08,629 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:7 [2019-12-07 14:24:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:08,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153117484] [2019-12-07 14:24:08,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:24:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:08,794 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 14:24:08,795 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:08,798 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:08,798 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:08,799 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:08,799 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:08,800 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:24:08,805 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:08,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 14:24:08,806 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:08,810 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:08,810 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:08,810 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-12-07 14:24:08,813 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:24:08,813 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:08,819 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:08,820 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:08,820 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 14:24:08,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:08,824 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:24:08,824 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:08,833 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:08,833 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:08,833 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-12-07 14:24:08,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:08,888 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:08,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 113 [2019-12-07 14:24:08,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:24:08,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:08,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:08,890 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 14:24:08,947 INFO L614 ElimStorePlain]: treesize reduction 112, result has 30.4 percent of original size [2019-12-07 14:24:08,948 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:24:08,948 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:49 [2019-12-07 14:24:08,999 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:08,999 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2019-12-07 14:24:09,000 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:09,008 INFO L614 ElimStorePlain]: treesize reduction 14, result has 41.7 percent of original size [2019-12-07 14:24:09,009 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:09,009 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:5 [2019-12-07 14:24:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:09,011 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:09,136 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:09,136 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 30 treesize of output 34 [2019-12-07 14:24:09,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:09,137 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:09,141 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:09,141 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:24:09,141 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2019-12-07 14:24:09,222 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:09,223 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:09,223 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:09,223 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:1 [2019-12-07 14:24:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 14:24:09,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:24:09,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 13, 12, 13, 9] total 32 [2019-12-07 14:24:09,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509983598] [2019-12-07 14:24:09,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 14:24:09,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:24:09,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 14:24:09,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 14:24:09,226 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 33 states. [2019-12-07 14:24:10,746 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-12-07 14:24:11,123 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-12-07 14:24:11,881 WARN L192 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 109 [2019-12-07 14:24:12,259 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-12-07 14:24:13,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:13,054 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-12-07 14:24:13,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 14:24:13,054 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 26 [2019-12-07 14:24:13,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:13,055 INFO L225 Difference]: With dead ends: 107 [2019-12-07 14:24:13,055 INFO L226 Difference]: Without dead ends: 107 [2019-12-07 14:24:13,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 107 SyntacticMatches, 15 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=405, Invalid=1947, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 14:24:13,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-07 14:24:13,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 57. [2019-12-07 14:24:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 14:24:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2019-12-07 14:24:13,058 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 26 [2019-12-07 14:24:13,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:13,058 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2019-12-07 14:24:13,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 14:24:13,058 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2019-12-07 14:24:13,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:24:13,059 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:13,059 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:13,660 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:24:13,661 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:24:13,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:13,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1596247904, now seen corresponding path program 1 times [2019-12-07 14:24:13,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:24:13,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227265313] [2019-12-07 14:24:13,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:13,768 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 14:24:13,769 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:13,773 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:13,773 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:13,779 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:13,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:13,781 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:13,786 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:13,786 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:13,786 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 14:24:13,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:13,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 14:24:13,806 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:13,816 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:13,823 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:13,823 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 14:24:13,824 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:13,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:13,832 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:13,833 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-12-07 14:24:13,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:24:13,853 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:13,870 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:13,873 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:24:13,874 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:13,893 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:13,893 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:13,893 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-12-07 14:24:13,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:13,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:24:13,933 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:13,968 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:13,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:13,974 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:24:13,974 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:13,993 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:13,993 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:13,994 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2019-12-07 14:24:14,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:14,032 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-12-07 14:24:14,032 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:14,056 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:14,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:14,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:14,060 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:24:14,078 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:14,078 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 66 [2019-12-07 14:24:14,078 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:14,132 INFO L614 ElimStorePlain]: treesize reduction 30, result has 74.4 percent of original size [2019-12-07 14:24:14,132 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:14,132 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:87 [2019-12-07 14:24:14,382 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:14,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 37 [2019-12-07 14:24:14,383 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:14,410 INFO L614 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-12-07 14:24:14,413 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 14:24:14,413 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:14,420 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:14,420 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:24:14,420 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:22 [2019-12-07 14:24:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:14,508 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:15,852 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:16,060 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 14:24:16,060 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:16,072 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:16,350 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-12-07 14:24:16,350 INFO L614 ElimStorePlain]: treesize reduction 66, result has 64.1 percent of original size [2019-12-07 14:24:16,360 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:16,441 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:16,441 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 14:24:16,441 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:157, output treesize:77 [2019-12-07 14:24:16,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:16,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:16,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:16,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:16,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:17,026 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-12-07 14:24:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:17,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227265313] [2019-12-07 14:24:17,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1074195039] [2019-12-07 14:24:17,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:24:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:17,438 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 14:24:17,439 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:17,444 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:17,444 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:17,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:17,452 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:17,452 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:17,457 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:17,457 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:17,457 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 14:24:17,466 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:17,466 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 14:24:17,466 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:17,477 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:17,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 14:24:17,479 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:17,488 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:17,488 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:17,488 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-12-07 14:24:17,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:24:17,493 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:17,512 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:17,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:24:17,517 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:17,533 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:17,533 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:17,533 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-12-07 14:24:17,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:17,542 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:24:17,542 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:17,571 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:17,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:17,576 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:24:17,576 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:17,596 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:17,596 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:17,596 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2019-12-07 14:24:17,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:17,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-12-07 14:24:17,604 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:17,636 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:17,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:17,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:17,642 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:24:17,656 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:17,656 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 66 [2019-12-07 14:24:17,657 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:17,701 INFO L614 ElimStorePlain]: treesize reduction 30, result has 74.4 percent of original size [2019-12-07 14:24:17,702 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:17,702 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:87 [2019-12-07 14:24:17,713 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:17,713 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 37 [2019-12-07 14:24:17,713 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:17,739 INFO L614 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-12-07 14:24:17,741 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 14:24:17,742 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:17,748 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:17,749 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:24:17,749 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:22 [2019-12-07 14:24:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:17,788 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:18,230 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:18,399 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 14:24:18,400 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:18,415 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:18,671 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-12-07 14:24:18,672 INFO L614 ElimStorePlain]: treesize reduction 66, result has 64.1 percent of original size [2019-12-07 14:24:18,678 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:18,764 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:18,765 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 14:24:18,765 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:157, output treesize:77 [2019-12-07 14:24:18,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:18,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:18,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:18,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:18,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:19,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:19,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193838179] [2019-12-07 14:24:19,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:24:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:19,208 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 14:24:19,210 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:19,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:19,214 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:19,219 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:19,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:19,221 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:19,226 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:19,226 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:19,226 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 14:24:19,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:19,232 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 14:24:19,232 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:19,242 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:19,252 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:19,252 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 14:24:19,252 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:19,260 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:19,261 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:19,261 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-12-07 14:24:19,266 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:24:19,266 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:19,284 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:19,287 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:24:19,287 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:19,304 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:19,304 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:19,304 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-12-07 14:24:19,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:19,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:24:19,311 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:19,337 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:19,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:19,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:24:19,341 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:19,360 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:19,360 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:19,361 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2019-12-07 14:24:19,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:19,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-12-07 14:24:19,369 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:19,392 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:19,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:19,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:19,397 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:24:19,410 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:19,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 68 [2019-12-07 14:24:19,411 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:19,455 INFO L614 ElimStorePlain]: treesize reduction 30, result has 73.9 percent of original size [2019-12-07 14:24:19,456 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:19,456 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:107, output treesize:85 [2019-12-07 14:24:19,492 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:19,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 37 [2019-12-07 14:24:19,493 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:19,531 INFO L614 ElimStorePlain]: treesize reduction 8, result has 84.9 percent of original size [2019-12-07 14:24:19,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 14:24:19,534 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:19,543 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:19,544 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:24:19,544 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:20 [2019-12-07 14:24:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:19,628 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:20,096 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:27,352 WARN L192 SmtUtils]: Spent 7.26 s on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2019-12-07 14:24:27,353 INFO L614 ElimStorePlain]: treesize reduction 69, result has 63.7 percent of original size [2019-12-07 14:24:27,361 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:27,457 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:27,465 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:27,582 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-12-07 14:24:27,582 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:27,582 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 14:24:27,582 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:157, output treesize:77 [2019-12-07 14:24:27,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:27,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:27,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:27,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:27,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:27,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:27,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:24:28,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:24:28,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13, 12, 13, 12] total 24 [2019-12-07 14:24:28,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616900244] [2019-12-07 14:24:28,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 14:24:28,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:24:28,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 14:24:28,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2019-12-07 14:24:28,241 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 25 states. [2019-12-07 14:24:29,755 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-12-07 14:24:30,254 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 14:24:30,737 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 121 [2019-12-07 14:24:31,366 WARN L192 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 145 [2019-12-07 14:24:31,866 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-07 14:24:32,466 WARN L192 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 150 [2019-12-07 14:24:32,968 WARN L192 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 127 [2019-12-07 14:24:33,284 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-12-07 14:24:34,707 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 118 [2019-12-07 14:24:35,576 WARN L192 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-07 14:24:35,913 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-12-07 14:24:38,367 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-12-07 14:24:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:38,468 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2019-12-07 14:24:38,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 14:24:38,470 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2019-12-07 14:24:38,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:38,471 INFO L225 Difference]: With dead ends: 176 [2019-12-07 14:24:38,471 INFO L226 Difference]: Without dead ends: 176 [2019-12-07 14:24:38,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 115 SyntacticMatches, 12 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=404, Invalid=1576, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 14:24:38,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-12-07 14:24:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 64. [2019-12-07 14:24:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 14:24:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-12-07 14:24:38,474 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 26 [2019-12-07 14:24:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:38,475 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-12-07 14:24:38,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 14:24:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-12-07 14:24:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 14:24:38,475 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:38,475 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:39,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3,22 cvc4 --incremental --print-success --lang smt --rewrite-divk,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:24:39,078 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:24:39,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:39,079 INFO L82 PathProgramCache]: Analyzing trace with hash -54950954, now seen corresponding path program 2 times [2019-12-07 14:24:39,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:24:39,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733773388] [2019-12-07 14:24:39,080 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:39,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:24:39,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:24:39,232 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:24:39,232 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:24:39,246 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:24:39,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733773388] [2019-12-07 14:24:39,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1584439196] [2019-12-07 14:24:39,305 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:24:39,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:24:39,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:24:39,432 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:24:39,433 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:24:39,435 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:24:39,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987033250] [2019-12-07 14:24:39,438 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:24:39,489 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:24:39,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:24:39,492 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:24:39,493 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:24:39,497 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:24:39,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:24:39,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 8] total 16 [2019-12-07 14:24:39,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250601979] [2019-12-07 14:24:39,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 14:24:39,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:24:39,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 14:24:39,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:24:39,725 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 16 states. [2019-12-07 14:24:40,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:40,609 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2019-12-07 14:24:40,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 14:24:40,610 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-12-07 14:24:40,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:40,610 INFO L225 Difference]: With dead ends: 133 [2019-12-07 14:24:40,610 INFO L226 Difference]: Without dead ends: 133 [2019-12-07 14:24:40,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=322, Invalid=938, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 14:24:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-12-07 14:24:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 82. [2019-12-07 14:24:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 14:24:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2019-12-07 14:24:40,613 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 29 [2019-12-07 14:24:40,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:40,613 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2019-12-07 14:24:40,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 14:24:40,613 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2019-12-07 14:24:40,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 14:24:40,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:40,614 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:41,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 cvc4 --incremental --print-success --lang smt --rewrite-divk,24 mathsat -unsat_core_generation=3 [2019-12-07 14:24:41,216 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:24:41,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:41,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1241792948, now seen corresponding path program 1 times [2019-12-07 14:24:41,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:24:41,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086456834] [2019-12-07 14:24:41,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:41,305 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:24:41,305 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:41,316 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:24:41,316 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:24:41,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086456834] [2019-12-07 14:24:41,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [76310381] [2019-12-07 14:24:41,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:24:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:41,469 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:24:41,470 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:24:41,472 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:24:41,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578666290] [2019-12-07 14:24:41,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:24:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:41,519 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:24:41,520 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:24:41,569 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:24:41,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 14:24:41,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [5, 5, 5, 5] total 13 [2019-12-07 14:24:41,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120899398] [2019-12-07 14:24:41,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:24:41,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:24:41,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:24:41,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:24:41,580 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand 7 states. [2019-12-07 14:24:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:41,875 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2019-12-07 14:24:41,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:24:41,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 14:24:41,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:41,877 INFO L225 Difference]: With dead ends: 93 [2019-12-07 14:24:41,877 INFO L226 Difference]: Without dead ends: 93 [2019-12-07 14:24:41,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:24:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-07 14:24:41,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2019-12-07 14:24:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 14:24:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-12-07 14:24:41,879 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 33 [2019-12-07 14:24:41,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:41,879 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-12-07 14:24:41,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:24:41,879 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-12-07 14:24:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 14:24:41,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:41,880 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:42,481 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 mathsat -unsat_core_generation=3,28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:24:42,482 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:24:42,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:42,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1241792947, now seen corresponding path program 1 times [2019-12-07 14:24:42,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:24:42,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977548472] [2019-12-07 14:24:42,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:42,556 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:24:42,557 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:42,567 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:24:42,567 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:24:42,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977548472] [2019-12-07 14:24:42,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1254534634] [2019-12-07 14:24:42,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:24:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:42,719 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:24:42,719 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:24:42,722 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:24:42,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080570621] [2019-12-07 14:24:42,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:24:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:42,771 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:24:42,771 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:24:42,777 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:24:42,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:24:42,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 6] total 10 [2019-12-07 14:24:42,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479840942] [2019-12-07 14:24:42,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:24:42,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:24:42,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:24:42,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:24:42,820 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 10 states. [2019-12-07 14:24:42,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:42,910 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2019-12-07 14:24:42,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:24:42,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-12-07 14:24:42,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:42,911 INFO L225 Difference]: With dead ends: 98 [2019-12-07 14:24:42,911 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 14:24:42,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:24:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 14:24:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2019-12-07 14:24:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 14:24:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2019-12-07 14:24:42,914 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 33 [2019-12-07 14:24:42,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:42,914 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2019-12-07 14:24:42,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:24:42,914 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2019-12-07 14:24:42,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 14:24:42,914 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:42,914 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:43,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 mathsat -unsat_core_generation=3,31 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:24:43,516 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:24:43,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:43,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1200943998, now seen corresponding path program 1 times [2019-12-07 14:24:43,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:24:43,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61995014] [2019-12-07 14:24:43,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:43,681 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:24:43,682 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:24:43,696 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:43,757 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:24:43,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61995014] [2019-12-07 14:24:43,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [663883077] [2019-12-07 14:24:43,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:24:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:43,899 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:24:43,899 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:24:43,902 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:24:43,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236477147] [2019-12-07 14:24:43,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:24:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:43,955 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:24:43,956 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:24:43,959 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:44,178 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:24:44,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:24:44,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 8] total 16 [2019-12-07 14:24:44,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887993627] [2019-12-07 14:24:44,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 14:24:44,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:24:44,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 14:24:44,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:24:44,180 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand 16 states. [2019-12-07 14:24:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:44,332 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-12-07 14:24:44,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:24:44,332 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2019-12-07 14:24:44,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:44,333 INFO L225 Difference]: With dead ends: 58 [2019-12-07 14:24:44,333 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 14:24:44,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:24:44,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 14:24:44,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-12-07 14:24:44,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 14:24:44,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2019-12-07 14:24:44,335 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 33 [2019-12-07 14:24:44,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:44,335 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2019-12-07 14:24:44,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 14:24:44,335 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2019-12-07 14:24:44,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 14:24:44,335 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:44,336 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:44,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 cvc4 --incremental --print-success --lang smt --rewrite-divk,33 mathsat -unsat_core_generation=3 [2019-12-07 14:24:44,938 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:24:44,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:44,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1222569735, now seen corresponding path program 2 times [2019-12-07 14:24:44,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:24:44,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440480841] [2019-12-07 14:24:44,940 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:45,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:24:45,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:24:45,106 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 14:24:45,107 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:45,110 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:45,110 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:45,115 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:45,115 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:45,115 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:24:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:24:45,162 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:24:45,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440480841] [2019-12-07 14:24:45,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:24:45,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 14:24:45,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617187242] [2019-12-07 14:24:45,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:24:45,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:24:45,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:24:45,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:24:45,427 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 12 states. [2019-12-07 14:24:46,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:46,019 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-12-07 14:24:46,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:24:46,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-12-07 14:24:46,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:46,021 INFO L225 Difference]: With dead ends: 66 [2019-12-07 14:24:46,021 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 14:24:46,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:24:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 14:24:46,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2019-12-07 14:24:46,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 14:24:46,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-12-07 14:24:46,023 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 37 [2019-12-07 14:24:46,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:46,023 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-12-07 14:24:46,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:24:46,023 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-12-07 14:24:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 14:24:46,023 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:46,023 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:46,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 mathsat -unsat_core_generation=3 [2019-12-07 14:24:46,225 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:24:46,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:46,225 INFO L82 PathProgramCache]: Analyzing trace with hash 755042444, now seen corresponding path program 1 times [2019-12-07 14:24:46,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:24:46,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564315837] [2019-12-07 14:24:46,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:46,358 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:24:46,359 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:24:46,379 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:46,381 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:24:46,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564315837] [2019-12-07 14:24:46,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:24:46,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-12-07 14:24:46,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911996640] [2019-12-07 14:24:46,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:24:46,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:24:46,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:24:46,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:24:46,382 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 7 states. [2019-12-07 14:24:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:46,583 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2019-12-07 14:24:46,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:24:46,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-12-07 14:24:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:46,584 INFO L225 Difference]: With dead ends: 63 [2019-12-07 14:24:46,584 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 14:24:46,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:24:46,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 14:24:46,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2019-12-07 14:24:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 14:24:46,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2019-12-07 14:24:46,587 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 38 [2019-12-07 14:24:46,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:46,587 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2019-12-07 14:24:46,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:24:46,587 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2019-12-07 14:24:46,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 14:24:46,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:46,587 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:46,788 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3 [2019-12-07 14:24:46,788 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:24:46,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:46,789 INFO L82 PathProgramCache]: Analyzing trace with hash -252234739, now seen corresponding path program 1 times [2019-12-07 14:24:46,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:24:46,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508676726] [2019-12-07 14:24:46,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 38 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:46,987 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 14:24:46,987 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:24:47,112 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:24:47,193 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:24:47,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508676726] [2019-12-07 14:24:47,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:24:47,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 13 [2019-12-07 14:24:47,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407171208] [2019-12-07 14:24:47,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 14:24:47,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:24:47,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 14:24:47,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:24:47,194 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 14 states. [2019-12-07 14:24:47,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:47,645 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-12-07 14:24:47,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:24:47,646 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-12-07 14:24:47,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:47,646 INFO L225 Difference]: With dead ends: 61 [2019-12-07 14:24:47,646 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 14:24:47,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2019-12-07 14:24:47,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 14:24:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-12-07 14:24:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 14:24:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-12-07 14:24:47,648 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 40 [2019-12-07 14:24:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:47,648 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-12-07 14:24:47,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 14:24:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-12-07 14:24:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 14:24:47,648 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:47,648 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:47,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 mathsat -unsat_core_generation=3 [2019-12-07 14:24:47,849 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:24:47,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:47,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1867823965, now seen corresponding path program 1 times [2019-12-07 14:24:47,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:24:47,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859149790] [2019-12-07 14:24:47,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2019-12-07 14:24:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:48,048 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-07 14:24:48,049 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:48,052 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:24:48,052 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:48,053 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:48,054 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:48,054 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:24:48,072 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:48,073 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-12-07 14:24:48,073 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:48,088 INFO L614 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-12-07 14:24:48,089 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:48,089 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 14:24:48,101 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:24:48,101 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:48,110 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:48,111 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:48,111 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-12-07 14:24:48,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:48,130 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:24:48,130 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:48,142 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:48,142 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:48,142 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2019-12-07 14:24:48,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:48,224 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:48,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 113 [2019-12-07 14:24:48,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:24:48,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:24:48,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:48,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:48,227 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-12-07 14:24:48,295 INFO L614 ElimStorePlain]: treesize reduction 442, result has 10.9 percent of original size [2019-12-07 14:24:48,295 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:24:48,295 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:54 [2019-12-07 14:24:48,592 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:24:48,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:48,756 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 14:24:48,756 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:48,757 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 73 treesize of output 186 [2019-12-07 14:24:48,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:48,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:48,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:24:48,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:24:48,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:48,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:48,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:48,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:48,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:48,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:48,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:48,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:24:48,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:24:48,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:48,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:48,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:48,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:48,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:48,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:48,764 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 14:25:07,568 WARN L192 SmtUtils]: Spent 18.80 s on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2019-12-07 14:25:07,569 INFO L614 ElimStorePlain]: treesize reduction 3039, result has 4.0 percent of original size [2019-12-07 14:25:07,569 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:25:07,569 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:83, output treesize:89 [2019-12-07 14:25:07,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:25:07,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:25:07,697 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2019-12-07 14:25:07,698 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:07,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:07,708 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:07,708 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2019-12-07 14:25:07,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-07 14:25:07,749 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:07,754 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:07,755 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:07,755 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:17 [2019-12-07 14:25:07,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2019-12-07 14:25:07,820 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:07,828 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-07 14:25:07,828 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:25:07,828 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-12-07 14:25:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:25:07,877 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:25:08,066 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:25:08,070 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:08,070 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:25:08,070 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:22 [2019-12-07 14:25:10,206 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:25:10,210 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:10,210 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:25:10,210 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2019-12-07 14:25:19,664 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 20 [2019-12-07 14:25:25,811 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 14:25:25,825 INFO L614 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2019-12-07 14:25:25,826 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:25,826 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:19 [2019-12-07 14:25:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 14:25:27,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859149790] [2019-12-07 14:25:27,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [238782052] [2019-12-07 14:25:27,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:25:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,203 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 14:25:28,204 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:28,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:25:28,206 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:28,207 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:28,207 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:28,207 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:25:28,213 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:28,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 14:25:28,214 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:28,217 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:28,217 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:28,217 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-12-07 14:25:28,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:25:28,268 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:28,274 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:28,275 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:28,275 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 14:25:28,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:25:28,337 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:25:28,337 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:28,346 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:28,346 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:28,346 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-12-07 14:25:28,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:25:28,469 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:28,469 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 111 [2019-12-07 14:25:28,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:28,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:28,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:28,471 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-12-07 14:25:28,564 INFO L614 ElimStorePlain]: treesize reduction 604, result has 7.5 percent of original size [2019-12-07 14:25:28,564 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:25:28,564 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:49 [2019-12-07 14:25:29,640 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:25:29,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:25:29,870 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-07 14:25:29,870 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:29,870 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 238 [2019-12-07 14:25:29,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:29,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:29,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:29,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:29,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:29,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:29,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:29,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:29,875 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-12-07 14:25:46,371 WARN L192 SmtUtils]: Spent 16.50 s on a formula simplification. DAG size of input: 60 DAG size of output: 38 [2019-12-07 14:25:46,371 INFO L614 ElimStorePlain]: treesize reduction 874, result has 16.1 percent of original size [2019-12-07 14:25:46,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:46,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:46,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:46,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:46,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:46,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:46,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:46,374 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:25:46,375 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:129 [2019-12-07 14:25:46,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:48,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:25:48,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:25:48,742 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:48,743 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 31 [2019-12-07 14:25:48,743 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:48,752 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:48,752 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:48,753 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:34 [2019-12-07 14:25:48,817 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:48,817 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2019-12-07 14:25:48,817 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:48,821 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:48,821 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:48,821 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:12 [2019-12-07 14:25:48,860 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:48,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 34 [2019-12-07 14:25:48,861 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:48,876 INFO L614 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-12-07 14:25:48,876 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:25:48,876 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 14:25:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:25:48,922 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:25:48,925 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:25:48,929 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:48,929 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:25:48,930 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:24 [2019-12-07 14:25:51,386 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:25:51,391 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:51,391 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:25:51,391 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2019-12-07 14:25:57,010 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:57,011 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 51 treesize of output 55 [2019-12-07 14:25:57,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,011 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 14:25:57,022 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:57,022 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 14:25:57,022 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:40 [2019-12-07 14:25:57,327 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:25:57,328 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:57,332 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:57,333 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 14:25:57,346 INFO L614 ElimStorePlain]: treesize reduction 26, result has 13.3 percent of original size [2019-12-07 14:25:57,346 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:57,346 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:80, output treesize:4 [2019-12-07 14:25:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 14:25:57,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969207328] [2019-12-07 14:25:57,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:57,463 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 14:25:57,464 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:57,466 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:25:57,466 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:57,468 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:57,468 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:57,469 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:25:57,475 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:57,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 14:25:57,476 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:57,480 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:57,480 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:57,480 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-12-07 14:25:57,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:25:57,483 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:57,491 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:57,491 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:57,491 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 14:25:57,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:25:57,496 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:25:57,496 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:57,506 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:57,506 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:57,506 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-12-07 14:25:57,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:25:57,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:57,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 113 [2019-12-07 14:25:57,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,567 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:57,601 INFO L614 ElimStorePlain]: treesize reduction 46, result has 51.6 percent of original size [2019-12-07 14:25:57,601 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:25:57,601 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:49 [2019-12-07 14:25:57,702 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:25:57,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:25:57,949 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-07 14:25:57,950 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:57,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 238 [2019-12-07 14:25:57,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:57,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:57,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:57,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:57,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:57,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:57,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:57,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:57,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:57,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:57,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:57,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:57,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:57,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:57,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:57,963 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-12-07 14:26:10,703 WARN L192 SmtUtils]: Spent 12.74 s on a formula simplification. DAG size of input: 100 DAG size of output: 38 [2019-12-07 14:26:10,703 INFO L614 ElimStorePlain]: treesize reduction 7184, result has 1.9 percent of original size [2019-12-07 14:26:10,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:10,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:10,704 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:10,704 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:82 [2019-12-07 14:26:13,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:26:13,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:26:13,178 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:13,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 31 [2019-12-07 14:26:13,178 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:13,188 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:13,188 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:13,188 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:34 [2019-12-07 14:26:13,191 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:13,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2019-12-07 14:26:13,191 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:13,195 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:13,195 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:13,195 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:12 [2019-12-07 14:26:13,239 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:13,240 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 34 [2019-12-07 14:26:13,240 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:13,250 INFO L614 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-12-07 14:26:13,250 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:13,250 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 14:26:13,291 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:26:13,291 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:26:13,326 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:13,329 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:13,329 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:13,329 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:24 [2019-12-07 14:26:16,311 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:16,314 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:16,314 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:16,315 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-12-07 14:26:22,005 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:22,005 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 51 treesize of output 55 [2019-12-07 14:26:22,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:22,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:22,006 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 14:26:22,017 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:22,018 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 14:26:22,018 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:40 [2019-12-07 14:26:22,323 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:26:22,324 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:22,329 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:22,330 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 14:26:22,341 INFO L614 ElimStorePlain]: treesize reduction 26, result has 13.3 percent of original size [2019-12-07 14:26:22,341 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:22,342 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:80, output treesize:4 [2019-12-07 14:26:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 14:26:22,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:26:22,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 19, 17, 19, 17] total 48 [2019-12-07 14:26:22,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38508147] [2019-12-07 14:26:22,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-12-07 14:26:22,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:26:22,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-12-07 14:26:22,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2127, Unknown=3, NotChecked=0, Total=2352 [2019-12-07 14:26:22,354 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 49 states. [2019-12-07 14:26:24,324 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-07 14:26:24,774 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-07 14:26:25,418 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 14:26:25,741 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-07 14:26:30,230 WARN L192 SmtUtils]: Spent 3.90 s on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-12-07 14:26:34,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:34,452 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2019-12-07 14:26:34,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 14:26:34,452 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 43 [2019-12-07 14:26:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:34,453 INFO L225 Difference]: With dead ends: 81 [2019-12-07 14:26:34,453 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 14:26:34,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 173 SyntacticMatches, 32 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2457 ImplicationChecksByTransitivity, 50.4s TimeCoverageRelationStatistics Valid=543, Invalid=3876, Unknown=3, NotChecked=0, Total=4422 [2019-12-07 14:26:34,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 14:26:34,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2019-12-07 14:26:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 14:26:34,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2019-12-07 14:26:34,455 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 43 [2019-12-07 14:26:34,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:34,455 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2019-12-07 14:26:34,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-12-07 14:26:34,455 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2019-12-07 14:26:34,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 14:26:34,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:34,456 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:35,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3,40 cvc4 --incremental --print-success --lang smt --rewrite-divk,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:35,058 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:26:35,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:35,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1867823966, now seen corresponding path program 1 times [2019-12-07 14:26:35,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:26:35,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873679416] [2019-12-07 14:26:35,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/mathsat Starting monitored process 42 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with mathsat -unsat_core_generation=3 [2019-12-07 14:26:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:35,286 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 49 conjunts are in the unsatisfiable core [2019-12-07 14:26:35,287 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:35,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:26:35,292 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:35,299 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:35,301 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:26:35,301 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:35,305 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:35,305 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:35,305 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 14:26:35,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:26:35,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 14:26:35,323 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:35,333 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:35,339 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:35,339 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 14:26:35,339 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:35,347 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:35,347 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:35,347 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-12-07 14:26:35,365 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:26:35,365 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:35,383 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:35,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:26:35,386 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:35,402 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:35,402 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:35,402 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-12-07 14:26:35,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:26:35,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:26:35,434 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:35,459 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:35,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:26:35,464 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:26:35,464 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:35,486 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:35,486 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:35,486 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2019-12-07 14:26:35,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:26:35,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:26:35,524 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:26:35,538 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:35,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 70 [2019-12-07 14:26:35,539 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:35,601 INFO L614 ElimStorePlain]: treesize reduction 30, result has 76.0 percent of original size [2019-12-07 14:26:35,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:26:35,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-12-07 14:26:35,607 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:35,630 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:35,631 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:35,631 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:85 [2019-12-07 14:26:36,018 INFO L430 ElimStorePlain]: Different costs {7=[|v_#memory_$Pointer$.offset_261|], 15=[|v_#memory_$Pointer$.base_285|]} [2019-12-07 14:26:36,022 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:26:36,042 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:36,042 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 65 [2019-12-07 14:26:36,043 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:36,118 INFO L614 ElimStorePlain]: treesize reduction 26, result has 80.3 percent of original size [2019-12-07 14:26:36,121 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:26:36,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:26:36,224 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 14:26:36,224 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:36,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 84 treesize of output 165 [2019-12-07 14:26:36,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:36,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:36,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:26:36,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:36,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:36,227 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 14:26:36,359 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-12-07 14:26:36,359 INFO L614 ElimStorePlain]: treesize reduction 535, result has 14.0 percent of original size [2019-12-07 14:26:36,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:36,359 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:36,360 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:135, output treesize:53 [2019-12-07 14:26:36,471 INFO L430 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_262|], 6=[|v_#memory_$Pointer$.base_286|]} [2019-12-07 14:26:36,476 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2019-12-07 14:26:36,477 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:36,507 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:36,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:26:36,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:26:36,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2019-12-07 14:26:36,513 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:36,527 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:36,527 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:36,528 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:55 [2019-12-07 14:26:36,587 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-07 14:26:36,587 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:36,597 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:36,599 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 14:26:36,600 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:36,606 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:36,607 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:36,607 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:18 [2019-12-07 14:26:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:26:36,771 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:26:37,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:37,370 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:37,375 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:37,441 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:37,447 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:37,451 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:37,491 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:37,491 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 14:26:37,491 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:105, output treesize:71 [2019-12-07 14:26:38,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:38,024 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:38,029 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:38,103 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:38,107 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:38,113 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:38,141 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:38,141 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-12-07 14:26:38,142 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:71 [2019-12-07 14:26:38,998 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 14:26:39,980 WARN L192 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 14:26:43,757 WARN L192 SmtUtils]: Spent 1.70 s on a formula simplification that was a NOOP. DAG size: 38 [2019-12-07 14:26:45,706 WARN L192 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 38 [2019-12-07 14:26:50,850 WARN L192 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 14:26:56,954 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 14:26:56,959 INFO L430 ElimStorePlain]: Different costs {3=[v_prenex_19], 4=[v_prenex_20, |#memory_$Pointer$.offset|], 7=[|#memory_$Pointer$.base|]} [2019-12-07 14:26:56,969 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:26:56,998 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:57,974 WARN L192 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-12-07 14:26:57,974 INFO L614 ElimStorePlain]: treesize reduction 131, result has 78.7 percent of original size [2019-12-07 14:26:57,996 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:26:58,029 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:27:00,348 WARN L192 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-12-07 14:27:00,349 INFO L614 ElimStorePlain]: treesize reduction 157, result has 74.1 percent of original size [2019-12-07 14:27:00,354 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:27:00,361 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:27:01,944 WARN L192 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-12-07 14:27:01,944 INFO L614 ElimStorePlain]: treesize reduction 1271, result has 38.3 percent of original size [2019-12-07 14:27:01,949 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:27:01,960 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:27:32,439 WARN L192 SmtUtils]: Spent 30.47 s on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-12-07 14:27:32,440 INFO L343 Elim1Store]: treesize reduction 35, result has 65.3 percent of original size [2019-12-07 14:27:32,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 640 treesize of output 585 [2019-12-07 14:27:32,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,519 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:27:32,519 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 585 treesize of output 579 [2019-12-07 14:27:32,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:32,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:32,614 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:27:32,615 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_156], 1=[v_arrayElimCell_157]} [2019-12-07 14:27:32,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873679416] [2019-12-07 14:27:32,625 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@62d4a8d2 [2019-12-07 14:27:32,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1776719784] [2019-12-07 14:27:32,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/cvc4 Starting monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:27:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:32,966 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-07 14:27:32,967 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:27:32,968 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@62d4a8d2 [2019-12-07 14:27:32,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208317099] [2019-12-07 14:27:32,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dbc7b15-0807-4485-b277-4874be31c845/bin/utaipan/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:27:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:33,029 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 49 conjunts are in the unsatisfiable core [2019-12-07 14:27:33,030 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:27:33,031 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@62d4a8d2 [2019-12-07 14:27:33,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:27:33,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 14:27:33,031 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 14:27:33,031 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:27:33,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 mathsat -unsat_core_generation=3,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true,43 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:27:33,651 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 14:27:33,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:27:33 BoogieIcfgContainer [2019-12-07 14:27:33,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:27:33,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:27:33,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:27:33,652 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:27:33,652 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:23:57" (3/4) ... [2019-12-07 14:27:33,655 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 14:27:33,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:27:33,656 INFO L168 Benchmark]: Toolchain (without parser) took 216414.95 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 269.0 MB). Free memory was 947.0 MB in the beginning and 931.7 MB in the end (delta: 15.3 MB). Peak memory consumption was 284.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:27:33,656 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:27:33,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:27:33,656 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:27:33,657 INFO L168 Benchmark]: Boogie Preprocessor took 27.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:27:33,657 INFO L168 Benchmark]: RCFGBuilder took 344.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:27:33,657 INFO L168 Benchmark]: TraceAbstraction took 215654.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 131.6 MB). Free memory was 1.1 GB in the beginning and 931.7 MB in the end (delta: 140.9 MB). Peak memory consumption was 272.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:27:33,657 INFO L168 Benchmark]: Witness Printer took 3.47 ms. Allocated memory is still 1.3 GB. Free memory is still 931.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:27:33,659 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 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 344.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 215654.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 131.6 MB). Free memory was 1.1 GB in the beginning and 931.7 MB in the end (delta: 140.9 MB). Peak memory consumption was 272.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.47 ms. Allocated memory is still 1.3 GB. Free memory is still 931.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 594]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L614] const int len = 2; [L615] const int data = 1; [L575] DLL head = ((void *)0); [L576] COND TRUE len > 0 [L577] DLL new_head = (DLL) malloc(sizeof(struct node)); [L578] COND FALSE !(((void *)0) == new_head) [L581] new_head->data = data [L582] new_head->next = head [L583] new_head->prev = ((void *)0) [L584] COND FALSE !(\read(head)) [L587] head = new_head [L588] len-- [L576] COND TRUE len > 0 [L577] DLL new_head = (DLL) malloc(sizeof(struct node)); [L578] COND FALSE !(((void *)0) == new_head) [L581] new_head->data = data [L582] new_head->next = head [L583] new_head->prev = ((void *)0) [L584] COND TRUE \read(head) [L585] head->prev = new_head [L587] head = new_head [L588] len-- [L576] COND FALSE !(len > 0) [L590] return head; [L616] DLL s = dll_create(len, data); [L617] int i; [L618] i = len - 1 [L618] COND TRUE i >= 0 [L619] int new_data = i + len; [L607] COND TRUE index > 0 [L608] EXPR head->next [L608] head = head->next [L609] index-- [L607] COND FALSE !(index > 0) [L611] head->data = data [L618] i-- [L618] COND TRUE i >= 0 [L619] int new_data = i + len; [L607] COND FALSE !(index > 0) [L611] head->data = data [L618] i-- [L618] COND FALSE !(i >= 0) [L622] i = len - 1 [L622] COND FALSE !(i <= 0) [L593] COND TRUE \read(head) [L594] EXPR head->next [L594] DLL temp = head->next; [L595] free(head) [L595] free(head) [L595] free(head) [L596] head = temp [L593] COND TRUE \read(head) [L594] head->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 23 error locations. Result: UNKNOWN, OverallTime: 215.6s, OverallIterations: 21, TraceHistogramMax: 2, AutomataDifference: 30.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 785 SDtfs, 4043 SDslu, 2021 SDs, 0 SdLazy, 3408 SolverSat, 377 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2136 GetRequests, 1724 SyntacticMatches, 75 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3966 ImplicationChecksByTransitivity, 68.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 436 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 113.9s InterpolantComputationTime, 1042 NumberOfCodeBlocks, 1042 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2004 ConstructedInterpolants, 221 QuantifiedInterpolants, 665371 SizeOfPredicates, 388 NumberOfNonLiveVariables, 4708 ConjunctsInSsa, 502 ConjunctsInUnsatCore, 80 InterpolantComputations, 22 PerfectInterpolantSequences, 573/846 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...