./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_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_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 dd9e7bf35989cde866740706d77fd71a632fd664 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 dd9e7bf35989cde866740706d77fd71a632fd664 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:56:42,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:56:42,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:56:42,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:56:42,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:56:42,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:56:42,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:56:42,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:56:42,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:56:42,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:56:42,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:56:42,748 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:56:42,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:56:42,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:56:42,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:56:42,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:56:42,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:56:42,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:56:42,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:56:42,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:56:42,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:56:42,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:56:42,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:56:42,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:56:42,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:56:42,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:56:42,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:56:42,760 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:56:42,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:56:42,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:56:42,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:56:42,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:56:42,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:56:42,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:56:42,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:56:42,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:56:42,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:56:42,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:56:42,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:56:42,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:56:42,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:56:42,765 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 19:56:42,775 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:56:42,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:56:42,776 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:56:42,776 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:56:42,776 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:56:42,776 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:56:42,776 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:56:42,776 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:56:42,777 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:56:42,777 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:56:42,777 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:56:42,777 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:56:42,777 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:56:42,777 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:56:42,777 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:56:42,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:56:42,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:56:42,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:56:42,778 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:56:42,778 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 19:56:42,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:56:42,779 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:56:42,779 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:56:42,779 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 19:56:42,779 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 19:56:42,779 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 19:56:42,779 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:56:42,779 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:56:42,779 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:56:42,779 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:56:42,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:56:42,780 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:56:42,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:56:42,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:56:42,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:56:42,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:56:42,780 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:56:42,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:56:42,780 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:56:42,780 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:56:42,780 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_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 -> dd9e7bf35989cde866740706d77fd71a632fd664 [2019-12-07 19:56:42,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:56:42,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:56:42,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:56:42,889 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:56:42,889 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:56:42,890 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2019-12-07 19:56:42,927 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/data/e4ee1a717/88ae9819ac974175a5cf19f430dba340/FLAGbff244b98 [2019-12-07 19:56:43,438 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:56:43,439 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2019-12-07 19:56:43,447 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/data/e4ee1a717/88ae9819ac974175a5cf19f430dba340/FLAGbff244b98 [2019-12-07 19:56:43,911 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/data/e4ee1a717/88ae9819ac974175a5cf19f430dba340 [2019-12-07 19:56:43,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:56:43,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:56:43,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:56:43,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:56:43,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:56:43,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:56:43" (1/1) ... [2019-12-07 19:56:43,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1145ce58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:56:43, skipping insertion in model container [2019-12-07 19:56:43,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:56:43" (1/1) ... [2019-12-07 19:56:43,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:56:43,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:56:44,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:56:44,162 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:56:44,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:56:44,226 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:56:44,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:56:44 WrapperNode [2019-12-07 19:56:44,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:56:44,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:56:44,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:56:44,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:56:44,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:56:44" (1/1) ... [2019-12-07 19:56:44,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:56:44" (1/1) ... [2019-12-07 19:56:44,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:56:44,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:56:44,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:56:44,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:56:44,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:56:44" (1/1) ... [2019-12-07 19:56:44,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:56:44" (1/1) ... [2019-12-07 19:56:44,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:56:44" (1/1) ... [2019-12-07 19:56:44,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:56:44" (1/1) ... [2019-12-07 19:56:44,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:56:44" (1/1) ... [2019-12-07 19:56:44,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:56:44" (1/1) ... [2019-12-07 19:56:44,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:56:44" (1/1) ... [2019-12-07 19:56:44,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:56:44,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:56:44,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:56:44,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:56:44,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:56:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:56:44,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 19:56:44,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:56:44,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 19:56:44,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 19:56:44,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 19:56:44,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:56:44,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:56:44,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:56:44,626 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:56:44,626 INFO L287 CfgBuilder]: Removed 22 assume(true) statements. [2019-12-07 19:56:44,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:56:44 BoogieIcfgContainer [2019-12-07 19:56:44,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:56:44,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:56:44,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:56:44,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:56:44,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:56:43" (1/3) ... [2019-12-07 19:56:44,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d78571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:56:44, skipping insertion in model container [2019-12-07 19:56:44,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:56:44" (2/3) ... [2019-12-07 19:56:44,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d78571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:56:44, skipping insertion in model container [2019-12-07 19:56:44,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:56:44" (3/3) ... [2019-12-07 19:56:44,632 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2019-12-07 19:56:44,638 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:56:44,643 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2019-12-07 19:56:44,650 INFO L249 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2019-12-07 19:56:44,662 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:56:44,663 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 19:56:44,663 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:56:44,663 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:56:44,663 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:56:44,663 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:56:44,663 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:56:44,663 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:56:44,673 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-12-07 19:56:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 19:56:44,678 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:56:44,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 19:56:44,679 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:56:44,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:56:44,683 INFO L82 PathProgramCache]: Analyzing trace with hash 5461878, now seen corresponding path program 1 times [2019-12-07 19:56:44,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:56:44,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675460034] [2019-12-07 19:56:44,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:56:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:44,791 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 19:56:44,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675460034] [2019-12-07 19:56:44,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:56:44,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:56:44,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610025496] [2019-12-07 19:56:44,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:56:44,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:56:44,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:56:44,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:56:44,806 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2019-12-07 19:56:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:56:44,868 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2019-12-07 19:56:44,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:56:44,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 19:56:44,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:56:44,876 INFO L225 Difference]: With dead ends: 76 [2019-12-07 19:56:44,876 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 19:56:44,877 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 19:56:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 19:56:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2019-12-07 19:56:44,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 19:56:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-12-07 19:56:44,901 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 4 [2019-12-07 19:56:44,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:56:44,901 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-12-07 19:56:44,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:56:44,901 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-12-07 19:56:44,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 19:56:44,901 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:56:44,902 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 19:56:44,902 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:56:44,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:56:44,902 INFO L82 PathProgramCache]: Analyzing trace with hash 5461879, now seen corresponding path program 1 times [2019-12-07 19:56:44,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:56:44,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598097333] [2019-12-07 19:56:44,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:56:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:44,938 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 19:56:44,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598097333] [2019-12-07 19:56:44,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:56:44,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:56:44,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683107440] [2019-12-07 19:56:44,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:56:44,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:56:44,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:56:44,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:56:44,940 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 3 states. [2019-12-07 19:56:44,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:56:44,978 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2019-12-07 19:56:44,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:56:44,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 19:56:44,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:56:44,980 INFO L225 Difference]: With dead ends: 71 [2019-12-07 19:56:44,980 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 19:56:44,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:56:44,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 19:56:44,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 39. [2019-12-07 19:56:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 19:56:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-12-07 19:56:44,984 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 4 [2019-12-07 19:56:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:56:44,984 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-12-07 19:56:44,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:56:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-12-07 19:56:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 19:56:44,985 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:56:44,985 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 19:56:44,985 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:56:44,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:56:44,985 INFO L82 PathProgramCache]: Analyzing trace with hash 173998972, now seen corresponding path program 1 times [2019-12-07 19:56:44,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:56:44,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581717876] [2019-12-07 19:56:44,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:56:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:45,009 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 19:56:45,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581717876] [2019-12-07 19:56:45,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:56:45,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:56:45,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827164119] [2019-12-07 19:56:45,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:56:45,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:56:45,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:56:45,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:56:45,010 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 4 states. [2019-12-07 19:56:45,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:56:45,041 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2019-12-07 19:56:45,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:56:45,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-07 19:56:45,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:56:45,042 INFO L225 Difference]: With dead ends: 70 [2019-12-07 19:56:45,042 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 19:56:45,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 19:56:45,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 19:56:45,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 41. [2019-12-07 19:56:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 19:56:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-12-07 19:56:45,047 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 5 [2019-12-07 19:56:45,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:56:45,047 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-12-07 19:56:45,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:56:45,047 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-12-07 19:56:45,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 19:56:45,047 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:56:45,047 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 19:56:45,047 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:56:45,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:56:45,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1102380027, now seen corresponding path program 1 times [2019-12-07 19:56:45,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:56:45,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616390827] [2019-12-07 19:56:45,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:56:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:56:45,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616390827] [2019-12-07 19:56:45,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:56:45,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:56:45,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654711752] [2019-12-07 19:56:45,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:56:45,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:56:45,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:56:45,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:56:45,068 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 4 states. [2019-12-07 19:56:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:56:45,095 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2019-12-07 19:56:45,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:56:45,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 19:56:45,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:56:45,096 INFO L225 Difference]: With dead ends: 73 [2019-12-07 19:56:45,096 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 19:56:45,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:56:45,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 19:56:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 43. [2019-12-07 19:56:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 19:56:45,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-12-07 19:56:45,100 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 6 [2019-12-07 19:56:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:56:45,100 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-12-07 19:56:45,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:56:45,101 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2019-12-07 19:56:45,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 19:56:45,101 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:56:45,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 19:56:45,101 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:56:45,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:56:45,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1102464514, now seen corresponding path program 1 times [2019-12-07 19:56:45,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:56:45,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335185908] [2019-12-07 19:56:45,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:56:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:45,117 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 19:56:45,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335185908] [2019-12-07 19:56:45,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:56:45,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:56:45,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94132103] [2019-12-07 19:56:45,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:56:45,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:56:45,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:56:45,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:56:45,118 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 3 states. [2019-12-07 19:56:45,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:56:45,146 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-12-07 19:56:45,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:56:45,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-07 19:56:45,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:56:45,148 INFO L225 Difference]: With dead ends: 55 [2019-12-07 19:56:45,148 INFO L226 Difference]: Without dead ends: 54 [2019-12-07 19:56:45,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 19:56:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-07 19:56:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-12-07 19:56:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 19:56:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-12-07 19:56:45,152 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 6 [2019-12-07 19:56:45,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:56:45,152 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-12-07 19:56:45,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:56:45,152 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-12-07 19:56:45,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 19:56:45,153 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:56:45,153 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 19:56:45,153 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:56:45,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:56:45,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1102463319, now seen corresponding path program 1 times [2019-12-07 19:56:45,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:56:45,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375221446] [2019-12-07 19:56:45,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:56:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:45,184 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 19:56:45,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375221446] [2019-12-07 19:56:45,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:56:45,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:56:45,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882409845] [2019-12-07 19:56:45,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:56:45,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:56:45,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:56:45,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:56:45,186 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 5 states. [2019-12-07 19:56:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:56:45,230 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-12-07 19:56:45,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:56:45,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-12-07 19:56:45,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:56:45,231 INFO L225 Difference]: With dead ends: 51 [2019-12-07 19:56:45,231 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 19:56:45,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:56:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 19:56:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-12-07 19:56:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 19:56:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-12-07 19:56:45,234 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 6 [2019-12-07 19:56:45,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:56:45,234 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-12-07 19:56:45,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:56:45,234 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-12-07 19:56:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 19:56:45,234 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:56:45,234 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 19:56:45,234 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:56:45,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:56:45,235 INFO L82 PathProgramCache]: Analyzing trace with hash 953901427, now seen corresponding path program 1 times [2019-12-07 19:56:45,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:56:45,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344699865] [2019-12-07 19:56:45,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:56:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:45,263 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 19:56:45,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344699865] [2019-12-07 19:56:45,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:56:45,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:56:45,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093239410] [2019-12-07 19:56:45,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:56:45,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:56:45,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:56:45,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:56:45,264 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 4 states. [2019-12-07 19:56:45,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:56:45,308 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-12-07 19:56:45,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:56:45,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 19:56:45,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:56:45,309 INFO L225 Difference]: With dead ends: 56 [2019-12-07 19:56:45,309 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 19:56:45,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:56:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 19:56:45,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2019-12-07 19:56:45,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 19:56:45,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-12-07 19:56:45,313 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 6 [2019-12-07 19:56:45,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:56:45,313 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-12-07 19:56:45,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:56:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-12-07 19:56:45,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 19:56:45,313 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:56:45,314 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 19:56:45,314 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:56:45,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:56:45,314 INFO L82 PathProgramCache]: Analyzing trace with hash 953901428, now seen corresponding path program 1 times [2019-12-07 19:56:45,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:56:45,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499076245] [2019-12-07 19:56:45,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:56:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:45,348 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 19:56:45,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499076245] [2019-12-07 19:56:45,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:56:45,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:56:45,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796439546] [2019-12-07 19:56:45,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:56:45,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:56:45,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:56:45,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:56:45,350 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 4 states. [2019-12-07 19:56:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:56:45,387 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-12-07 19:56:45,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:56:45,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 19:56:45,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:56:45,388 INFO L225 Difference]: With dead ends: 43 [2019-12-07 19:56:45,388 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 19:56:45,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 19:56:45,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 19:56:45,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-12-07 19:56:45,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 19:56:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-12-07 19:56:45,391 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 6 [2019-12-07 19:56:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:56:45,391 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-12-07 19:56:45,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:56:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-12-07 19:56:45,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 19:56:45,391 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:56:45,391 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:56:45,392 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:56:45,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:56:45,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1211817931, now seen corresponding path program 1 times [2019-12-07 19:56:45,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:56:45,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457147596] [2019-12-07 19:56:45,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:56:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:45,420 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 19:56:45,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457147596] [2019-12-07 19:56:45,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204651224] [2019-12-07 19:56:45,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:56:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:45,465 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 19:56:45,469 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:56:45,485 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 19:56:45,485 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:56:45,494 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 19:56:45,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2055052022] [2019-12-07 19:56:45,513 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 19:56:45,514 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:56:45,518 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:56:45,523 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:56:45,524 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:56:45,634 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:45,938 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:45,960 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:46,608 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:46,638 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:46,674 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:47,254 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:56:47,607 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 97 [2019-12-07 19:56:48,136 WARN L192 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 99 [2019-12-07 19:56:48,755 WARN L192 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 104 [2019-12-07 19:56:48,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:56:48,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 10 [2019-12-07 19:56:48,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712883341] [2019-12-07 19:56:48,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:56:48,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:56:48,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:56:48,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:56:48,954 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2019-12-07 19:56:49,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:56:49,215 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-12-07 19:56:49,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:56:49,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-12-07 19:56:49,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:56:49,218 INFO L225 Difference]: With dead ends: 50 [2019-12-07 19:56:49,218 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 19:56:49,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:56:49,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 19:56:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2019-12-07 19:56:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 19:56:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-12-07 19:56:49,223 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 10 [2019-12-07 19:56:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:56:49,224 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-12-07 19:56:49,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:56:49,224 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-12-07 19:56:49,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 19:56:49,224 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:56:49,225 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:56:49,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:56:49,427 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:56:49,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:56:49,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1211821286, now seen corresponding path program 1 times [2019-12-07 19:56:49,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:56:49,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616109996] [2019-12-07 19:56:49,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:56:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:49,452 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 19:56:49,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616109996] [2019-12-07 19:56:49,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71966471] [2019-12-07 19:56:49,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:56:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:49,490 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 19:56:49,491 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:56:49,499 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 19:56:49,500 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:56:49,506 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 19:56:49,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [605248172] [2019-12-07 19:56:49,507 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 19:56:49,507 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:56:49,507 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:56:49,507 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:56:49,508 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:56:49,544 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:49,697 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:49,731 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:50,282 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:50,336 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:50,345 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:50,892 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:56:51,047 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-12-07 19:56:51,422 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 93 [2019-12-07 19:56:52,042 WARN L192 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 99 [2019-12-07 19:56:52,708 WARN L192 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 104 [2019-12-07 19:56:53,064 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-12-07 19:56:53,104 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:56:53,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:56:53,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2019-12-07 19:56:53,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856121930] [2019-12-07 19:56:53,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:56:53,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:56:53,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:56:53,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:56:53,105 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 5 states. [2019-12-07 19:56:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:56:53,115 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-12-07 19:56:53,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:56:53,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 19:56:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:56:53,116 INFO L225 Difference]: With dead ends: 45 [2019-12-07 19:56:53,116 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 19:56:53,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:56:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 19:56:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-12-07 19:56:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 19:56:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-12-07 19:56:53,118 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2019-12-07 19:56:53,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:56:53,118 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-12-07 19:56:53,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:56:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-12-07 19:56:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 19:56:53,119 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:56:53,119 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 19:56:53,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:56:53,320 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:56:53,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:56:53,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2105606657, now seen corresponding path program 2 times [2019-12-07 19:56:53,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:56:53,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227344622] [2019-12-07 19:56:53,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:56:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 19:56:53,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227344622] [2019-12-07 19:56:53,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:56:53,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:56:53,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005441135] [2019-12-07 19:56:53,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:56:53,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:56:53,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:56:53,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:56:53,386 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 7 states. [2019-12-07 19:56:53,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:56:53,470 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-12-07 19:56:53,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:56:53,471 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-07 19:56:53,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:56:53,471 INFO L225 Difference]: With dead ends: 62 [2019-12-07 19:56:53,471 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 19:56:53,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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 19:56:53,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 19:56:53,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2019-12-07 19:56:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 19:56:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2019-12-07 19:56:53,474 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 15 [2019-12-07 19:56:53,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:56:53,474 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2019-12-07 19:56:53,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:56:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2019-12-07 19:56:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 19:56:53,474 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:56:53,474 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 19:56:53,474 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:56:53,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:56:53,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2105606658, now seen corresponding path program 1 times [2019-12-07 19:56:53,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:56:53,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627405215] [2019-12-07 19:56:53,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:56:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:56:53,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627405215] [2019-12-07 19:56:53,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:56:53,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:56:53,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846429792] [2019-12-07 19:56:53,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:56:53,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:56:53,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:56:53,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:56:53,524 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 7 states. [2019-12-07 19:56:53,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:56:53,625 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2019-12-07 19:56:53,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:56:53,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-07 19:56:53,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:56:53,626 INFO L225 Difference]: With dead ends: 72 [2019-12-07 19:56:53,626 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 19:56:53,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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 19:56:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 19:56:53,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 48. [2019-12-07 19:56:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 19:56:53,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-12-07 19:56:53,629 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 15 [2019-12-07 19:56:53,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:56:53,629 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-12-07 19:56:53,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:56:53,629 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-12-07 19:56:53,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:56:53,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:56:53,629 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:56:53,630 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:56:53,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:56:53,630 INFO L82 PathProgramCache]: Analyzing trace with hash 558496412, now seen corresponding path program 1 times [2019-12-07 19:56:53,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:56:53,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20570399] [2019-12-07 19:56:53,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:56:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:56:53,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20570399] [2019-12-07 19:56:53,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840284509] [2019-12-07 19:56:53,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:56:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:53,780 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-07 19:56:53,781 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:56:53,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:56:53,894 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:56:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:56:53,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1268438563] [2019-12-07 19:56:53,954 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 19:56:53,954 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:56:53,954 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:56:53,954 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:56:53,955 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:56:53,981 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:54,136 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:54,143 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:54,672 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:54,696 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:54,713 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:56:55,348 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:56:55,660 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 93 [2019-12-07 19:56:56,072 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 97 [2019-12-07 19:56:56,713 WARN L192 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 99 [2019-12-07 19:56:57,407 WARN L192 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 104 [2019-12-07 19:56:58,089 WARN L192 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 100 [2019-12-07 19:56:58,238 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-12-07 19:56:58,625 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 90 [2019-12-07 19:56:58,626 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:56:58,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:56:58,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2019-12-07 19:56:58,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464825979] [2019-12-07 19:56:58,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 19:56:58,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:56:58,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 19:56:58,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2019-12-07 19:56:58,627 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 20 states. [2019-12-07 19:56:59,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:56:59,084 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-12-07 19:56:59,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:56:59,085 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 17 [2019-12-07 19:56:59,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:56:59,085 INFO L225 Difference]: With dead ends: 76 [2019-12-07 19:56:59,085 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 19:56:59,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=239, Invalid=1093, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 19:56:59,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 19:56:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2019-12-07 19:56:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 19:56:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2019-12-07 19:56:59,088 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 17 [2019-12-07 19:56:59,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:56:59,088 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2019-12-07 19:56:59,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 19:56:59,088 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2019-12-07 19:56:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:56:59,088 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:56:59,088 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:56:59,289 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:56:59,290 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:56:59,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:56:59,291 INFO L82 PathProgramCache]: Analyzing trace with hash 558496413, now seen corresponding path program 1 times [2019-12-07 19:56:59,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:56:59,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073391767] [2019-12-07 19:56:59,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:56:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:56:59,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073391767] [2019-12-07 19:56:59,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105738365] [2019-12-07 19:56:59,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:56:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:59,476 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 49 conjunts are in the unsatisfiable core [2019-12-07 19:56:59,478 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:56:59,687 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:56:59,687 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:56:59,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:56:59,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [486061142] [2019-12-07 19:56:59,911 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 19:56:59,911 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:56:59,911 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:56:59,911 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:56:59,911 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:56:59,949 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:00,100 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:00,107 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:00,620 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:00,644 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:00,669 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:01,303 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:57:01,655 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 95 [2019-12-07 19:57:02,120 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 97 [2019-12-07 19:57:02,861 WARN L192 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 99 [2019-12-07 19:57:03,595 WARN L192 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 104 [2019-12-07 19:57:04,387 WARN L192 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 100 [2019-12-07 19:57:04,556 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-12-07 19:57:04,930 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 90 [2019-12-07 19:57:04,931 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:57:04,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:57:04,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 27 [2019-12-07 19:57:04,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643140955] [2019-12-07 19:57:04,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 19:57:04,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:04,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 19:57:04,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1188, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 19:57:04,932 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 28 states. [2019-12-07 19:57:05,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:05,890 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2019-12-07 19:57:05,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:57:05,890 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 17 [2019-12-07 19:57:05,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:05,891 INFO L225 Difference]: With dead ends: 153 [2019-12-07 19:57:05,891 INFO L226 Difference]: Without dead ends: 153 [2019-12-07 19:57:05,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=375, Invalid=1787, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 19:57:05,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-12-07 19:57:05,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 57. [2019-12-07 19:57:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 19:57:05,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2019-12-07 19:57:05,894 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 17 [2019-12-07 19:57:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:05,894 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2019-12-07 19:57:05,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 19:57:05,895 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2019-12-07 19:57:05,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:57:05,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:05,895 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 19:57:06,096 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:06,097 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:57:06,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:06,098 INFO L82 PathProgramCache]: Analyzing trace with hash -158988772, now seen corresponding path program 2 times [2019-12-07 19:57:06,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:06,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26312299] [2019-12-07 19:57:06,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 19:57:06,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26312299] [2019-12-07 19:57:06,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:57:06,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:57:06,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773735453] [2019-12-07 19:57:06,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:57:06,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:06,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:57:06,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:57:06,141 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 6 states. [2019-12-07 19:57:06,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:06,166 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2019-12-07 19:57:06,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:57:06,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-07 19:57:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:06,167 INFO L225 Difference]: With dead ends: 46 [2019-12-07 19:57:06,167 INFO L226 Difference]: Without dead ends: 46 [2019-12-07 19:57:06,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:57:06,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-07 19:57:06,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-12-07 19:57:06,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 19:57:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2019-12-07 19:57:06,170 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 19 [2019-12-07 19:57:06,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:06,170 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-12-07 19:57:06,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:57:06,170 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2019-12-07 19:57:06,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 19:57:06,171 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:06,171 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:06,171 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:57:06,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:06,171 INFO L82 PathProgramCache]: Analyzing trace with hash 623890459, now seen corresponding path program 1 times [2019-12-07 19:57:06,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:06,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077263189] [2019-12-07 19:57:06,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 19:57:06,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077263189] [2019-12-07 19:57:06,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997916480] [2019-12-07 19:57:06,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:57:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:06,240 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 19:57:06,241 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 19:57:06,256 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 19:57:06,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [341589055] [2019-12-07 19:57:06,267 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 19:57:06,267 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:57:06,267 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:57:06,267 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:57:06,268 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:57:06,289 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:06,445 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:06,483 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:06,959 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:07,098 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:07,216 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:07,475 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:57:07,765 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-12-07 19:57:07,925 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-12-07 19:57:08,141 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-12-07 19:57:08,442 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-12-07 19:57:08,678 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-12-07 19:57:08,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:57:08,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4, 4, 4] total 17 [2019-12-07 19:57:08,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444412797] [2019-12-07 19:57:08,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:57:08,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:08,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:57:08,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-12-07 19:57:08,680 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 11 states. [2019-12-07 19:57:08,899 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2019-12-07 19:57:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:09,047 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2019-12-07 19:57:09,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 19:57:09,047 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-07 19:57:09,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:09,048 INFO L225 Difference]: With dead ends: 84 [2019-12-07 19:57:09,048 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 19:57:09,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-12-07 19:57:09,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 19:57:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 48. [2019-12-07 19:57:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 19:57:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-12-07 19:57:09,050 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 21 [2019-12-07 19:57:09,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:09,050 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-12-07 19:57:09,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:57:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-12-07 19:57:09,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 19:57:09,051 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:09,051 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:09,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:09,253 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:57:09,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:09,253 INFO L82 PathProgramCache]: Analyzing trace with hash 623888127, now seen corresponding path program 1 times [2019-12-07 19:57:09,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:09,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892950063] [2019-12-07 19:57:09,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 19:57:09,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892950063] [2019-12-07 19:57:09,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289888746] [2019-12-07 19:57:09,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:57:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:09,323 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 19:57:09,324 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 19:57:09,338 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 19:57:09,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1306280963] [2019-12-07 19:57:09,347 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 19:57:09,347 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:57:09,348 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:57:09,348 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:57:09,348 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:57:09,375 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:09,535 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:09,557 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:10,014 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:10,150 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:10,265 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:10,516 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:57:10,721 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 88 [2019-12-07 19:57:11,178 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-12-07 19:57:11,411 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-12-07 19:57:11,749 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-12-07 19:57:11,991 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-12-07 19:57:12,052 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:57:12,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:57:12,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2019-12-07 19:57:12,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768540577] [2019-12-07 19:57:12,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:57:12,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:12,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:57:12,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-07 19:57:12,053 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 8 states. [2019-12-07 19:57:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:12,265 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2019-12-07 19:57:12,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 19:57:12,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-12-07 19:57:12,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:12,266 INFO L225 Difference]: With dead ends: 136 [2019-12-07 19:57:12,266 INFO L226 Difference]: Without dead ends: 136 [2019-12-07 19:57:12,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=212, Invalid=844, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 19:57:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-12-07 19:57:12,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 59. [2019-12-07 19:57:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 19:57:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2019-12-07 19:57:12,269 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 21 [2019-12-07 19:57:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:12,269 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2019-12-07 19:57:12,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:57:12,269 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2019-12-07 19:57:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:57:12,269 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:12,269 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-12-07 19:57:12,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:12,471 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:57:12,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:12,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2052851420, now seen corresponding path program 1 times [2019-12-07 19:57:12,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:12,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603992295] [2019-12-07 19:57:12,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 19:57:12,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603992295] [2019-12-07 19:57:12,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390604798] [2019-12-07 19:57:12,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:57:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:12,546 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 19:57:12,547 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 19:57:12,553 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 19:57:12,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1237750013] [2019-12-07 19:57:12,565 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 19:57:12,565 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:57:12,565 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:57:12,565 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:57:12,565 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:57:12,591 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:12,722 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:12,757 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:13,275 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:13,325 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:13,331 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:13,847 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:14,230 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:57:14,673 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 86 [2019-12-07 19:57:15,245 WARN L192 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 99 [2019-12-07 19:57:15,891 WARN L192 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 104 [2019-12-07 19:57:16,142 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-12-07 19:57:16,276 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-12-07 19:57:16,398 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:57:16,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:57:16,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2019-12-07 19:57:16,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273309713] [2019-12-07 19:57:16,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:57:16,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:16,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:57:16,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:57:16,399 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand 8 states. [2019-12-07 19:57:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:16,489 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2019-12-07 19:57:16,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:57:16,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-07 19:57:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:16,489 INFO L225 Difference]: With dead ends: 61 [2019-12-07 19:57:16,489 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 19:57:16,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2019-12-07 19:57:16,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 19:57:16,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2019-12-07 19:57:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 19:57:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2019-12-07 19:57:16,491 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 22 [2019-12-07 19:57:16,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:16,492 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2019-12-07 19:57:16,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:57:16,492 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2019-12-07 19:57:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 19:57:16,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:16,493 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:16,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:16,694 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:57:16,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:16,695 INFO L82 PathProgramCache]: Analyzing trace with hash 193501120, now seen corresponding path program 1 times [2019-12-07 19:57:16,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:16,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658106988] [2019-12-07 19:57:16,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 19:57:16,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658106988] [2019-12-07 19:57:16,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:57:16,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:57:16,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594695330] [2019-12-07 19:57:16,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:57:16,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:16,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:57:16,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:57:16,759 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand 7 states. [2019-12-07 19:57:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:16,849 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2019-12-07 19:57:16,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:57:16,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-12-07 19:57:16,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:16,850 INFO L225 Difference]: With dead ends: 71 [2019-12-07 19:57:16,850 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 19:57:16,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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 19:57:16,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 19:57:16,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 55. [2019-12-07 19:57:16,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 19:57:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-12-07 19:57:16,851 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 24 [2019-12-07 19:57:16,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:16,852 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-12-07 19:57:16,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:57:16,852 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-12-07 19:57:16,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 19:57:16,852 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:16,852 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:16,852 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:57:16,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:16,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1271041590, now seen corresponding path program 1 times [2019-12-07 19:57:16,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:16,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269706294] [2019-12-07 19:57:16,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:57:17,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269706294] [2019-12-07 19:57:17,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211767883] [2019-12-07 19:57:17,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:57:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:17,090 INFO L264 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 56 conjunts are in the unsatisfiable core [2019-12-07 19:57:17,092 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:57:17,268 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:57:17,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1357214493] [2019-12-07 19:57:17,592 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 19:57:17,592 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:57:17,592 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:57:17,592 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:57:17,592 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:57:17,629 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:17,824 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:17,843 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:18,316 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:18,430 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:18,542 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:18,798 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:57:18,977 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-12-07 19:57:19,450 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-12-07 19:57:19,815 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-12-07 19:57:20,227 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-12-07 19:57:20,657 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-12-07 19:57:20,882 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-12-07 19:57:21,075 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-12-07 19:57:21,273 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-12-07 19:57:21,273 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:57:21,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:57:21,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 29 [2019-12-07 19:57:21,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455885358] [2019-12-07 19:57:21,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 19:57:21,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:21,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 19:57:21,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1582, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 19:57:21,275 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 30 states. [2019-12-07 19:57:22,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:22,280 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2019-12-07 19:57:22,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 19:57:22,280 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 26 [2019-12-07 19:57:22,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:22,281 INFO L225 Difference]: With dead ends: 95 [2019-12-07 19:57:22,281 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 19:57:22,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=396, Invalid=2910, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 19:57:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 19:57:22,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 61. [2019-12-07 19:57:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 19:57:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2019-12-07 19:57:22,284 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 26 [2019-12-07 19:57:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:22,284 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2019-12-07 19:57:22,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 19:57:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2019-12-07 19:57:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 19:57:22,285 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:22,285 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:22,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:22,486 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:57:22,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:22,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1271041591, now seen corresponding path program 1 times [2019-12-07 19:57:22,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:22,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477132156] [2019-12-07 19:57:22,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:57:22,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477132156] [2019-12-07 19:57:22,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17483655] [2019-12-07 19:57:22,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:57:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:22,857 INFO L264 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 65 conjunts are in the unsatisfiable core [2019-12-07 19:57:22,858 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:57:23,201 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:23,483 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-12-07 19:57:24,542 WARN L192 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 22 [2019-12-07 19:57:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:57:24,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1148900515] [2019-12-07 19:57:24,661 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 19:57:24,661 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:57:24,662 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:57:24,662 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:57:24,662 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:57:24,692 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:24,827 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:24,857 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:25,320 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:25,427 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:25,530 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:25,794 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:57:25,991 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-12-07 19:57:26,636 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-12-07 19:57:27,432 WARN L192 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-12-07 19:57:27,920 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-12-07 19:57:28,609 WARN L192 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-12-07 19:57:29,095 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-12-07 19:57:29,478 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-12-07 19:57:29,779 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-12-07 19:57:29,780 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:57:29,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:57:29,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 35 [2019-12-07 19:57:29,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372942287] [2019-12-07 19:57:29,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 19:57:29,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:29,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 19:57:29,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2077, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 19:57:29,781 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand 36 states. [2019-12-07 19:57:31,537 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-12-07 19:57:31,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:31,800 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2019-12-07 19:57:31,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 19:57:31,800 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 26 [2019-12-07 19:57:31,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:31,801 INFO L225 Difference]: With dead ends: 135 [2019-12-07 19:57:31,801 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 19:57:31,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=554, Invalid=3606, Unknown=0, NotChecked=0, Total=4160 [2019-12-07 19:57:31,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 19:57:31,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 60. [2019-12-07 19:57:31,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 19:57:31,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2019-12-07 19:57:31,804 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 26 [2019-12-07 19:57:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:31,804 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2019-12-07 19:57:31,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 19:57:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2019-12-07 19:57:31,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 19:57:31,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:31,805 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:32,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:32,005 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:57:32,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:32,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1700316018, now seen corresponding path program 1 times [2019-12-07 19:57:32,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:32,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741299374] [2019-12-07 19:57:32,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:57:32,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741299374] [2019-12-07 19:57:32,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153008582] [2019-12-07 19:57:32,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:57:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:32,483 INFO L264 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 81 conjunts are in the unsatisfiable core [2019-12-07 19:57:32,485 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:33,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:57:33,057 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:33,944 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-12-07 19:57:38,291 WARN L192 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 175 DAG size of output: 97 [2019-12-07 19:57:53,138 WARN L192 SmtUtils]: Spent 14.28 s on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-12-07 19:57:53,682 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@10daef34 [2019-12-07 19:57:53,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1807060185] [2019-12-07 19:57:53,683 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 19:57:53,683 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:57:53,683 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:57:53,683 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:57:53,683 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:57:53,689 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@10daef34 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 19:57:53,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:57:53,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-12-07 19:57:53,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404761092] [2019-12-07 19:57:53,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 19:57:53,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:53,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 19:57:53,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1679, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 19:57:53,691 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand 19 states. [2019-12-07 19:57:53,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 19:57:53,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:53,892 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@10daef34 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 19:57:53,895 INFO L168 Benchmark]: Toolchain (without parser) took 69980.49 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 523.2 MB). Free memory was 937.2 MB in the beginning and 883.9 MB in the end (delta: 53.3 MB). Peak memory consumption was 576.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:57:53,895 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:57:53,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:57:53,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.15 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 19:57:53,895 INFO L168 Benchmark]: Boogie Preprocessor took 20.81 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 19:57:53,895 INFO L168 Benchmark]: RCFGBuilder took 346.65 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-12-07 19:57:53,896 INFO L168 Benchmark]: TraceAbstraction took 69266.30 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 420.5 MB). Free memory was 1.0 GB in the beginning and 883.9 MB in the end (delta: 141.7 MB). Peak memory consumption was 562.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:57:53,896 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 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.15 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 20.81 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 346.65 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 69266.30 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 420.5 MB). Free memory was 1.0 GB in the beginning and 883.9 MB in the end (delta: 141.7 MB). Peak memory consumption was 562.1 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@10daef34 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@10daef34: 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 19:57:55,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:57:55,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:57:55,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:57:55,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:57:55,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:57:55,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:57:55,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:57:55,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:57:55,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:57:55,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:57:55,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:57:55,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:57:55,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:57:55,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:57:55,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:57:55,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:57:55,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:57:55,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:57:55,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:57:55,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:57:55,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:57:55,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:57:55,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:57:55,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:57:55,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:57:55,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:57:55,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:57:55,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:57:55,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:57:55,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:57:55,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:57:55,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:57:55,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:57:55,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:57:55,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:57:55,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:57:55,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:57:55,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:57:55,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:57:55,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:57:55,293 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 19:57:55,305 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:57:55,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:57:55,306 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:57:55,306 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:57:55,306 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:57:55,306 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:57:55,306 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:57:55,306 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:57:55,307 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:57:55,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:57:55,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:57:55,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:57:55,308 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:57:55,308 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 19:57:55,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:57:55,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:57:55,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:57:55,308 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 19:57:55,309 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 19:57:55,309 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 19:57:55,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:57:55,309 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:57:55,309 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 19:57:55,309 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 19:57:55,309 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:57:55,309 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:57:55,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:57:55,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 19:57:55,310 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:57:55,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:57:55,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:57:55,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:57:55,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:57:55,311 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 19:57:55,311 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 19:57:55,311 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:57:55,311 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:57:55,311 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_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 -> dd9e7bf35989cde866740706d77fd71a632fd664 [2019-12-07 19:57:55,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:57:55,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:57:55,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:57:55,483 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:57:55,484 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:57:55,484 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2019-12-07 19:57:55,523 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/data/c1b6e0112/52171aee651046d8ac117c9468228e78/FLAG9a14c3887 [2019-12-07 19:57:55,967 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:57:55,967 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2019-12-07 19:57:55,976 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/data/c1b6e0112/52171aee651046d8ac117c9468228e78/FLAG9a14c3887 [2019-12-07 19:57:56,297 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/data/c1b6e0112/52171aee651046d8ac117c9468228e78 [2019-12-07 19:57:56,299 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:57:56,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:57:56,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:57:56,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:57:56,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:57:56,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:57:56" (1/1) ... [2019-12-07 19:57:56,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@320dfb8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:56, skipping insertion in model container [2019-12-07 19:57:56,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:57:56" (1/1) ... [2019-12-07 19:57:56,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:57:56,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:57:56,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:57:56,554 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:57:56,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:57:56,625 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:57:56,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:56 WrapperNode [2019-12-07 19:57:56,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:57:56,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:57:56,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:57:56,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:57:56,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:56" (1/1) ... [2019-12-07 19:57:56,644 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:56" (1/1) ... [2019-12-07 19:57:56,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:57:56,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:57:56,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:57:56,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:57:56,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:56" (1/1) ... [2019-12-07 19:57:56,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:56" (1/1) ... [2019-12-07 19:57:56,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:56" (1/1) ... [2019-12-07 19:57:56,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:56" (1/1) ... [2019-12-07 19:57:56,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:56" (1/1) ... [2019-12-07 19:57:56,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:56" (1/1) ... [2019-12-07 19:57:56,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:56" (1/1) ... [2019-12-07 19:57:56,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:57:56,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:57:56,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:57:56,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:57:56,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:57:56,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 19:57:56,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 19:57:56,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 19:57:56,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 19:57:56,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:57:56,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 19:57:56,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:57:56,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:57:57,023 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:57:57,023 INFO L287 CfgBuilder]: Removed 22 assume(true) statements. [2019-12-07 19:57:57,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:57:57 BoogieIcfgContainer [2019-12-07 19:57:57,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:57:57,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:57:57,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:57:57,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:57:57,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:57:56" (1/3) ... [2019-12-07 19:57:57,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dcbc214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:57:57, skipping insertion in model container [2019-12-07 19:57:57,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:56" (2/3) ... [2019-12-07 19:57:57,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dcbc214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:57:57, skipping insertion in model container [2019-12-07 19:57:57,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:57:57" (3/3) ... [2019-12-07 19:57:57,029 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2019-12-07 19:57:57,035 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:57:57,040 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2019-12-07 19:57:57,048 INFO L249 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2019-12-07 19:57:57,061 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:57:57,061 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 19:57:57,061 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:57:57,061 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:57:57,061 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:57:57,061 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:57:57,061 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:57:57,061 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:57:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-12-07 19:57:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 19:57:57,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:57,078 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 19:57:57,078 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:57:57,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:57,082 INFO L82 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2019-12-07 19:57:57,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:57:57,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110034012] [2019-12-07 19:57:57,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:57:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:57,136 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 19:57:57,140 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:57,175 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 19:57:57,175 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:57:57,180 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:57:57,180 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:57:57,180 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:57:57,187 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 19:57:57,187 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:57,190 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 19:57:57,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110034012] [2019-12-07 19:57:57,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:57:57,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 19:57:57,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670852989] [2019-12-07 19:57:57,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:57:57,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:57:57,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:57:57,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:57:57,205 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 3 states. [2019-12-07 19:57:57,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:57,314 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2019-12-07 19:57:57,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:57:57,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 19:57:57,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:57,323 INFO L225 Difference]: With dead ends: 107 [2019-12-07 19:57:57,323 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 19:57:57,324 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 19:57:57,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 19:57:57,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 58. [2019-12-07 19:57:57,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 19:57:57,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2019-12-07 19:57:57,352 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 5 [2019-12-07 19:57:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:57,352 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2019-12-07 19:57:57,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:57:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2019-12-07 19:57:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 19:57:57,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:57,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 19:57:57,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 19:57:57,554 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:57:57,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:57,556 INFO L82 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2019-12-07 19:57:57,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:57:57,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566980820] [2019-12-07 19:57:57,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:57:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:57,624 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 19:57:57,624 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:57,631 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 19:57:57,631 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:57:57,636 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:57:57,636 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:57:57,636 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 19:57:57,643 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 19:57:57,644 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:57,683 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 19:57:57,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566980820] [2019-12-07 19:57:57,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:57:57,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 19:57:57,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894960230] [2019-12-07 19:57:57,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:57:57,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:57:57,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:57:57,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:57:57,685 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 4 states. [2019-12-07 19:57:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:57,828 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2019-12-07 19:57:57,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:57:57,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-07 19:57:57,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:57,830 INFO L225 Difference]: With dead ends: 100 [2019-12-07 19:57:57,830 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 19:57:57,831 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 19:57:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 19:57:57,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 56. [2019-12-07 19:57:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 19:57:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-12-07 19:57:57,838 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 5 [2019-12-07 19:57:57,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:57,838 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-12-07 19:57:57,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:57:57,839 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-12-07 19:57:57,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 19:57:57,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:57,839 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:58,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 19:57:58,040 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:57:58,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:58,041 INFO L82 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2019-12-07 19:57:58,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:57:58,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934791190] [2019-12-07 19:57:58,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:57:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:58,074 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 19:57:58,075 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:58,080 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 19:57:58,080 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:58,087 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 19:57:58,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934791190] [2019-12-07 19:57:58,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:57:58,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 19:57:58,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322652463] [2019-12-07 19:57:58,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:57:58,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:57:58,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:57:58,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:57:58,088 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 4 states. [2019-12-07 19:57:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:58,105 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2019-12-07 19:57:58,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:57:58,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 19:57:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:58,107 INFO L225 Difference]: With dead ends: 68 [2019-12-07 19:57:58,107 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 19:57:58,107 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 19:57:58,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 19:57:58,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-12-07 19:57:58,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 19:57:58,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2019-12-07 19:57:58,112 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 8 [2019-12-07 19:57:58,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:58,112 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2019-12-07 19:57:58,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:57:58,112 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2019-12-07 19:57:58,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 19:57:58,112 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:58,113 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:58,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 19:57:58,314 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:57:58,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:58,315 INFO L82 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2019-12-07 19:57:58,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:57:58,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258955951] [2019-12-07 19:57:58,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:57:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:58,415 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 19:57:58,416 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:58,422 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 19:57:58,422 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:57:58,426 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:57:58,427 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:57:58,427 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:57:58,441 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 19:57:58,441 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:58,444 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 19:57:58,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258955951] [2019-12-07 19:57:58,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:57:58,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 19:57:58,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942163357] [2019-12-07 19:57:58,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:57:58,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:57:58,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:57:58,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:57:58,446 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 5 states. [2019-12-07 19:57:58,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:58,627 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2019-12-07 19:57:58,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:57:58,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 19:57:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:58,629 INFO L225 Difference]: With dead ends: 79 [2019-12-07 19:57:58,629 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 19:57:58,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:57:58,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 19:57:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2019-12-07 19:57:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 19:57:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2019-12-07 19:57:58,633 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 9 [2019-12-07 19:57:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:58,634 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2019-12-07 19:57:58,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:57:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2019-12-07 19:57:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 19:57:58,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:58,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:58,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 19:57:58,837 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:57:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:58,838 INFO L82 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2019-12-07 19:57:58,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:57:58,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587847387] [2019-12-07 19:57:58,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:57:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:58,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 19:57:58,919 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:58,925 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 19:57:58,925 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:57:58,929 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:57:58,930 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:57:58,930 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 19:57:58,957 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 19:57:58,957 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:59,069 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 19:57:59,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587847387] [2019-12-07 19:57:59,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:57:59,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 19:57:59,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032352287] [2019-12-07 19:57:59,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:57:59,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:57:59,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:57:59,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:57:59,071 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 8 states. [2019-12-07 19:57:59,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:59,283 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-12-07 19:57:59,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:57:59,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-12-07 19:57:59,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:59,284 INFO L225 Difference]: With dead ends: 64 [2019-12-07 19:57:59,284 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 19:57:59,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:57:59,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 19:57:59,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-12-07 19:57:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 19:57:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2019-12-07 19:57:59,288 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 9 [2019-12-07 19:57:59,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:59,288 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2019-12-07 19:57:59,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:57:59,288 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2019-12-07 19:57:59,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 19:57:59,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:59,289 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:59,490 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 19:57:59,491 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:57:59,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:59,492 INFO L82 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 1 times [2019-12-07 19:57:59,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:57:59,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900057055] [2019-12-07 19:57:59,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 19:57:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:59,608 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 19:57:59,610 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:57:59,627 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:57:59,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900057055] [2019-12-07 19:57:59,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:57:59,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 19:57:59,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596219845] [2019-12-07 19:57:59,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:57:59,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:57:59,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:57:59,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:57:59,660 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 8 states. [2019-12-07 19:57:59,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:59,734 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2019-12-07 19:57:59,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:57:59,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-12-07 19:57:59,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:59,735 INFO L225 Difference]: With dead ends: 94 [2019-12-07 19:57:59,735 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 19:57:59,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 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 19:57:59,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 19:57:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 67. [2019-12-07 19:57:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 19:57:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2019-12-07 19:57:59,739 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 26 [2019-12-07 19:57:59,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:59,739 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2019-12-07 19:57:59,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:57:59,739 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2019-12-07 19:57:59,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 19:57:59,740 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:59,740 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:59,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 19:57:59,941 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:57:59,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:59,942 INFO L82 PathProgramCache]: Analyzing trace with hash 2130913225, now seen corresponding path program 1 times [2019-12-07 19:57:59,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:57:59,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779181176] [2019-12-07 19:57:59,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 19:58:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:00,048 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 19:58:00,049 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:00,053 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 19:58:00,053 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:00,055 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:00,055 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:00,055 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:58:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:58:00,099 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:58:00,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779181176] [2019-12-07 19:58:00,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:58:00,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-12-07 19:58:00,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532164960] [2019-12-07 19:58:00,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:58:00,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:58:00,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:58:00,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:58:00,106 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 9 states. [2019-12-07 19:58:00,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:58:00,574 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2019-12-07 19:58:00,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:58:00,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-12-07 19:58:00,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:58:00,575 INFO L225 Difference]: With dead ends: 86 [2019-12-07 19:58:00,575 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 19:58:00,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:58:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 19:58:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2019-12-07 19:58:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 19:58:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2019-12-07 19:58:00,579 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 26 [2019-12-07 19:58:00,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:58:00,579 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2019-12-07 19:58:00,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:58:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2019-12-07 19:58:00,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 19:58:00,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:58:00,580 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:58:00,780 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 19:58:00,781 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:58:00,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:58:00,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2130913226, now seen corresponding path program 1 times [2019-12-07 19:58:00,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:58:00,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054010644] [2019-12-07 19:58:00,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:58:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:00,899 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 19:58:00,900 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:00,904 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 19:58:00,905 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:00,908 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:00,909 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:00,909 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 19:58:00,981 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:58:00,981 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:58:01,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054010644] [2019-12-07 19:58:01,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:58:01,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-12-07 19:58:01,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057864367] [2019-12-07 19:58:01,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 19:58:01,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:58:01,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 19:58:01,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:58:01,429 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 16 states. [2019-12-07 19:58:02,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:58:02,494 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2019-12-07 19:58:02,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:58:02,495 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-12-07 19:58:02,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:58:02,496 INFO L225 Difference]: With dead ends: 105 [2019-12-07 19:58:02,496 INFO L226 Difference]: Without dead ends: 105 [2019-12-07 19:58:02,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2019-12-07 19:58:02,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-12-07 19:58:02,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-12-07 19:58:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 19:58:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2019-12-07 19:58:02,500 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 26 [2019-12-07 19:58:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:58:02,500 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2019-12-07 19:58:02,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 19:58:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2019-12-07 19:58:02,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 19:58:02,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:58:02,501 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 19:58:02,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 19:58:02,702 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:58:02,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:58:02,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2019-12-07 19:58:02,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:58:02,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426429451] [2019-12-07 19:58:02,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 19:58:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:02,801 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 19:58:02,802 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:02,806 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 19:58:02,806 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:02,808 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:02,808 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:02,808 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:58:02,841 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:02,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-12-07 19:58:02,842 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:02,858 INFO L614 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-12-07 19:58:02,859 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 19:58:02,859 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-12-07 19:58:02,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 19:58:02,905 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:02,911 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:02,912 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 19:58:02,912 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2019-12-07 19:58:03,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 19:58:03,005 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:03,006 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:03,007 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 19:58:03,007 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2019-12-07 19:58:03,042 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:58:03,042 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:58:03,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426429451] [2019-12-07 19:58:03,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1695562658] [2019-12-07 19:58:03,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:58:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:03,403 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 19:58:03,405 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:03,408 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 19:58:03,408 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:03,409 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:03,409 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:03,410 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:58:03,423 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:03,423 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-12-07 19:58:03,424 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:03,438 INFO L614 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-12-07 19:58:03,438 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:03,438 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-12-07 19:58:03,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 19:58:03,547 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:03,555 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:03,556 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 19:58:03,556 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:22 [2019-12-07 19:58:03,748 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 19:58:03,748 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:03,755 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:03,755 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 19:58:03,755 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:15 [2019-12-07 19:58:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:58:03,782 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:58:03,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25674701] [2019-12-07 19:58:03,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:58:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:03,930 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 19:58:03,932 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:03,934 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 19:58:03,934 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:03,936 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:03,936 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:03,936 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:58:03,953 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:03,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 19:58:03,954 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:03,970 INFO L614 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-12-07 19:58:03,971 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 19:58:03,971 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2019-12-07 19:58:04,149 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 19:58:04,149 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:04,160 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:04,160 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 19:58:04,161 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:32 [2019-12-07 19:58:04,542 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 19:58:04,542 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:04,548 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:04,548 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 19:58:04,549 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2019-12-07 19:58:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:58:04,679 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:58:04,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 19:58:04,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15, 12, 15, 13] total 42 [2019-12-07 19:58:04,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456487972] [2019-12-07 19:58:04,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-07 19:58:04,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:58:04,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 19:58:04,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1657, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 19:58:04,969 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 43 states. [2019-12-07 19:58:06,619 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-12-07 19:58:06,941 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2019-12-07 19:58:07,259 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 83 [2019-12-07 19:58:07,463 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-12-07 19:58:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:58:08,013 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-12-07 19:58:08,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 19:58:08,013 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 29 [2019-12-07 19:58:08,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:58:08,014 INFO L225 Difference]: With dead ends: 104 [2019-12-07 19:58:08,015 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 19:58:08,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 118 SyntacticMatches, 11 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=615, Invalid=2807, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 19:58:08,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 19:58:08,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2019-12-07 19:58:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 19:58:08,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2019-12-07 19:58:08,019 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 29 [2019-12-07 19:58:08,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:58:08,020 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2019-12-07 19:58:08,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-07 19:58:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2019-12-07 19:58:08,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 19:58:08,020 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:58:08,020 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 19:58:08,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:58:08,623 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:58:08,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:58:08,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1875687585, now seen corresponding path program 1 times [2019-12-07 19:58:08,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:58:08,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201353537] [2019-12-07 19:58:08,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 19:58:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:08,759 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 19:58:08,760 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:08,764 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 19:58:08,764 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:08,770 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:08,772 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 19:58:08,772 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:08,777 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:08,777 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:08,777 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 19:58:08,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:58:08,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 19:58:08,819 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:08,829 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:08,836 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:08,836 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 19:58:08,836 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:08,844 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:08,845 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 19:58:08,845 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2019-12-07 19:58:08,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 19:58:08,918 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:08,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:08,936 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 19:58:08,937 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:08,950 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:08,950 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:58:08,951 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:39 [2019-12-07 19:58:09,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-12-07 19:58:09,177 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:09,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:09,190 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 19:58:09,190 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:09,198 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:09,198 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:58:09,199 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2019-12-07 19:58:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:58:09,301 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:10,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:58:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:58:11,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201353537] [2019-12-07 19:58:11,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1779056] [2019-12-07 19:58:11,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:58:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:11,412 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-07 19:58:11,414 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:11,419 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 19:58:11,419 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:11,424 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:11,425 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 19:58:11,426 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:11,432 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:11,432 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:11,433 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 19:58:11,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:58:11,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 19:58:11,440 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:11,450 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:11,456 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:11,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 19:58:11,457 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:11,465 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:11,465 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:11,465 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-12-07 19:58:11,717 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 19:58:11,717 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:11,743 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:11,747 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 19:58:11,748 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:11,767 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:11,767 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 19:58:11,767 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2019-12-07 19:58:12,304 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-12-07 19:58:12,304 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:12,313 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:12,315 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 19:58:12,315 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:12,322 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:12,322 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 19:58:12,322 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:20 [2019-12-07 19:58:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:58:12,363 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:12,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:58:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:58:12,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319673862] [2019-12-07 19:58:12,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:58:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:12,879 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 19:58:12,881 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:12,885 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 19:58:12,885 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:12,891 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:12,893 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 19:58:12,893 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:12,898 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:12,898 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:12,898 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 19:58:12,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:58:12,905 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 19:58:12,905 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:12,915 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:12,922 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:12,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 19:58:12,923 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:12,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:12,933 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 19:58:12,933 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2019-12-07 19:58:12,942 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 19:58:12,943 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:12,959 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:12,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 19:58:12,963 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:12,978 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:12,979 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:58:12,979 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:39 [2019-12-07 19:58:12,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-12-07 19:58:12,993 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:13,003 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:13,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 19:58:13,006 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:13,013 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:13,014 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:58:13,014 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2019-12-07 19:58:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:58:13,019 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:13,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:58:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:58:13,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 19:58:13,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 15, 13, 15, 13] total 35 [2019-12-07 19:58:13,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636903952] [2019-12-07 19:58:13,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 19:58:13,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:58:13,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 19:58:13,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1146, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 19:58:13,495 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 36 states. [2019-12-07 19:58:15,709 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-12-07 19:58:16,033 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2019-12-07 19:58:16,590 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 112 [2019-12-07 19:58:17,209 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 117 [2019-12-07 19:58:17,659 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 101 [2019-12-07 19:58:19,806 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 99 [2019-12-07 19:58:20,386 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-07 19:58:20,907 WARN L192 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 110 [2019-12-07 19:58:25,233 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-12-07 19:58:35,927 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2019-12-07 19:58:36,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:58:36,043 INFO L93 Difference]: Finished difference Result 252 states and 268 transitions. [2019-12-07 19:58:36,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 19:58:36,045 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 29 [2019-12-07 19:58:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:58:36,046 INFO L225 Difference]: With dead ends: 252 [2019-12-07 19:58:36,046 INFO L226 Difference]: Without dead ends: 252 [2019-12-07 19:58:36,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 126 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=738, Invalid=3044, Unknown=0, NotChecked=0, Total=3782 [2019-12-07 19:58:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-12-07 19:58:36,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 82. [2019-12-07 19:58:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 19:58:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-12-07 19:58:36,051 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 29 [2019-12-07 19:58:36,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:58:36,051 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-12-07 19:58:36,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 19:58:36,052 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-12-07 19:58:36,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 19:58:36,052 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:58:36,052 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:58:36,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3,14 cvc4 --incremental --print-success --lang smt --rewrite-divk,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:58:36,656 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:58:36,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:58:36,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1082686446, now seen corresponding path program 2 times [2019-12-07 19:58:36,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:58:36,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169517065] [2019-12-07 19:58:36,658 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:58:36,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 19:58:36,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:58:36,739 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 19:58:36,740 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:58:36,757 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:58:36,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169517065] [2019-12-07 19:58:36,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1793949441] [2019-12-07 19:58:36,816 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:58:36,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 19:58:36,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:58:36,947 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 19:58:36,948 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:58:36,950 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:58:36,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340422627] [2019-12-07 19:58:36,953 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:58:36,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 19:58:36,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:58:37,000 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 19:58:37,001 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:58:37,005 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:58:37,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 19:58:37,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 8] total 16 [2019-12-07 19:58:37,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136656732] [2019-12-07 19:58:37,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 19:58:37,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:58:37,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 19:58:37,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:58:37,209 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 16 states. [2019-12-07 19:58:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:58:38,302 INFO L93 Difference]: Finished difference Result 358 states and 396 transitions. [2019-12-07 19:58:38,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 19:58:38,303 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-12-07 19:58:38,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:58:38,304 INFO L225 Difference]: With dead ends: 358 [2019-12-07 19:58:38,304 INFO L226 Difference]: Without dead ends: 358 [2019-12-07 19:58:38,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=373, Invalid=1109, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 19:58:38,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-12-07 19:58:38,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 100. [2019-12-07 19:58:38,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 19:58:38,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2019-12-07 19:58:38,309 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 32 [2019-12-07 19:58:38,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:58:38,309 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2019-12-07 19:58:38,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 19:58:38,309 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2019-12-07 19:58:38,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 19:58:38,310 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:58:38,310 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, 1] [2019-12-07 19:58:38,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:58:38,913 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:58:38,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:58:38,913 INFO L82 PathProgramCache]: Analyzing trace with hash -425913352, now seen corresponding path program 1 times [2019-12-07 19:58:38,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:58:38,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767988019] [2019-12-07 19:58:38,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 19:58:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:39,000 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 19:58:39,001 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 19:58:39,014 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 19:58:39,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767988019] [2019-12-07 19:58:39,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1792740185] [2019-12-07 19:58:39,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:58:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:39,170 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 19:58:39,170 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 19:58:39,173 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 19:58:39,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760134209] [2019-12-07 19:58:39,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:58:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:39,224 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 19:58:39,224 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:39,227 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 19:58:39,227 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:39,228 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:39,229 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:39,229 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:58:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 19:58:39,307 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 19:58:39,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 19:58:39,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [5, 5, 5, 5] total 15 [2019-12-07 19:58:39,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291286253] [2019-12-07 19:58:39,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:58:39,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:58:39,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:58:39,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:58:39,311 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand 9 states. [2019-12-07 19:58:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:58:39,796 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2019-12-07 19:58:39,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:58:39,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-07 19:58:39,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:58:39,797 INFO L225 Difference]: With dead ends: 119 [2019-12-07 19:58:39,797 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 19:58:39,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-07 19:58:39,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 19:58:39,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 103. [2019-12-07 19:58:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 19:58:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2019-12-07 19:58:39,799 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 35 [2019-12-07 19:58:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:58:39,799 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2019-12-07 19:58:39,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:58:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2019-12-07 19:58:39,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 19:58:39,800 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:58:39,800 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, 1] [2019-12-07 19:58:40,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3,21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:58:40,403 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:58:40,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:58:40,404 INFO L82 PathProgramCache]: Analyzing trace with hash -425913351, now seen corresponding path program 1 times [2019-12-07 19:58:40,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:58:40,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844383422] [2019-12-07 19:58:40,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 19:58:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:40,582 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 19:58:40,583 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 19:58:40,595 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 19:58:40,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844383422] [2019-12-07 19:58:40,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1781549330] [2019-12-07 19:58:40,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:58:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:40,752 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 19:58:40,753 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:40,756 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 19:58:40,756 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 19:58:40,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345721421] [2019-12-07 19:58:40,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:58:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:40,806 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 19:58:40,807 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 19:58:40,813 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 19:58:40,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 19:58:40,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 6] total 10 [2019-12-07 19:58:40,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254284469] [2019-12-07 19:58:40,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 19:58:40,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:58:40,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 19:58:40,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:58:40,864 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand 10 states. [2019-12-07 19:58:40,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:58:40,964 INFO L93 Difference]: Finished difference Result 172 states and 206 transitions. [2019-12-07 19:58:40,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:58:40,965 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-12-07 19:58:40,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:58:40,965 INFO L225 Difference]: With dead ends: 172 [2019-12-07 19:58:40,966 INFO L226 Difference]: Without dead ends: 172 [2019-12-07 19:58:40,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 195 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 19:58:40,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-07 19:58:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 149. [2019-12-07 19:58:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 19:58:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 203 transitions. [2019-12-07 19:58:40,969 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 203 transitions. Word has length 35 [2019-12-07 19:58:40,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:58:40,969 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 203 transitions. [2019-12-07 19:58:40,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 19:58:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2019-12-07 19:58:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 19:58:40,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:58:40,970 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:58:41,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:58:41,572 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:58:41,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:58:41,573 INFO L82 PathProgramCache]: Analyzing trace with hash -277596802, now seen corresponding path program 1 times [2019-12-07 19:58:41,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:58:41,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611966881] [2019-12-07 19:58:41,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 19:58:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:41,675 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 19:58:41,676 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 19:58:41,692 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 19:58:41,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611966881] [2019-12-07 19:58:41,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1271818839] [2019-12-07 19:58:41,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:58:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:41,892 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 19:58:41,892 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 19:58:41,896 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 19:58:41,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864996553] [2019-12-07 19:58:41,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:58:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:41,962 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 19:58:41,962 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 19:58:41,966 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 19:58:42,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 19:58:42,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 8] total 16 [2019-12-07 19:58:42,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119916277] [2019-12-07 19:58:42,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 19:58:42,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:58:42,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 19:58:42,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:58:42,173 INFO L87 Difference]: Start difference. First operand 149 states and 203 transitions. Second operand 16 states. [2019-12-07 19:58:42,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:58:42,352 INFO L93 Difference]: Finished difference Result 120 states and 151 transitions. [2019-12-07 19:58:42,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:58:42,352 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2019-12-07 19:58:42,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:58:42,353 INFO L225 Difference]: With dead ends: 120 [2019-12-07 19:58:42,353 INFO L226 Difference]: Without dead ends: 120 [2019-12-07 19:58:42,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 195 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 19:58:42,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-12-07 19:58:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2019-12-07 19:58:42,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 19:58:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 150 transitions. [2019-12-07 19:58:42,356 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 150 transitions. Word has length 36 [2019-12-07 19:58:42,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:58:42,357 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 150 transitions. [2019-12-07 19:58:42,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 19:58:42,357 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 150 transitions. [2019-12-07 19:58:42,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 19:58:42,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:58:42,358 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:58:42,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 mathsat -unsat_core_generation=3 [2019-12-07 19:58:42,960 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:58:42,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:58:42,961 INFO L82 PathProgramCache]: Analyzing trace with hash 902290189, now seen corresponding path program 2 times [2019-12-07 19:58:42,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:58:42,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015544633] [2019-12-07 19:58:42,962 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-12-07 19:58:43,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 19:58:43,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:58:43,014 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 19:58:43,014 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 19:58:43,029 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 19:58:43,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015544633] [2019-12-07 19:58:43,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:58:43,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 19:58:43,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653789367] [2019-12-07 19:58:43,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:58:43,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:58:43,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:58:43,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:58:43,065 INFO L87 Difference]: Start difference. First operand 114 states and 150 transitions. Second operand 8 states. [2019-12-07 19:58:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:58:43,143 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2019-12-07 19:58:43,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:58:43,143 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-12-07 19:58:43,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:58:43,144 INFO L225 Difference]: With dead ends: 121 [2019-12-07 19:58:43,144 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 19:58:43,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 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 19:58:43,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 19:58:43,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2019-12-07 19:58:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 19:58:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 147 transitions. [2019-12-07 19:58:43,146 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 147 transitions. Word has length 39 [2019-12-07 19:58:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:58:43,146 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 147 transitions. [2019-12-07 19:58:43,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:58:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 147 transitions. [2019-12-07 19:58:43,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 19:58:43,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:58:43,147 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:58:43,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 19:58:43,348 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:58:43,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:58:43,348 INFO L82 PathProgramCache]: Analyzing trace with hash 902290244, now seen corresponding path program 1 times [2019-12-07 19:58:43,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:58:43,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300261484] [2019-12-07 19:58:43,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 19:58:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:43,509 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 19:58:43,510 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:43,513 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 19:58:43,514 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:43,517 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:43,517 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:43,517 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 19:58:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 19:58:43,601 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 19:58:44,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300261484] [2019-12-07 19:58:44,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:58:44,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-12-07 19:58:44,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848874355] [2019-12-07 19:58:44,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 19:58:44,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:58:44,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 19:58:44,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:58:44,053 INFO L87 Difference]: Start difference. First operand 113 states and 147 transitions. Second operand 16 states. [2019-12-07 19:58:44,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:58:44,995 INFO L93 Difference]: Finished difference Result 149 states and 180 transitions. [2019-12-07 19:58:44,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:58:44,996 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-12-07 19:58:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:58:44,997 INFO L225 Difference]: With dead ends: 149 [2019-12-07 19:58:44,997 INFO L226 Difference]: Without dead ends: 149 [2019-12-07 19:58:44,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2019-12-07 19:58:44,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-12-07 19:58:44,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 113. [2019-12-07 19:58:44,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 19:58:45,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 140 transitions. [2019-12-07 19:58:45,000 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 140 transitions. Word has length 39 [2019-12-07 19:58:45,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:58:45,000 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 140 transitions. [2019-12-07 19:58:45,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 19:58:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 140 transitions. [2019-12-07 19:58:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 19:58:45,000 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:58:45,001 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:58:45,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 19:58:45,201 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:58:45,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:58:45,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2071614074, now seen corresponding path program 1 times [2019-12-07 19:58:45,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:58:45,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314660028] [2019-12-07 19:58:45,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:58:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:45,365 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 19:58:45,366 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:45,369 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 19:58:45,369 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:45,371 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:45,371 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:45,371 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:58:45,393 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:45,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 19:58:45,394 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:45,398 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:45,398 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:45,398 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 19:58:45,432 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 19:58:45,433 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:45,439 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:45,439 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 19:58:45,439 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-12-07 19:58:45,615 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:58:45,667 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:45,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 107 [2019-12-07 19:58:45,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:58:45,669 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:45,688 INFO L614 ElimStorePlain]: treesize reduction 87, result has 20.9 percent of original size [2019-12-07 19:58:45,688 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 19:58:45,688 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:23 [2019-12-07 19:58:45,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-12-07 19:58:45,775 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:45,782 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:45,782 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:45,782 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:23 [2019-12-07 19:58:45,825 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 19:58:45,825 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:45,829 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:45,830 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 19:58:45,830 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:5 [2019-12-07 19:58:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:58:45,885 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:45,986 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 19:58:45,990 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:45,990 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 19:58:45,991 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:21 [2019-12-07 19:58:46,568 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:46,568 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 20 treesize of output 24 [2019-12-07 19:58:46,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:58:46,569 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:46,579 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:46,580 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 19:58:46,585 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:46,585 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 19:58:46,585 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-12-07 19:58:47,750 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:47,772 INFO L614 ElimStorePlain]: treesize reduction 9, result has 60.9 percent of original size [2019-12-07 19:58:47,772 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 19:58:47,772 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:4 [2019-12-07 19:58:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:58:47,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314660028] [2019-12-07 19:58:47,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2078809311] [2019-12-07 19:58:47,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:58:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:48,138 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-07 19:58:48,139 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:48,142 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 19:58:48,142 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:48,143 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:48,144 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:48,144 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:58:48,151 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:48,151 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 19:58:48,151 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:48,155 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:48,155 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:48,155 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 19:58:48,159 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 19:58:48,159 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:48,165 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:48,165 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 19:58:48,166 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-12-07 19:58:48,172 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:58:48,219 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:48,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 107 [2019-12-07 19:58:48,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:58:48,221 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:48,243 INFO L614 ElimStorePlain]: treesize reduction 95, result has 22.1 percent of original size [2019-12-07 19:58:48,243 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 19:58:48,243 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:27 [2019-12-07 19:58:48,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-12-07 19:58:48,284 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:48,289 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:48,289 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:48,289 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:23 [2019-12-07 19:58:48,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 19:58:48,292 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:48,296 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:48,296 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 19:58:48,296 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:5 [2019-12-07 19:58:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:58:48,301 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:48,303 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 19:58:48,307 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:48,307 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 19:58:48,307 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2019-12-07 19:58:50,466 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:50,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 20 treesize of output 24 [2019-12-07 19:58:50,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:58:50,466 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:50,476 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:50,477 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 19:58:50,481 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:50,481 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 19:58:50,481 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-12-07 19:58:50,797 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:50,818 INFO L614 ElimStorePlain]: treesize reduction 9, result has 60.9 percent of original size [2019-12-07 19:58:50,819 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 19:58:50,819 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:4 [2019-12-07 19:58:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:58:50,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639733169] [2019-12-07 19:58:50,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:58:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:50,895 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 19:58:50,896 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:50,898 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 19:58:50,899 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:50,900 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:50,900 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:50,900 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:58:50,912 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:50,912 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 19:58:50,912 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:50,916 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:50,917 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:50,917 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 19:58:50,920 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 19:58:50,921 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:50,927 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:50,927 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 19:58:50,927 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-12-07 19:58:50,931 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:58:50,976 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:50,976 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 107 [2019-12-07 19:58:50,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:58:50,977 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:50,996 INFO L614 ElimStorePlain]: treesize reduction 87, result has 20.9 percent of original size [2019-12-07 19:58:50,996 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 19:58:50,996 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:23 [2019-12-07 19:58:50,999 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-12-07 19:58:50,999 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:51,005 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:51,005 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:51,005 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:23 [2019-12-07 19:58:51,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 19:58:51,008 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:51,012 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:51,012 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 19:58:51,012 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:5 [2019-12-07 19:58:51,016 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:58:51,016 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:51,020 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 19:58:51,024 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:51,024 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 19:58:51,024 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:21 [2019-12-07 19:58:51,647 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:51,647 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 20 treesize of output 24 [2019-12-07 19:58:51,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:58:51,648 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:51,659 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:51,661 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 19:58:51,664 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:51,664 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 19:58:51,664 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-12-07 19:58:51,924 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:51,950 INFO L614 ElimStorePlain]: treesize reduction 9, result has 60.9 percent of original size [2019-12-07 19:58:51,951 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 19:58:51,951 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:4 [2019-12-07 19:58:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:58:51,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 19:58:51,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20, 20, 20, 20] total 33 [2019-12-07 19:58:51,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293978541] [2019-12-07 19:58:51,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 19:58:51,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:58:51,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 19:58:51,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 19:58:51,962 INFO L87 Difference]: Start difference. First operand 113 states and 140 transitions. Second operand 34 states. [2019-12-07 19:58:55,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:58:55,301 INFO L93 Difference]: Finished difference Result 184 states and 225 transitions. [2019-12-07 19:58:55,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 19:58:55,301 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 42 [2019-12-07 19:58:55,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:58:55,302 INFO L225 Difference]: With dead ends: 184 [2019-12-07 19:58:55,302 INFO L226 Difference]: Without dead ends: 184 [2019-12-07 19:58:55,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 203 SyntacticMatches, 13 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=500, Invalid=2806, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 19:58:55,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-07 19:58:55,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 129. [2019-12-07 19:58:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 19:58:55,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 168 transitions. [2019-12-07 19:58:55,305 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 168 transitions. Word has length 42 [2019-12-07 19:58:55,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:58:55,306 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 168 transitions. [2019-12-07 19:58:55,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 19:58:55,306 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 168 transitions. [2019-12-07 19:58:55,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 19:58:55,306 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:58:55,306 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:58:55,907 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 19:58:55,908 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:58:55,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:58:55,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2071614073, now seen corresponding path program 1 times [2019-12-07 19:58:55,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:58:55,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405447904] [2019-12-07 19:58:55,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:58:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:56,090 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-07 19:58:56,091 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:56,097 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 19:58:56,097 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:56,104 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:56,106 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 19:58:56,107 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:56,112 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:56,112 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:56,112 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 19:58:56,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:58:56,154 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 19:58:56,155 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:56,165 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:56,172 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:56,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 19:58:56,172 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:56,180 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:56,180 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:56,180 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-12-07 19:58:56,249 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 19:58:56,249 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:56,266 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:56,269 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 19:58:56,269 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:56,283 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:56,283 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 19:58:56,284 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2019-12-07 19:58:56,604 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_181|], 6=[|v_#memory_$Pointer$.base_193|]} [2019-12-07 19:58:56,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:58:56,609 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 11 [2019-12-07 19:58:56,609 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:56,628 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:56,630 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:58:56,662 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:56,662 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 69 [2019-12-07 19:58:56,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:58:56,663 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:56,689 INFO L614 ElimStorePlain]: treesize reduction 36, result has 52.0 percent of original size [2019-12-07 19:58:56,689 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 19:58:56,689 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:39 [2019-12-07 19:58:56,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-12-07 19:58:56,733 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:56,752 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:56,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 19:58:56,755 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:56,764 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:56,764 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:58:56,764 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:35 [2019-12-07 19:58:56,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 19:58:56,820 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:56,831 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:56,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 19:58:56,834 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:56,841 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:56,842 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 19:58:56,842 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:20 [2019-12-07 19:58:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 19:58:56,960 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:57,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:58:57,481 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 19:58:57,489 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:57,538 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:57,543 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 19:58:57,547 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 19:58:57,584 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:57,584 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 19:58:57,584 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:69 [2019-12-07 19:58:58,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:58:58,078 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 19:58:58,087 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:58:58,133 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:58,137 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 19:58:58,142 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 19:58:58,181 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:58:58,181 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 19:58:58,181 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:103, output treesize:69 [2019-12-07 19:59:00,579 WARN L192 SmtUtils]: Spent 1.89 s on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 19:59:01,275 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 19:59:02,763 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-12-07 19:59:03,346 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-12-07 19:59:04,903 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-12-07 19:59:04,911 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:04,993 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:04,999 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:05,130 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 19:59:05,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:05,137 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:05,418 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-12-07 19:59:05,419 INFO L614 ElimStorePlain]: treesize reduction 58, result has 54.3 percent of original size [2019-12-07 19:59:05,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:59:05,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:59:05,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:59:05,423 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2019-12-07 19:59:05,423 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:149, output treesize:47 [2019-12-07 19:59:05,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:59:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:59:07,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405447904] [2019-12-07 19:59:07,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [810883077] [2019-12-07 19:59:07,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:59:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:59:08,138 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-07 19:59:08,139 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:59:08,143 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 19:59:08,143 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:08,148 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:08,150 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 19:59:08,150 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:08,155 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:08,155 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:59:08,155 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 19:59:08,164 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:08,164 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 19:59:08,164 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:08,173 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:08,176 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 19:59:08,176 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:08,185 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:08,185 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:59:08,185 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-12-07 19:59:08,191 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 19:59:08,191 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:08,207 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:08,210 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 19:59:08,210 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:08,223 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:08,223 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 19:59:08,224 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2019-12-07 19:59:08,227 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_192|], 6=[|v_#memory_$Pointer$.base_204|]} [2019-12-07 19:59:08,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:59:08,233 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 11 [2019-12-07 19:59:08,234 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:08,259 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:08,261 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:59:08,285 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:08,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 69 [2019-12-07 19:59:08,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:59:08,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:59:08,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:59:08,287 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 19:59:08,319 INFO L614 ElimStorePlain]: treesize reduction 71, result has 34.3 percent of original size [2019-12-07 19:59:08,319 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 19:59:08,319 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:37 [2019-12-07 19:59:08,366 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 19:59:08,366 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:08,386 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:08,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-12-07 19:59:08,389 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:08,397 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:08,397 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:59:08,398 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:35 [2019-12-07 19:59:08,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 19:59:08,402 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:08,411 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:08,414 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 19:59:08,414 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:08,421 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:08,421 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 19:59:08,422 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:20 [2019-12-07 19:59:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 19:59:08,479 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:59:08,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:59:08,491 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:08,495 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 19:59:08,545 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:08,550 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 19:59:08,555 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 19:59:08,598 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:08,599 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 19:59:08,599 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:69 [2019-12-07 19:59:09,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:59:09,071 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:09,075 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 19:59:09,125 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:09,130 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 19:59:09,133 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 19:59:09,169 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:09,170 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 19:59:09,170 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:103, output treesize:69 [2019-12-07 19:59:10,343 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:10,466 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 19:59:10,466 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:10,472 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:10,680 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-12-07 19:59:10,680 INFO L614 ElimStorePlain]: treesize reduction 58, result has 65.5 percent of original size [2019-12-07 19:59:10,686 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:10,796 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-12-07 19:59:10,796 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:10,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:59:10,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:59:10,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:59:10,800 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2019-12-07 19:59:10,800 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:149, output treesize:47 [2019-12-07 19:59:10,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:59:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:59:12,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605572154] [2019-12-07 19:59:12,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:59:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:59:12,107 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-07 19:59:12,108 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:59:12,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 19:59:12,112 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:12,117 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:12,118 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 19:59:12,119 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:12,123 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:12,123 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:59:12,123 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 19:59:12,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:59:12,129 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 19:59:12,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:12,140 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:12,146 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:12,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 19:59:12,147 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:12,156 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:12,156 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:59:12,156 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-12-07 19:59:12,162 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 19:59:12,162 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:12,178 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:12,181 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 19:59:12,181 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:12,193 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:12,194 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 19:59:12,194 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2019-12-07 19:59:12,197 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_203|], 6=[|v_#memory_$Pointer$.base_215|]} [2019-12-07 19:59:12,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:59:12,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 11 [2019-12-07 19:59:12,202 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:12,221 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:12,224 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:59:12,247 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:12,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 69 [2019-12-07 19:59:12,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:59:12,248 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:12,273 INFO L614 ElimStorePlain]: treesize reduction 36, result has 52.0 percent of original size [2019-12-07 19:59:12,273 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 19:59:12,273 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:39 [2019-12-07 19:59:12,317 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 19:59:12,318 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:12,336 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:12,339 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-12-07 19:59:12,339 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:12,348 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:12,348 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:59:12,348 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:35 [2019-12-07 19:59:12,352 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 19:59:12,353 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:12,361 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:12,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 19:59:12,364 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:12,371 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:12,371 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 19:59:12,371 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:20 [2019-12-07 19:59:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 19:59:12,423 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:59:12,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:59:12,430 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 19:59:12,436 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 19:59:12,509 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:12,520 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:12,524 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 19:59:12,566 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:12,566 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 19:59:12,566 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:69 [2019-12-07 19:59:13,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:59:13,027 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 19:59:13,031 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 19:59:13,096 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:13,106 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:13,109 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 19:59:13,149 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:13,150 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 19:59:13,150 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:103, output treesize:69 [2019-12-07 19:59:14,498 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:14,631 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 19:59:14,631 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:14,637 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:14,825 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-12-07 19:59:14,826 INFO L614 ElimStorePlain]: treesize reduction 58, result has 65.5 percent of original size [2019-12-07 19:59:14,832 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:14,932 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:14,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:59:14,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:59:14,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:59:14,935 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2019-12-07 19:59:14,935 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:149, output treesize:47 [2019-12-07 19:59:14,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:59:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:59:17,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 19:59:17,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 18, 20, 18, 20] total 37 [2019-12-07 19:59:17,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792267733] [2019-12-07 19:59:17,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-07 19:59:17,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:59:17,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 19:59:17,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1296, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 19:59:17,761 INFO L87 Difference]: Start difference. First operand 129 states and 168 transitions. Second operand 38 states. [2019-12-07 19:59:20,541 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-12-07 19:59:20,988 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-12-07 19:59:21,473 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-12-07 19:59:21,913 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-12-07 19:59:23,408 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-12-07 19:59:23,704 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-12-07 19:59:25,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:59:25,512 INFO L93 Difference]: Finished difference Result 251 states and 291 transitions. [2019-12-07 19:59:25,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 19:59:25,512 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 42 [2019-12-07 19:59:25,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:59:25,514 INFO L225 Difference]: With dead ends: 251 [2019-12-07 19:59:25,514 INFO L226 Difference]: Without dead ends: 251 [2019-12-07 19:59:25,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 189 SyntacticMatches, 21 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=650, Invalid=3510, Unknown=0, NotChecked=0, Total=4160 [2019-12-07 19:59:25,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-12-07 19:59:25,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 126. [2019-12-07 19:59:25,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 19:59:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 157 transitions. [2019-12-07 19:59:25,518 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 157 transitions. Word has length 42 [2019-12-07 19:59:25,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:59:25,518 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 157 transitions. [2019-12-07 19:59:25,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-07 19:59:25,518 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 157 transitions. [2019-12-07 19:59:25,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 19:59:25,518 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:59:25,518 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:59:26,120 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 19:59:26,120 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:59:26,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:59:26,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1068101428, now seen corresponding path program 2 times [2019-12-07 19:59:26,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:59:26,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133930615] [2019-12-07 19:59:26,123 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:59:26,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 19:59:26,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:59:26,358 INFO L264 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 19:59:26,359 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:59:26,377 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 19:59:26,377 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:59:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 19:59:26,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133930615] [2019-12-07 19:59:26,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [988510482] [2019-12-07 19:59:26,435 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:59:26,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 19:59:26,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:59:26,615 INFO L264 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 19:59:26,616 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:59:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 19:59:26,620 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:59:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 19:59:26,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213407276] [2019-12-07 19:59:26,625 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/bin/utaipan/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:59:26,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 19:59:26,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:59:26,686 INFO L264 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 19:59:26,686 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:59:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 19:59:26,695 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:59:26,923 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 19:59:26,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 19:59:26,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 8] total 16 [2019-12-07 19:59:26,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845992910] [2019-12-07 19:59:26,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 19:59:26,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:59:26,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 19:59:26,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:59:26,924 INFO L87 Difference]: Start difference. First operand 126 states and 157 transitions. Second operand 16 states. [2019-12-07 19:59:27,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:59:27,849 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2019-12-07 19:59:27,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 19:59:27,850 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2019-12-07 19:59:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:59:27,850 INFO L225 Difference]: With dead ends: 166 [2019-12-07 19:59:27,850 INFO L226 Difference]: Without dead ends: 166 [2019-12-07 19:59:27,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 248 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=296, Invalid=894, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 19:59:27,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-07 19:59:27,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 118. [2019-12-07 19:59:27,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-12-07 19:59:27,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2019-12-07 19:59:27,853 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 137 transitions. Word has length 45 [2019-12-07 19:59:27,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:59:27,853 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 137 transitions. [2019-12-07 19:59:27,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 19:59:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2019-12-07 19:59:27,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 19:59:27,853 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:59:27,853 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:59:28,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 cvc4 --incremental --print-success --lang smt --rewrite-divk,36 mathsat -unsat_core_generation=3 [2019-12-07 19:59:28,456 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 19:59:28,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:59:28,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1198023752, now seen corresponding path program 1 times [2019-12-07 19:59:28,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:59:28,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380891095] [2019-12-07 19:59:28,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:59:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:59:28,734 INFO L264 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 62 conjunts are in the unsatisfiable core [2019-12-07 19:59:28,736 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:59:28,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 19:59:28,739 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:28,743 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:28,743 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:59:28,744 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 19:59:28,775 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:28,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 19:59:28,775 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:28,781 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:28,781 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:59:28,781 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-12-07 19:59:28,828 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 19:59:28,828 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:28,841 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:28,844 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 19:59:28,844 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:28,853 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:28,853 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 19:59:28,854 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-12-07 19:59:29,194 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_223|], 6=[|v_#memory_$Pointer$.base_250|, |v_#memory_$Pointer$.offset_238|]} [2019-12-07 19:59:29,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2019-12-07 19:59:29,200 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:29,248 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:29,251 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:59:29,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:59:29,253 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 84 [2019-12-07 19:59:29,253 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:29,272 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:29,275 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:59:29,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 56 [2019-12-07 19:59:29,276 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:29,289 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:29,289 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:59:29,289 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:40 [2019-12-07 19:59:29,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:59:29,485 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2019-12-07 19:59:29,486 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:29,529 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:29,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:59:29,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 19:59:29,535 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:29,553 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:29,556 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-12-07 19:59:29,556 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:29,572 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:29,572 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:59:29,572 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:81, output treesize:40 [2019-12-07 19:59:29,756 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-12-07 19:59:29,756 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:29,774 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:29,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 19:59:29,779 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:29,793 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:29,794 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:59:29,794 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:22 [2019-12-07 19:59:29,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-12-07 19:59:29,935 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:29,943 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:29,943 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 19:59:29,943 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:15 [2019-12-07 19:59:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:59:30,218 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:59:30,896 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 19:59:30,921 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:30,922 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 19:59:30,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:30,933 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 19:59:30,933 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:47 [2019-12-07 19:59:33,771 INFO L430 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.offset_241|, |v_#memory_$Pointer$.base_253|], 2=[|#memory_int|]} [2019-12-07 19:59:33,773 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 19:59:33,816 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:33,818 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 19:59:33,831 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:33,833 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 324 treesize of output 286 [2019-12-07 19:59:33,834 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 19:59:33,981 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-12-07 19:59:33,981 INFO L614 ElimStorePlain]: treesize reduction 93, result has 60.1 percent of original size [2019-12-07 19:59:33,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:59:33,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 19:59:33,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 19:59:33,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 19:59:33,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 19:59:33,984 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 16 dim-0 vars, and 6 xjuncts. [2019-12-07 19:59:33,984 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:86, output treesize:315 [2019-12-07 19:59:33,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 19:59:33,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 19:59:34,439 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 57 [2019-12-07 19:59:36,299 INFO L343 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2019-12-07 19:59:36,299 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 44 [2019-12-07 19:59:36,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:59:36,316 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:59:36,317 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 44 treesize of output 46 [2019-12-07 19:59:36,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:59:36,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:59:36,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:59:36,320 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:59:36,321 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_86], 1=[v_arrayElimCell_85]} [2019-12-07 19:59:36,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380891095] [2019-12-07 19:59:36,324 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@392eb6a2 [2019-12-07 19:59:36,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [177467384] [2019-12-07 19:59:36,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:59:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:59:36,593 INFO L264 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 60 conjunts are in the unsatisfiable core [2019-12-07 19:59:36,594 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:59:36,594 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@392eb6a2 [2019-12-07 19:59:36,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084461427] [2019-12-07 19:59:36,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27c85d29-54fe-4903-8178-ec2ac8be2eba/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 19:59:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:59:36,664 INFO L264 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 63 conjunts are in the unsatisfiable core [2019-12-07 19:59:36,666 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:59:36,667 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@392eb6a2 [2019-12-07 19:59:36,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:59:36,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 19:59:36,667 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 19:59:36,667 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:59:37,272 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 19:59:37,289 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 19:59:37,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:59:37 BoogieIcfgContainer [2019-12-07 19:59:37,289 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:59:37,289 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:59:37,289 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:59:37,289 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:59:37,290 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:57:57" (3/4) ... [2019-12-07 19:59:37,292 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 19:59:37,292 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:59:37,293 INFO L168 Benchmark]: Toolchain (without parser) took 100993.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 265.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 116.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:59:37,293 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 19:59:37,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.97 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: -171.0 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:59:37,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.95 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:59:37,294 INFO L168 Benchmark]: Boogie Preprocessor took 24.13 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 19:59:37,294 INFO L168 Benchmark]: RCFGBuilder took 340.14 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: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2019-12-07 19:59:37,294 INFO L168 Benchmark]: TraceAbstraction took 100263.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 127.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.5 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:59:37,295 INFO L168 Benchmark]: Witness Printer took 2.96 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:59:37,296 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 324.97 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: -171.0 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.95 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.13 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 340.14 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: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 100263.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 127.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.5 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.96 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 619]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L603] const int len = 2; [L604] const int data = 1; [L573] SLL head = ((void *)0); [L574] COND TRUE len > 0 [L564] SLL temp = (SLL) malloc(sizeof(struct node)); [L565] COND FALSE !(((void *)0) == temp) [L568] temp->next = ((void *)0) [L569] temp->data = data [L570] return temp; [L575] SLL new_head = node_create(data); [L576] new_head->next = head [L577] head = new_head [L574] len-- [L574] COND TRUE len > 0 [L564] SLL temp = (SLL) malloc(sizeof(struct node)); [L565] COND FALSE !(((void *)0) == temp) [L568] temp->next = ((void *)0) [L569] temp->data = data [L570] return temp; [L575] SLL new_head = node_create(data); [L576] new_head->next = head [L577] head = new_head [L574] len-- [L574] COND FALSE !(len > 0) [L579] return head; [L605] SLL s = sll_create(len, data); [L606] int i; [L607] i = len - 1 [L607] COND TRUE i >= 0 [L608] int new_data = i + len; [L596] COND TRUE index > 0 [L597] EXPR head->next [L597] head = head->next [L598] index-- [L596] COND FALSE !(index > 0) [L600] head->data = data [L607] i-- [L607] COND TRUE i >= 0 [L608] int new_data = i + len; [L596] COND FALSE !(index > 0) [L600] head->data = data [L607] i-- [L607] COND FALSE !(i >= 0) [L611] i = len - 1 [L611] COND TRUE i >= 0 [L612] int expected = i + len; [L589] COND TRUE index > 0 [L590] EXPR head->next [L590] head = head->next [L591] index-- [L589] COND FALSE !(index > 0) [L593] EXPR head->data [L593] return head->data; [L613] COND TRUE expected != sll_get_data_at(s, i) [L619] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 63 locations, 21 error locations. Result: UNKNOWN, OverallTime: 100.2s, OverallIterations: 20, TraceHistogramMax: 2, AutomataDifference: 42.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1000 SDtfs, 11300 SDslu, 4168 SDs, 0 SdLazy, 4482 SolverSat, 746 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 25.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2459 GetRequests, 1943 SyntacticMatches, 58 SemanticMatches, 458 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3932 ImplicationChecksByTransitivity, 46.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=13, 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, 19 MinimizatonAttempts, 956 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 36.9s InterpolantComputationTime, 1167 NumberOfCodeBlocks, 1138 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 2260 ConstructedInterpolants, 204 QuantifiedInterpolants, 971043 SizeOfPredicates, 557 NumberOfNonLiveVariables, 4765 ConjunctsInSsa, 648 ConjunctsInUnsatCore, 74 InterpolantComputations, 22 PerfectInterpolantSequences, 716/1048 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...