./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/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 b34e199f0da2018b0ae97fc3f9a24725315a1b16 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/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 b34e199f0da2018b0ae97fc3f9a24725315a1b16 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [1244410803] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [871650543] failed with TRACE_FEASIBLE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 07:20:21,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 07:20:21,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 07:20:21,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 07:20:21,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 07:20:21,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 07:20:21,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 07:20:22,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 07:20:22,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 07:20:22,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 07:20:22,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 07:20:22,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 07:20:22,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 07:20:22,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 07:20:22,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 07:20:22,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 07:20:22,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 07:20:22,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 07:20:22,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 07:20:22,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 07:20:22,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 07:20:22,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 07:20:22,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 07:20:22,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 07:20:22,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 07:20:22,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 07:20:22,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 07:20:22,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 07:20:22,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 07:20:22,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 07:20:22,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 07:20:22,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 07:20:22,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 07:20:22,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 07:20:22,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 07:20:22,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 07:20:22,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 07:20:22,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 07:20:22,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 07:20:22,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 07:20:22,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 07:20:22,029 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-12-09 07:20:22,045 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 07:20:22,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 07:20:22,046 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 07:20:22,046 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 07:20:22,046 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 07:20:22,046 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 07:20:22,046 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 07:20:22,046 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 07:20:22,046 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 07:20:22,046 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 07:20:22,047 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 07:20:22,047 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 07:20:22,047 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 07:20:22,047 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 07:20:22,047 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 07:20:22,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 07:20:22,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 07:20:22,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 07:20:22,048 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 07:20:22,048 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 07:20:22,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 07:20:22,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 07:20:22,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 07:20:22,048 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 07:20:22,049 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 07:20:22,049 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 07:20:22,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 07:20:22,049 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 07:20:22,049 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 07:20:22,049 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 07:20:22,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 07:20:22,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 07:20:22,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 07:20:22,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 07:20:22,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 07:20:22,050 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 07:20:22,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 07:20:22,050 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 07:20:22,050 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 07:20:22,050 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_b3434ad0-c423-454a-a719-ef8838b71404/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 -> b34e199f0da2018b0ae97fc3f9a24725315a1b16 [2020-12-09 07:20:22,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 07:20:22,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 07:20:22,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 07:20:22,258 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 07:20:22,258 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 07:20:22,259 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/../../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2020-12-09 07:20:22,297 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/data/c4a0fb4b1/b6232f00fd6c4d6fac96e54de8914fb9/FLAG1c42f0a14 [2020-12-09 07:20:22,720 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 07:20:22,721 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2020-12-09 07:20:22,734 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/data/c4a0fb4b1/b6232f00fd6c4d6fac96e54de8914fb9/FLAG1c42f0a14 [2020-12-09 07:20:22,744 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/data/c4a0fb4b1/b6232f00fd6c4d6fac96e54de8914fb9 [2020-12-09 07:20:22,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 07:20:22,746 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 07:20:22,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 07:20:22,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 07:20:22,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 07:20:22,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:20:22" (1/1) ... [2020-12-09 07:20:22,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24343553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:22, skipping insertion in model container [2020-12-09 07:20:22,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:20:22" (1/1) ... [2020-12-09 07:20:22,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 07:20:22,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 07:20:23,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:20:23,048 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 07:20:23,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:20:23,170 INFO L208 MainTranslator]: Completed translation [2020-12-09 07:20:23,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:23 WrapperNode [2020-12-09 07:20:23,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 07:20:23,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 07:20:23,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 07:20:23,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 07:20:23,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:23" (1/1) ... [2020-12-09 07:20:23,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:23" (1/1) ... [2020-12-09 07:20:23,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 07:20:23,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 07:20:23,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 07:20:23,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 07:20:23,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:23" (1/1) ... [2020-12-09 07:20:23,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:23" (1/1) ... [2020-12-09 07:20:23,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:23" (1/1) ... [2020-12-09 07:20:23,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:23" (1/1) ... [2020-12-09 07:20:23,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:23" (1/1) ... [2020-12-09 07:20:23,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:23" (1/1) ... [2020-12-09 07:20:23,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:23" (1/1) ... [2020-12-09 07:20:23,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 07:20:23,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 07:20:23,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 07:20:23,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 07:20:23,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/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 [2020-12-09 07:20:23,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-09 07:20:23,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 07:20:23,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 07:20:23,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 07:20:23,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 07:20:23,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-09 07:20:23,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 07:20:23,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 07:20:23,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 07:20:23,787 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 07:20:23,788 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2020-12-09 07:20:23,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:20:23 BoogieIcfgContainer [2020-12-09 07:20:23,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 07:20:23,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 07:20:23,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 07:20:23,793 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 07:20:23,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:20:22" (1/3) ... [2020-12-09 07:20:23,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f070224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:20:23, skipping insertion in model container [2020-12-09 07:20:23,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:23" (2/3) ... [2020-12-09 07:20:23,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f070224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:20:23, skipping insertion in model container [2020-12-09 07:20:23,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:20:23" (3/3) ... [2020-12-09 07:20:23,796 INFO L111 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2020-12-09 07:20:23,806 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 07:20:23,810 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 58 error locations. [2020-12-09 07:20:23,818 INFO L253 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2020-12-09 07:20:23,834 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 07:20:23,834 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 07:20:23,834 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 07:20:23,834 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 07:20:23,834 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 07:20:23,835 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 07:20:23,835 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 07:20:23,835 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 07:20:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states. [2020-12-09 07:20:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 07:20:23,854 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:20:23,854 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 07:20:23,855 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:20:23,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:20:23,859 INFO L82 PathProgramCache]: Analyzing trace with hash 287661, now seen corresponding path program 1 times [2020-12-09 07:20:23,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:20:23,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446616146] [2020-12-09 07:20:23,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:20:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:24,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:24,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446616146] [2020-12-09 07:20:24,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:20:24,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 07:20:24,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715244176] [2020-12-09 07:20:24,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:20:24,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:20:24,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:20:24,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:20:24,030 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 3 states. [2020-12-09 07:20:24,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:20:24,138 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2020-12-09 07:20:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:20:24,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 07:20:24,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:20:24,146 INFO L225 Difference]: With dead ends: 141 [2020-12-09 07:20:24,146 INFO L226 Difference]: Without dead ends: 139 [2020-12-09 07:20:24,147 INFO L677 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 [2020-12-09 07:20:24,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-12-09 07:20:24,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2020-12-09 07:20:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-12-09 07:20:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2020-12-09 07:20:24,180 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 3 [2020-12-09 07:20:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:20:24,180 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2020-12-09 07:20:24,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:20:24,181 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2020-12-09 07:20:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 07:20:24,181 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:20:24,181 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 07:20:24,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 07:20:24,181 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:20:24,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:20:24,182 INFO L82 PathProgramCache]: Analyzing trace with hash 287662, now seen corresponding path program 1 times [2020-12-09 07:20:24,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:20:24,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818049171] [2020-12-09 07:20:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:20:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:24,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818049171] [2020-12-09 07:20:24,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:20:24,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 07:20:24,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157194858] [2020-12-09 07:20:24,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:20:24,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:20:24,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:20:24,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:20:24,240 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand 3 states. [2020-12-09 07:20:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:20:24,363 INFO L93 Difference]: Finished difference Result 248 states and 277 transitions. [2020-12-09 07:20:24,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:20:24,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 07:20:24,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:20:24,367 INFO L225 Difference]: With dead ends: 248 [2020-12-09 07:20:24,367 INFO L226 Difference]: Without dead ends: 248 [2020-12-09 07:20:24,368 INFO L677 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 [2020-12-09 07:20:24,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-12-09 07:20:24,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 189. [2020-12-09 07:20:24,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-12-09 07:20:24,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 249 transitions. [2020-12-09 07:20:24,385 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 249 transitions. Word has length 3 [2020-12-09 07:20:24,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:20:24,385 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 249 transitions. [2020-12-09 07:20:24,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:20:24,385 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 249 transitions. [2020-12-09 07:20:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 07:20:24,385 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:20:24,385 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 07:20:24,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 07:20:24,386 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:20:24,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:20:24,387 INFO L82 PathProgramCache]: Analyzing trace with hash 8917474, now seen corresponding path program 1 times [2020-12-09 07:20:24,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:20:24,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165453036] [2020-12-09 07:20:24,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:20:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:24,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165453036] [2020-12-09 07:20:24,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:20:24,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:20:24,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702005180] [2020-12-09 07:20:24,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:20:24,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:20:24,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:20:24,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:20:24,498 INFO L87 Difference]: Start difference. First operand 189 states and 249 transitions. Second operand 4 states. [2020-12-09 07:20:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:20:24,701 INFO L93 Difference]: Finished difference Result 269 states and 326 transitions. [2020-12-09 07:20:24,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:20:24,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-12-09 07:20:24,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:20:24,703 INFO L225 Difference]: With dead ends: 269 [2020-12-09 07:20:24,703 INFO L226 Difference]: Without dead ends: 269 [2020-12-09 07:20:24,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:20:24,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-12-09 07:20:24,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 207. [2020-12-09 07:20:24,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-12-09 07:20:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 276 transitions. [2020-12-09 07:20:24,715 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 276 transitions. Word has length 4 [2020-12-09 07:20:24,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:20:24,715 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 276 transitions. [2020-12-09 07:20:24,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:20:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 276 transitions. [2020-12-09 07:20:24,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 07:20:24,715 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:20:24,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 07:20:24,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 07:20:24,716 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:20:24,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:20:24,717 INFO L82 PathProgramCache]: Analyzing trace with hash 276441741, now seen corresponding path program 1 times [2020-12-09 07:20:24,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:20:24,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972391331] [2020-12-09 07:20:24,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:20:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:24,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972391331] [2020-12-09 07:20:24,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:20:24,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:20:24,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083682615] [2020-12-09 07:20:24,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:20:24,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:20:24,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:20:24,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:20:24,855 INFO L87 Difference]: Start difference. First operand 207 states and 276 transitions. Second operand 4 states. [2020-12-09 07:20:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:20:25,026 INFO L93 Difference]: Finished difference Result 262 states and 301 transitions. [2020-12-09 07:20:25,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:20:25,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-12-09 07:20:25,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:20:25,027 INFO L225 Difference]: With dead ends: 262 [2020-12-09 07:20:25,027 INFO L226 Difference]: Without dead ends: 262 [2020-12-09 07:20:25,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:20:25,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-12-09 07:20:25,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 207. [2020-12-09 07:20:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-12-09 07:20:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 273 transitions. [2020-12-09 07:20:25,039 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 273 transitions. Word has length 5 [2020-12-09 07:20:25,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:20:25,039 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 273 transitions. [2020-12-09 07:20:25,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:20:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 273 transitions. [2020-12-09 07:20:25,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 07:20:25,039 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:20:25,040 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 07:20:25,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 07:20:25,040 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:20:25,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:20:25,041 INFO L82 PathProgramCache]: Analyzing trace with hash -20240572, now seen corresponding path program 1 times [2020-12-09 07:20:25,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:20:25,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717750744] [2020-12-09 07:20:25,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:20:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:25,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717750744] [2020-12-09 07:20:25,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:20:25,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:20:25,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974175457] [2020-12-09 07:20:25,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:20:25,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:20:25,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:20:25,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:20:25,081 INFO L87 Difference]: Start difference. First operand 207 states and 273 transitions. Second operand 4 states. [2020-12-09 07:20:25,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:20:25,150 INFO L93 Difference]: Finished difference Result 227 states and 293 transitions. [2020-12-09 07:20:25,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:20:25,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-12-09 07:20:25,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:20:25,151 INFO L225 Difference]: With dead ends: 227 [2020-12-09 07:20:25,151 INFO L226 Difference]: Without dead ends: 227 [2020-12-09 07:20:25,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:20:25,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-12-09 07:20:25,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 216. [2020-12-09 07:20:25,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-12-09 07:20:25,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 289 transitions. [2020-12-09 07:20:25,157 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 289 transitions. Word has length 6 [2020-12-09 07:20:25,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:20:25,157 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 289 transitions. [2020-12-09 07:20:25,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:20:25,157 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 289 transitions. [2020-12-09 07:20:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 07:20:25,158 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:20:25,158 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:20:25,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 07:20:25,158 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:20:25,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:20:25,158 INFO L82 PathProgramCache]: Analyzing trace with hash -627457681, now seen corresponding path program 1 times [2020-12-09 07:20:25,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:20:25,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592494254] [2020-12-09 07:20:25,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:20:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:25,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592494254] [2020-12-09 07:20:25,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:20:25,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 07:20:25,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892216723] [2020-12-09 07:20:25,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:20:25,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:20:25,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:20:25,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:20:25,202 INFO L87 Difference]: Start difference. First operand 216 states and 289 transitions. Second operand 3 states. [2020-12-09 07:20:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:20:25,252 INFO L93 Difference]: Finished difference Result 216 states and 288 transitions. [2020-12-09 07:20:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:20:25,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-09 07:20:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:20:25,253 INFO L225 Difference]: With dead ends: 216 [2020-12-09 07:20:25,253 INFO L226 Difference]: Without dead ends: 216 [2020-12-09 07:20:25,254 INFO L677 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 [2020-12-09 07:20:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-12-09 07:20:25,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2020-12-09 07:20:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-12-09 07:20:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 287 transitions. [2020-12-09 07:20:25,258 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 287 transitions. Word has length 7 [2020-12-09 07:20:25,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:20:25,258 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 287 transitions. [2020-12-09 07:20:25,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:20:25,258 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 287 transitions. [2020-12-09 07:20:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 07:20:25,259 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:20:25,259 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:20:25,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 07:20:25,259 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:20:25,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:20:25,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1943894891, now seen corresponding path program 1 times [2020-12-09 07:20:25,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:20:25,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480119800] [2020-12-09 07:20:25,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:20:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:25,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480119800] [2020-12-09 07:20:25,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17482242] [2020-12-09 07:20:25,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/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 [2020-12-09 07:20:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:25,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 07:20:25,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:20:25,533 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 07:20:25,534 INFO L348 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2020-12-09 07:20:25,534 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2020-12-09 07:20:25,540 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 07:20:25,593 INFO L625 ElimStorePlain]: treesize reduction 50, result has 53.3 percent of original size [2020-12-09 07:20:25,601 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 07:20:25,601 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:28, output treesize:12 [2020-12-09 07:20:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:25,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:20:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:25,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1793190093] [2020-12-09 07:20:25,673 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 07:20:25,673 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 07:20:25,676 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 07:20:25,680 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 07:20:25,680 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 07:20:25,747 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:25,844 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:25,862 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:26,525 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 07:20:26,707 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-12-09 07:20:28,465 WARN L197 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 257 DAG size of output: 197 [2020-12-09 07:20:30,190 WARN L197 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 267 DAG size of output: 204 [2020-12-09 07:20:30,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 07:20:30,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 2, 2] total 9 [2020-12-09 07:20:30,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781966229] [2020-12-09 07:20:30,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 07:20:30,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:20:30,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 07:20:30,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-12-09 07:20:30,679 INFO L87 Difference]: Start difference. First operand 215 states and 287 transitions. Second operand 5 states. [2020-12-09 07:20:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:20:31,190 INFO L93 Difference]: Finished difference Result 242 states and 303 transitions. [2020-12-09 07:20:31,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:20:31,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-09 07:20:31,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:20:31,191 INFO L225 Difference]: With dead ends: 242 [2020-12-09 07:20:31,191 INFO L226 Difference]: Without dead ends: 242 [2020-12-09 07:20:31,192 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-12-09 07:20:31,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-12-09 07:20:31,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 219. [2020-12-09 07:20:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-12-09 07:20:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 298 transitions. [2020-12-09 07:20:31,196 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 298 transitions. Word has length 11 [2020-12-09 07:20:31,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:20:31,196 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 298 transitions. [2020-12-09 07:20:31,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 07:20:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 298 transitions. [2020-12-09 07:20:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 07:20:31,197 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:20:31,197 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:20:31,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-09 07:20:31,399 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:20:31,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:20:31,400 INFO L82 PathProgramCache]: Analyzing trace with hash 235992595, now seen corresponding path program 1 times [2020-12-09 07:20:31,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:20:31,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455769484] [2020-12-09 07:20:31,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:20:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:31,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455769484] [2020-12-09 07:20:31,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891933359] [2020-12-09 07:20:31,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/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 [2020-12-09 07:20:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:31,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 07:20:31,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:20:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:31,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:20:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:31,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1650739487] [2020-12-09 07:20:31,511 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2020-12-09 07:20:31,511 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 07:20:31,512 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 07:20:31,512 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 07:20:31,512 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 07:20:31,543 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:31,562 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:31,577 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:31,992 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 265 [2020-12-09 07:20:32,210 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2020-12-09 07:20:32,447 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 07:20:32,646 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-12-09 07:20:32,777 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-12-09 07:20:32,956 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2020-12-09 07:20:33,131 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2020-12-09 07:20:33,323 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2020-12-09 07:20:33,740 WARN L197 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 83 [2020-12-09 07:20:35,810 WARN L197 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 265 DAG size of output: 203 [2020-12-09 07:20:37,897 WARN L197 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 260 DAG size of output: 199 [2020-12-09 07:20:38,040 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-12-09 07:20:38,127 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 07:20:38,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 07:20:38,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2020-12-09 07:20:38,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161181204] [2020-12-09 07:20:38,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 07:20:38,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:20:38,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 07:20:38,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-12-09 07:20:38,128 INFO L87 Difference]: Start difference. First operand 219 states and 298 transitions. Second operand 5 states. [2020-12-09 07:20:38,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:20:38,188 INFO L93 Difference]: Finished difference Result 296 states and 367 transitions. [2020-12-09 07:20:38,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:20:38,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-09 07:20:38,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:20:38,189 INFO L225 Difference]: With dead ends: 296 [2020-12-09 07:20:38,189 INFO L226 Difference]: Without dead ends: 296 [2020-12-09 07:20:38,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-12-09 07:20:38,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-12-09 07:20:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 230. [2020-12-09 07:20:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-09 07:20:38,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 309 transitions. [2020-12-09 07:20:38,194 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 309 transitions. Word has length 13 [2020-12-09 07:20:38,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:20:38,194 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 309 transitions. [2020-12-09 07:20:38,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 07:20:38,194 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 309 transitions. [2020-12-09 07:20:38,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 07:20:38,195 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:20:38,195 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:20:38,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 07:20:38,396 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:20:38,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:20:38,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1553618568, now seen corresponding path program 1 times [2020-12-09 07:20:38,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:20:38,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136271000] [2020-12-09 07:20:38,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:20:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:38,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136271000] [2020-12-09 07:20:38,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:20:38,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:20:38,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102160934] [2020-12-09 07:20:38,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 07:20:38,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:20:38,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 07:20:38,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:20:38,470 INFO L87 Difference]: Start difference. First operand 230 states and 309 transitions. Second operand 5 states. [2020-12-09 07:20:38,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:20:38,625 INFO L93 Difference]: Finished difference Result 294 states and 352 transitions. [2020-12-09 07:20:38,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 07:20:38,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-09 07:20:38,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:20:38,627 INFO L225 Difference]: With dead ends: 294 [2020-12-09 07:20:38,628 INFO L226 Difference]: Without dead ends: 294 [2020-12-09 07:20:38,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:20:38,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-12-09 07:20:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 226. [2020-12-09 07:20:38,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-12-09 07:20:38,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 285 transitions. [2020-12-09 07:20:38,634 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 285 transitions. Word has length 16 [2020-12-09 07:20:38,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:20:38,634 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 285 transitions. [2020-12-09 07:20:38,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 07:20:38,635 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 285 transitions. [2020-12-09 07:20:38,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 07:20:38,635 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:20:38,635 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:20:38,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-09 07:20:38,636 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:20:38,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:20:38,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1621173817, now seen corresponding path program 1 times [2020-12-09 07:20:38,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:20:38,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725365203] [2020-12-09 07:20:38,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:20:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:38,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725365203] [2020-12-09 07:20:38,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:20:38,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 07:20:38,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310146481] [2020-12-09 07:20:38,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 07:20:38,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:20:38,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 07:20:38,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-12-09 07:20:38,852 INFO L87 Difference]: Start difference. First operand 226 states and 285 transitions. Second operand 10 states. [2020-12-09 07:20:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:20:39,207 INFO L93 Difference]: Finished difference Result 288 states and 338 transitions. [2020-12-09 07:20:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 07:20:39,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-12-09 07:20:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:20:39,210 INFO L225 Difference]: With dead ends: 288 [2020-12-09 07:20:39,210 INFO L226 Difference]: Without dead ends: 288 [2020-12-09 07:20:39,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-12-09 07:20:39,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-12-09 07:20:39,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 181. [2020-12-09 07:20:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-12-09 07:20:39,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 218 transitions. [2020-12-09 07:20:39,215 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 218 transitions. Word has length 18 [2020-12-09 07:20:39,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:20:39,215 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 218 transitions. [2020-12-09 07:20:39,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 07:20:39,216 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 218 transitions. [2020-12-09 07:20:39,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 07:20:39,216 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:20:39,216 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:20:39,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-09 07:20:39,217 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:20:39,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:20:39,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1283219361, now seen corresponding path program 1 times [2020-12-09 07:20:39,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:20:39,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550521925] [2020-12-09 07:20:39,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:20:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:39,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:39,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550521925] [2020-12-09 07:20:39,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:20:39,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:20:39,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624988614] [2020-12-09 07:20:39,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 07:20:39,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:20:39,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 07:20:39,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:20:39,266 INFO L87 Difference]: Start difference. First operand 181 states and 218 transitions. Second operand 5 states. [2020-12-09 07:20:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:20:39,407 INFO L93 Difference]: Finished difference Result 282 states and 332 transitions. [2020-12-09 07:20:39,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 07:20:39,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-12-09 07:20:39,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:20:39,409 INFO L225 Difference]: With dead ends: 282 [2020-12-09 07:20:39,409 INFO L226 Difference]: Without dead ends: 282 [2020-12-09 07:20:39,409 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:20:39,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-12-09 07:20:39,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 183. [2020-12-09 07:20:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-12-09 07:20:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 219 transitions. [2020-12-09 07:20:39,413 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 219 transitions. Word has length 19 [2020-12-09 07:20:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:20:39,413 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 219 transitions. [2020-12-09 07:20:39,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 07:20:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 219 transitions. [2020-12-09 07:20:39,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 07:20:39,414 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:20:39,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:20:39,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-12-09 07:20:39,414 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:20:39,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:20:39,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1176958957, now seen corresponding path program 1 times [2020-12-09 07:20:39,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:20:39,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110341279] [2020-12-09 07:20:39,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:20:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:39,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110341279] [2020-12-09 07:20:39,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:20:39,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:20:39,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191428924] [2020-12-09 07:20:39,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:20:39,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:20:39,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:20:39,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:20:39,439 INFO L87 Difference]: Start difference. First operand 183 states and 219 transitions. Second operand 4 states. [2020-12-09 07:20:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:20:39,522 INFO L93 Difference]: Finished difference Result 234 states and 277 transitions. [2020-12-09 07:20:39,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:20:39,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-09 07:20:39,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:20:39,524 INFO L225 Difference]: With dead ends: 234 [2020-12-09 07:20:39,524 INFO L226 Difference]: Without dead ends: 234 [2020-12-09 07:20:39,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:20:39,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-12-09 07:20:39,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 186. [2020-12-09 07:20:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-12-09 07:20:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 221 transitions. [2020-12-09 07:20:39,527 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 221 transitions. Word has length 20 [2020-12-09 07:20:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:20:39,528 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 221 transitions. [2020-12-09 07:20:39,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:20:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 221 transitions. [2020-12-09 07:20:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 07:20:39,528 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:20:39,528 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:20:39,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-12-09 07:20:39,529 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:20:39,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:20:39,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1125094665, now seen corresponding path program 1 times [2020-12-09 07:20:39,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:20:39,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606945176] [2020-12-09 07:20:39,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:20:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:39,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:39,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606945176] [2020-12-09 07:20:39,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:20:39,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 07:20:39,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044438662] [2020-12-09 07:20:39,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:20:39,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:20:39,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:20:39,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:20:39,642 INFO L87 Difference]: Start difference. First operand 186 states and 221 transitions. Second operand 6 states. [2020-12-09 07:20:39,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:20:39,793 INFO L93 Difference]: Finished difference Result 190 states and 222 transitions. [2020-12-09 07:20:39,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 07:20:39,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-12-09 07:20:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:20:39,794 INFO L225 Difference]: With dead ends: 190 [2020-12-09 07:20:39,794 INFO L226 Difference]: Without dead ends: 190 [2020-12-09 07:20:39,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-09 07:20:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-12-09 07:20:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 185. [2020-12-09 07:20:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-12-09 07:20:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 218 transitions. [2020-12-09 07:20:39,798 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 218 transitions. Word has length 20 [2020-12-09 07:20:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:20:39,799 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 218 transitions. [2020-12-09 07:20:39,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:20:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 218 transitions. [2020-12-09 07:20:39,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 07:20:39,799 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:20:39,799 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:20:39,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-12-09 07:20:39,800 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:20:39,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:20:39,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2125989229, now seen corresponding path program 1 times [2020-12-09 07:20:39,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:20:39,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148753689] [2020-12-09 07:20:39,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:20:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:39,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:39,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148753689] [2020-12-09 07:20:39,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:20:39,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:20:39,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049795301] [2020-12-09 07:20:39,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:20:39,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:20:39,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:20:39,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:20:39,858 INFO L87 Difference]: Start difference. First operand 185 states and 218 transitions. Second operand 4 states. [2020-12-09 07:20:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:20:39,958 INFO L93 Difference]: Finished difference Result 187 states and 220 transitions. [2020-12-09 07:20:39,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:20:39,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-12-09 07:20:39,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:20:39,959 INFO L225 Difference]: With dead ends: 187 [2020-12-09 07:20:39,959 INFO L226 Difference]: Without dead ends: 187 [2020-12-09 07:20:39,959 INFO L677 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 [2020-12-09 07:20:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-12-09 07:20:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2020-12-09 07:20:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-12-09 07:20:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 220 transitions. [2020-12-09 07:20:39,962 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 220 transitions. Word has length 21 [2020-12-09 07:20:39,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:20:39,962 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 220 transitions. [2020-12-09 07:20:39,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:20:39,962 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 220 transitions. [2020-12-09 07:20:39,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 07:20:39,963 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:20:39,963 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:20:39,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-12-09 07:20:39,963 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:20:39,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:20:39,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1478088943, now seen corresponding path program 1 times [2020-12-09 07:20:39,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:20:39,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249068210] [2020-12-09 07:20:39,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:20:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:40,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:40,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249068210] [2020-12-09 07:20:40,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252190017] [2020-12-09 07:20:40,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/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 [2020-12-09 07:20:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:40,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 07:20:40,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:20:40,198 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 07:20:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:40,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:20:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:40,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2027666891] [2020-12-09 07:20:40,471 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2020-12-09 07:20:40,471 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 07:20:40,472 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 07:20:40,472 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 07:20:40,472 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 07:20:40,507 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:40,599 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:40,608 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:40,832 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:41,035 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:41,049 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:41,062 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:41,078 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:42,020 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 07:20:42,343 WARN L197 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 71 [2020-12-09 07:20:42,895 WARN L197 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 183 [2020-12-09 07:20:43,564 WARN L197 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 191 [2020-12-09 07:20:44,588 WARN L197 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 190 [2020-12-09 07:20:45,523 WARN L197 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 204 [2020-12-09 07:20:46,507 WARN L197 SmtUtils]: Spent 898.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 217 [2020-12-09 07:20:47,529 WARN L197 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 213 [2020-12-09 07:20:47,704 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2020-12-09 07:20:47,885 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2020-12-09 07:20:48,097 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2020-12-09 07:20:48,680 WARN L197 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 82 [2020-12-09 07:20:49,122 WARN L197 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 93 [2020-12-09 07:20:49,719 WARN L197 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 305 DAG size of output: 87 [2020-12-09 07:20:52,915 WARN L197 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 316 DAG size of output: 215 [2020-12-09 07:20:54,784 WARN L197 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 306 DAG size of output: 208 [2020-12-09 07:20:54,785 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 07:20:54,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 07:20:54,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2020-12-09 07:20:54,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239420915] [2020-12-09 07:20:54,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-09 07:20:54,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:20:54,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-09 07:20:54,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2020-12-09 07:20:54,786 INFO L87 Difference]: Start difference. First operand 187 states and 220 transitions. Second operand 15 states. [2020-12-09 07:20:55,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:20:55,622 INFO L93 Difference]: Finished difference Result 375 states and 415 transitions. [2020-12-09 07:20:55,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 07:20:55,622 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2020-12-09 07:20:55,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:20:55,623 INFO L225 Difference]: With dead ends: 375 [2020-12-09 07:20:55,623 INFO L226 Difference]: Without dead ends: 375 [2020-12-09 07:20:55,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=318, Invalid=1242, Unknown=0, NotChecked=0, Total=1560 [2020-12-09 07:20:55,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2020-12-09 07:20:55,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 179. [2020-12-09 07:20:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-12-09 07:20:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 212 transitions. [2020-12-09 07:20:55,628 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 212 transitions. Word has length 24 [2020-12-09 07:20:55,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:20:55,628 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 212 transitions. [2020-12-09 07:20:55,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-09 07:20:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 212 transitions. [2020-12-09 07:20:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 07:20:55,628 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:20:55,628 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:20:55,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2020-12-09 07:20:55,830 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:20:55,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:20:55,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1423882984, now seen corresponding path program 1 times [2020-12-09 07:20:55,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:20:55,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599700669] [2020-12-09 07:20:55,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:20:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:56,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599700669] [2020-12-09 07:20:56,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269048409] [2020-12-09 07:20:56,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/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 [2020-12-09 07:20:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:20:56,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-09 07:20:56,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:20:56,231 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2020-12-09 07:20:57,043 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-12-09 07:20:57,190 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-12-09 07:20:57,688 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-12-09 07:20:57,974 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-12-09 07:20:58,262 WARN L197 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2020-12-09 07:20:58,549 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2020-12-09 07:20:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:59,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:20:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:20:59,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1358109956] [2020-12-09 07:20:59,144 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2020-12-09 07:20:59,144 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 07:20:59,144 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 07:20:59,145 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 07:20:59,145 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 07:20:59,172 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:59,185 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:59,196 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:59,448 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:59,562 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:59,582 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:59,596 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:20:59,609 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:21:00,568 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 07:21:01,075 WARN L197 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 83 [2020-12-09 07:21:01,720 WARN L197 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 183 [2020-12-09 07:21:02,470 WARN L197 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 191 [2020-12-09 07:21:03,657 WARN L197 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 190 [2020-12-09 07:21:04,837 WARN L197 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 204 [2020-12-09 07:21:05,979 WARN L197 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 257 DAG size of output: 217 [2020-12-09 07:21:07,090 WARN L197 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 213 [2020-12-09 07:21:07,287 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2020-12-09 07:21:07,491 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2020-12-09 07:21:07,734 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2020-12-09 07:21:08,203 WARN L197 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 89 [2020-12-09 07:21:08,706 WARN L197 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 92 [2020-12-09 07:21:09,383 WARN L197 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 305 DAG size of output: 87 [2020-12-09 07:21:13,118 WARN L197 SmtUtils]: Spent 3.45 s on a formula simplification. DAG size of input: 316 DAG size of output: 215 [2020-12-09 07:21:15,114 WARN L197 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 306 DAG size of output: 208 [2020-12-09 07:21:15,115 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 07:21:15,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 07:21:15,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 14 [2020-12-09 07:21:15,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295456628] [2020-12-09 07:21:15,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 07:21:15,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:21:15,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 07:21:15,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2020-12-09 07:21:15,116 INFO L87 Difference]: Start difference. First operand 179 states and 212 transitions. Second operand 16 states. [2020-12-09 07:21:15,458 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 63 [2020-12-09 07:21:15,736 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2020-12-09 07:21:16,201 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2020-12-09 07:21:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:21:16,962 INFO L93 Difference]: Finished difference Result 367 states and 423 transitions. [2020-12-09 07:21:16,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 07:21:16,962 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-12-09 07:21:16,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:21:16,964 INFO L225 Difference]: With dead ends: 367 [2020-12-09 07:21:16,964 INFO L226 Difference]: Without dead ends: 367 [2020-12-09 07:21:16,964 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 25 SyntacticMatches, 28 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=285, Invalid=1121, Unknown=0, NotChecked=0, Total=1406 [2020-12-09 07:21:16,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2020-12-09 07:21:16,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 222. [2020-12-09 07:21:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-12-09 07:21:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 272 transitions. [2020-12-09 07:21:16,968 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 272 transitions. Word has length 25 [2020-12-09 07:21:16,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:21:16,968 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 272 transitions. [2020-12-09 07:21:16,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 07:21:16,968 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 272 transitions. [2020-12-09 07:21:16,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 07:21:16,969 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:21:16,969 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:21:17,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 07:21:17,170 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:21:17,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:21:17,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1190699410, now seen corresponding path program 1 times [2020-12-09 07:21:17,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:21:17,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333045938] [2020-12-09 07:21:17,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:21:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:21:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:21:17,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333045938] [2020-12-09 07:21:17,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390084573] [2020-12-09 07:21:17,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/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 [2020-12-09 07:21:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:21:17,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 26 conjunts are in the unsatisfiable core [2020-12-09 07:21:17,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:21:17,670 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2020-12-09 07:21:19,203 WARN L197 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2020-12-09 07:21:19,420 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 81 [2020-12-09 07:21:19,678 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 45 [2020-12-09 07:21:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:21:20,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:21:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:21:42,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [222493356] [2020-12-09 07:21:42,942 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2020-12-09 07:21:42,942 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 07:21:42,942 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 07:21:42,942 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 07:21:42,942 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 07:21:43,073 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:21:43,088 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:21:43,097 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:21:43,346 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:21:43,366 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:21:43,386 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:21:43,401 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:21:43,524 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:21:43,918 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 07:21:44,165 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2020-12-09 07:21:45,042 WARN L197 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 183 [2020-12-09 07:21:46,034 WARN L197 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 191 [2020-12-09 07:21:47,550 WARN L197 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 190 [2020-12-09 07:21:48,813 WARN L197 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 235 DAG size of output: 204 [2020-12-09 07:21:50,015 WARN L197 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 260 DAG size of output: 212 [2020-12-09 07:21:51,161 WARN L197 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 256 DAG size of output: 208 [2020-12-09 07:21:51,415 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-12-09 07:21:51,676 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2020-12-09 07:21:52,001 WARN L197 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2020-12-09 07:21:52,269 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2020-12-09 07:21:52,547 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-12-09 07:21:52,818 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2020-12-09 07:21:52,889 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 07:21:52,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 07:21:52,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2020-12-09 07:21:52,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491724084] [2020-12-09 07:21:52,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-09 07:21:52,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:21:52,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-09 07:21:52,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=917, Unknown=1, NotChecked=0, Total=1122 [2020-12-09 07:21:52,890 INFO L87 Difference]: Start difference. First operand 222 states and 272 transitions. Second operand 21 states. [2020-12-09 07:21:53,762 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 75 [2020-12-09 07:21:54,028 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 60 [2020-12-09 07:21:54,545 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 65 [2020-12-09 07:21:55,113 WARN L197 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2020-12-09 07:21:55,397 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2020-12-09 07:21:55,691 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2020-12-09 07:21:56,083 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 80 [2020-12-09 07:21:56,257 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2020-12-09 07:21:57,104 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 64 [2020-12-09 07:21:57,432 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 88 [2020-12-09 07:21:57,778 WARN L197 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 88 [2020-12-09 07:21:58,382 WARN L197 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 87 [2020-12-09 07:21:59,361 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 68 [2020-12-09 07:21:59,560 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2020-12-09 07:21:59,745 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2020-12-09 07:22:00,142 WARN L197 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 94 [2020-12-09 07:22:00,856 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-12-09 07:22:01,576 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 64 [2020-12-09 07:22:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:22:04,112 INFO L93 Difference]: Finished difference Result 851 states and 958 transitions. [2020-12-09 07:22:04,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2020-12-09 07:22:04,113 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2020-12-09 07:22:04,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:22:04,116 INFO L225 Difference]: With dead ends: 851 [2020-12-09 07:22:04,116 INFO L226 Difference]: Without dead ends: 851 [2020-12-09 07:22:04,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 23 SyntacticMatches, 29 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2647 ImplicationChecksByTransitivity, 39.7s TimeCoverageRelationStatistics Valid=1057, Invalid=5584, Unknown=1, NotChecked=0, Total=6642 [2020-12-09 07:22:04,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2020-12-09 07:22:04,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 220. [2020-12-09 07:22:04,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-12-09 07:22:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 268 transitions. [2020-12-09 07:22:04,123 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 268 transitions. Word has length 26 [2020-12-09 07:22:04,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:22:04,124 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 268 transitions. [2020-12-09 07:22:04,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-09 07:22:04,124 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 268 transitions. [2020-12-09 07:22:04,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 07:22:04,124 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:22:04,124 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:22:04,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 07:22:04,326 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:22:04,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:22:04,327 INFO L82 PathProgramCache]: Analyzing trace with hash -774247782, now seen corresponding path program 1 times [2020-12-09 07:22:04,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:22:04,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767501826] [2020-12-09 07:22:04,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:22:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:04,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767501826] [2020-12-09 07:22:04,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:22:04,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:22:04,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307587541] [2020-12-09 07:22:04,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:22:04,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:22:04,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:22:04,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:22:04,387 INFO L87 Difference]: Start difference. First operand 220 states and 268 transitions. Second operand 3 states. [2020-12-09 07:22:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:22:04,398 INFO L93 Difference]: Finished difference Result 199 states and 243 transitions. [2020-12-09 07:22:04,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:22:04,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-09 07:22:04,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:22:04,400 INFO L225 Difference]: With dead ends: 199 [2020-12-09 07:22:04,400 INFO L226 Difference]: Without dead ends: 199 [2020-12-09 07:22:04,400 INFO L677 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 [2020-12-09 07:22:04,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-12-09 07:22:04,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 191. [2020-12-09 07:22:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-12-09 07:22:04,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 237 transitions. [2020-12-09 07:22:04,403 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 237 transitions. Word has length 27 [2020-12-09 07:22:04,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:22:04,403 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 237 transitions. [2020-12-09 07:22:04,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:22:04,403 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 237 transitions. [2020-12-09 07:22:04,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 07:22:04,404 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:22:04,404 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:22:04,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2020-12-09 07:22:04,404 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:22:04,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:22:04,404 INFO L82 PathProgramCache]: Analyzing trace with hash -774248038, now seen corresponding path program 1 times [2020-12-09 07:22:04,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:22:04,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918555764] [2020-12-09 07:22:04,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:22:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:04,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918555764] [2020-12-09 07:22:04,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:22:04,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:22:04,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356149008] [2020-12-09 07:22:04,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:22:04,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:22:04,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:22:04,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:22:04,429 INFO L87 Difference]: Start difference. First operand 191 states and 237 transitions. Second operand 3 states. [2020-12-09 07:22:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:22:04,452 INFO L93 Difference]: Finished difference Result 189 states and 235 transitions. [2020-12-09 07:22:04,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:22:04,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-09 07:22:04,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:22:04,454 INFO L225 Difference]: With dead ends: 189 [2020-12-09 07:22:04,454 INFO L226 Difference]: Without dead ends: 189 [2020-12-09 07:22:04,454 INFO L677 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 [2020-12-09 07:22:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-12-09 07:22:04,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2020-12-09 07:22:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-12-09 07:22:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 235 transitions. [2020-12-09 07:22:04,457 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 235 transitions. Word has length 27 [2020-12-09 07:22:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:22:04,457 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 235 transitions. [2020-12-09 07:22:04,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:22:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 235 transitions. [2020-12-09 07:22:04,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 07:22:04,457 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:22:04,457 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:22:04,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2020-12-09 07:22:04,458 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:22:04,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:22:04,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1768114759, now seen corresponding path program 1 times [2020-12-09 07:22:04,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:22:04,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88415138] [2020-12-09 07:22:04,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:22:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:04,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:04,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88415138] [2020-12-09 07:22:04,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:22:04,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:22:04,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584021260] [2020-12-09 07:22:04,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:22:04,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:22:04,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:22:04,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:22:04,482 INFO L87 Difference]: Start difference. First operand 189 states and 235 transitions. Second operand 3 states. [2020-12-09 07:22:04,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:22:04,517 INFO L93 Difference]: Finished difference Result 187 states and 231 transitions. [2020-12-09 07:22:04,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:22:04,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-12-09 07:22:04,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:22:04,519 INFO L225 Difference]: With dead ends: 187 [2020-12-09 07:22:04,519 INFO L226 Difference]: Without dead ends: 187 [2020-12-09 07:22:04,519 INFO L677 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 [2020-12-09 07:22:04,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-12-09 07:22:04,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2020-12-09 07:22:04,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-12-09 07:22:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 231 transitions. [2020-12-09 07:22:04,522 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 231 transitions. Word has length 28 [2020-12-09 07:22:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:22:04,522 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 231 transitions. [2020-12-09 07:22:04,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:22:04,522 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 231 transitions. [2020-12-09 07:22:04,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-09 07:22:04,523 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:22:04,523 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:22:04,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2020-12-09 07:22:04,523 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:22:04,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:22:04,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1658605498, now seen corresponding path program 1 times [2020-12-09 07:22:04,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:22:04,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456809962] [2020-12-09 07:22:04,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:22:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:04,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456809962] [2020-12-09 07:22:04,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721765632] [2020-12-09 07:22:04,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/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 [2020-12-09 07:22:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:04,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-09 07:22:04,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:22:05,046 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 18 [2020-12-09 07:22:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 07:22:05,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:22:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 07:22:05,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1588229443] [2020-12-09 07:22:05,546 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2020-12-09 07:22:05,546 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 07:22:05,546 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 07:22:05,546 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 07:22:05,546 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 07:22:05,677 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:22:05,687 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:22:05,696 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 07:22:06,322 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 07:22:06,525 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-12-09 07:22:06,736 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-12-09 07:22:07,009 WARN L197 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2020-12-09 07:22:07,289 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2020-12-09 07:22:07,640 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2020-12-09 07:22:07,993 WARN L197 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2020-12-09 07:22:11,050 WARN L197 SmtUtils]: Spent 2.83 s on a formula simplification. DAG size of input: 265 DAG size of output: 203 [2020-12-09 07:22:13,997 WARN L197 SmtUtils]: Spent 2.74 s on a formula simplification. DAG size of input: 260 DAG size of output: 199 [2020-12-09 07:22:17,162 WARN L197 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 268 DAG size of output: 207 [2020-12-09 07:22:19,382 WARN L197 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 265 DAG size of output: 201 [2020-12-09 07:22:21,885 WARN L197 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 279 DAG size of output: 211 [2020-12-09 07:22:21,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 07:22:21,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8, 6, 6] total 31 [2020-12-09 07:22:21,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953698979] [2020-12-09 07:22:21,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 07:22:21,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:22:21,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 07:22:21,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=791, Unknown=0, NotChecked=0, Total=992 [2020-12-09 07:22:21,887 INFO L87 Difference]: Start difference. First operand 187 states and 231 transitions. Second operand 13 states. [2020-12-09 07:22:23,407 WARN L197 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 215 DAG size of output: 198 [2020-12-09 07:22:24,903 WARN L197 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 210 DAG size of output: 198 [2020-12-09 07:22:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:22:25,493 INFO L93 Difference]: Finished difference Result 233 states and 285 transitions. [2020-12-09 07:22:25,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 07:22:25,495 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2020-12-09 07:22:25,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:22:25,496 INFO L225 Difference]: With dead ends: 233 [2020-12-09 07:22:25,496 INFO L226 Difference]: Without dead ends: 233 [2020-12-09 07:22:25,496 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=252, Invalid=870, Unknown=0, NotChecked=0, Total=1122 [2020-12-09 07:22:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-12-09 07:22:25,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 193. [2020-12-09 07:22:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-12-09 07:22:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 243 transitions. [2020-12-09 07:22:25,501 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 243 transitions. Word has length 29 [2020-12-09 07:22:25,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:22:25,501 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 243 transitions. [2020-12-09 07:22:25,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 07:22:25,501 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 243 transitions. [2020-12-09 07:22:25,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-09 07:22:25,501 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:22:25,502 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:22:25,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 07:22:25,703 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:22:25,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:22:25,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1023017156, now seen corresponding path program 1 times [2020-12-09 07:22:25,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:22:25,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248987001] [2020-12-09 07:22:25,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:22:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:25,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248987001] [2020-12-09 07:22:25,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:22:25,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:22:25,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224039598] [2020-12-09 07:22:25,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:22:25,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:22:25,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:22:25,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:22:25,736 INFO L87 Difference]: Start difference. First operand 193 states and 243 transitions. Second operand 3 states. [2020-12-09 07:22:25,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:22:25,815 INFO L93 Difference]: Finished difference Result 204 states and 252 transitions. [2020-12-09 07:22:25,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:22:25,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-12-09 07:22:25,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:22:25,817 INFO L225 Difference]: With dead ends: 204 [2020-12-09 07:22:25,817 INFO L226 Difference]: Without dead ends: 204 [2020-12-09 07:22:25,817 INFO L677 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 [2020-12-09 07:22:25,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-12-09 07:22:25,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 170. [2020-12-09 07:22:25,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-12-09 07:22:25,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 212 transitions. [2020-12-09 07:22:25,820 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 212 transitions. Word has length 29 [2020-12-09 07:22:25,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:22:25,820 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 212 transitions. [2020-12-09 07:22:25,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:22:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 212 transitions. [2020-12-09 07:22:25,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 07:22:25,820 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:22:25,821 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:22:25,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2020-12-09 07:22:25,821 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:22:25,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:22:25,821 INFO L82 PathProgramCache]: Analyzing trace with hash -718233932, now seen corresponding path program 1 times [2020-12-09 07:22:25,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:22:25,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455902400] [2020-12-09 07:22:25,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:22:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:25,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455902400] [2020-12-09 07:22:25,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:22:25,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 07:22:25,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147117981] [2020-12-09 07:22:25,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:22:25,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:22:25,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:22:25,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:22:25,891 INFO L87 Difference]: Start difference. First operand 170 states and 212 transitions. Second operand 6 states. [2020-12-09 07:22:26,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:22:26,052 INFO L93 Difference]: Finished difference Result 186 states and 224 transitions. [2020-12-09 07:22:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 07:22:26,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-12-09 07:22:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:22:26,053 INFO L225 Difference]: With dead ends: 186 [2020-12-09 07:22:26,054 INFO L226 Difference]: Without dead ends: 186 [2020-12-09 07:22:26,054 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-12-09 07:22:26,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-12-09 07:22:26,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2020-12-09 07:22:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-12-09 07:22:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 211 transitions. [2020-12-09 07:22:26,056 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 211 transitions. Word has length 32 [2020-12-09 07:22:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:22:26,056 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 211 transitions. [2020-12-09 07:22:26,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:22:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 211 transitions. [2020-12-09 07:22:26,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 07:22:26,057 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:22:26,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:22:26,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2020-12-09 07:22:26,057 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:22:26,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:22:26,057 INFO L82 PathProgramCache]: Analyzing trace with hash -790415187, now seen corresponding path program 1 times [2020-12-09 07:22:26,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:22:26,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879935822] [2020-12-09 07:22:26,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:22:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:26,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879935822] [2020-12-09 07:22:26,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:22:26,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:22:26,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448510473] [2020-12-09 07:22:26,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 07:22:26,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:22:26,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 07:22:26,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:22:26,133 INFO L87 Difference]: Start difference. First operand 170 states and 211 transitions. Second operand 5 states. [2020-12-09 07:22:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:22:26,233 INFO L93 Difference]: Finished difference Result 173 states and 208 transitions. [2020-12-09 07:22:26,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:22:26,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-12-09 07:22:26,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:22:26,234 INFO L225 Difference]: With dead ends: 173 [2020-12-09 07:22:26,234 INFO L226 Difference]: Without dead ends: 173 [2020-12-09 07:22:26,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:22:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-12-09 07:22:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2020-12-09 07:22:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-12-09 07:22:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 205 transitions. [2020-12-09 07:22:26,237 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 205 transitions. Word has length 33 [2020-12-09 07:22:26,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:22:26,237 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 205 transitions. [2020-12-09 07:22:26,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 07:22:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 205 transitions. [2020-12-09 07:22:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 07:22:26,238 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:22:26,238 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:22:26,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2020-12-09 07:22:26,238 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:22:26,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:22:26,238 INFO L82 PathProgramCache]: Analyzing trace with hash -311490636, now seen corresponding path program 1 times [2020-12-09 07:22:26,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:22:26,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339772913] [2020-12-09 07:22:26,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:22:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:26,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339772913] [2020-12-09 07:22:26,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:22:26,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 07:22:26,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391226487] [2020-12-09 07:22:26,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 07:22:26,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:22:26,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 07:22:26,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:22:26,365 INFO L87 Difference]: Start difference. First operand 169 states and 205 transitions. Second operand 7 states. [2020-12-09 07:22:26,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:22:26,639 INFO L93 Difference]: Finished difference Result 283 states and 331 transitions. [2020-12-09 07:22:26,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 07:22:26,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-12-09 07:22:26,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:22:26,641 INFO L225 Difference]: With dead ends: 283 [2020-12-09 07:22:26,641 INFO L226 Difference]: Without dead ends: 283 [2020-12-09 07:22:26,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-09 07:22:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-12-09 07:22:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 173. [2020-12-09 07:22:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-12-09 07:22:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 209 transitions. [2020-12-09 07:22:26,644 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 209 transitions. Word has length 34 [2020-12-09 07:22:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:22:26,644 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 209 transitions. [2020-12-09 07:22:26,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 07:22:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 209 transitions. [2020-12-09 07:22:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-09 07:22:26,644 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:22:26,644 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:22:26,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2020-12-09 07:22:26,645 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:22:26,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:22:26,645 INFO L82 PathProgramCache]: Analyzing trace with hash -548610378, now seen corresponding path program 1 times [2020-12-09 07:22:26,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:22:26,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893840915] [2020-12-09 07:22:26,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:22:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 07:22:26,682 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 07:22:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 07:22:26,713 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 07:22:26,732 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 07:22:26,733 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 07:22:26,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2020-12-09 07:22:26,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:22:26 BoogieIcfgContainer [2020-12-09 07:22:26,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 07:22:26,780 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 07:22:26,780 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 07:22:26,780 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 07:22:26,780 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:20:23" (3/4) ... [2020-12-09 07:22:26,782 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-09 07:22:26,782 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 07:22:26,783 INFO L168 Benchmark]: Toolchain (without parser) took 124036.33 ms. Allocated memory was 96.5 MB in the beginning and 172.0 MB in the end (delta: 75.5 MB). Free memory was 73.2 MB in the beginning and 61.8 MB in the end (delta: 11.3 MB). Peak memory consumption was 85.5 MB. Max. memory is 16.1 GB. [2020-12-09 07:22:26,783 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 67.1 MB. Free memory was 43.3 MB in the beginning and 43.2 MB in the end (delta: 67.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 07:22:26,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.40 ms. Allocated memory is still 96.5 MB. Free memory was 72.8 MB in the beginning and 68.0 MB in the end (delta: 4.8 MB). Peak memory consumption was 27.9 MB. Max. memory is 16.1 GB. [2020-12-09 07:22:26,783 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.84 ms. Allocated memory is still 96.5 MB. Free memory was 68.0 MB in the beginning and 65.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 07:22:26,784 INFO L168 Benchmark]: Boogie Preprocessor took 25.62 ms. Allocated memory is still 96.5 MB. Free memory was 65.4 MB in the beginning and 63.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 07:22:26,784 INFO L168 Benchmark]: RCFGBuilder took 553.01 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 63.3 MB in the beginning and 83.3 MB in the end (delta: -20.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 16.1 GB. [2020-12-09 07:22:26,784 INFO L168 Benchmark]: TraceAbstraction took 122988.30 ms. Allocated memory was 117.4 MB in the beginning and 172.0 MB in the end (delta: 54.5 MB). Free memory was 82.5 MB in the beginning and 61.8 MB in the end (delta: 20.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 16.1 GB. [2020-12-09 07:22:26,784 INFO L168 Benchmark]: Witness Printer took 2.72 ms. Allocated memory is still 172.0 MB. Free memory is still 61.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 07:22:26,786 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 67.1 MB. Free memory was 43.3 MB in the beginning and 43.2 MB in the end (delta: 67.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 423.40 ms. Allocated memory is still 96.5 MB. Free memory was 72.8 MB in the beginning and 68.0 MB in the end (delta: 4.8 MB). Peak memory consumption was 27.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.84 ms. Allocated memory is still 96.5 MB. Free memory was 68.0 MB in the beginning and 65.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.62 ms. Allocated memory is still 96.5 MB. Free memory was 65.4 MB in the beginning and 63.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 553.01 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 63.3 MB in the beginning and 83.3 MB in the end (delta: -20.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 122988.30 ms. Allocated memory was 117.4 MB in the beginning and 172.0 MB in the end (delta: 54.5 MB). Free memory was 82.5 MB in the beginning and 61.8 MB in the end (delta: 20.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 16.1 GB. * Witness Printer took 2.72 ms. Allocated memory is still 172.0 MB. Free memory is still 61.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 721]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693, overapproximation of memtrack at line 721. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L692] int i = 0; VAL [commands={12:0}, global={0:0}, state=0] [L692] COND TRUE i < 2 VAL [commands={12:0}, global={0:0}, state=0] [L693] EXPR commands[i].name VAL [commands={12:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={12:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={12:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={12:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={12:0}, global={0:0}, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [commands={12:0}, global={0:0}, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] commands[i].function [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) [L706] COND FALSE !(\read(*global)) [L708] global = x [L709] state = STATE_2 VAL [commands={12:0}, global={-3:0}, state=1] [L692] int i = 0; VAL [commands={12:0}, global={-3:0}, state=1] [L692] COND TRUE i < 2 VAL [commands={12:0}, global={-3:0}, state=1] [L693] EXPR commands[i].name VAL [commands={12:0}, global={-3:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={12:0}, global={-3:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={12:0}, global={-3:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={12:0}, global={-3:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={12:0}, global={-3:0}, state=1] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [commands={12:0}, global={-3:0}, state=1] [L694] COND TRUE state >= commands[i].state_needed [L695] commands[i].function [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) [L706] COND TRUE \read(*global) [L708] global = x [L709] state = STATE_2 VAL [commands={12:0}, global={5:0}, state=1] [L692] int i = 0; VAL [commands={12:0}, global={5:0}, state=1] [L692] COND TRUE i < 2 VAL [commands={12:0}, global={5:0}, state=1] [L693] EXPR commands[i].name VAL [commands={12:0}, global={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={12:0}, global={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={12:0}, global={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={12:0}, global={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={12:0}, global={5:0}, state=1] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [commands={12:0}, global={5:0}, state=1] [L694] COND TRUE state >= commands[i].state_needed [L695] commands[i].function [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) [L706] COND TRUE \read(*global) [L708] global = x [L709] state = STATE_2 VAL [commands={12:0}, global={-6:0}, state=1] [L725] return 0; VAL [commands={12:0}, global={-6:0}, state=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 133 locations, 58 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 122.9s, OverallIterations: 26, TraceHistogramMax: 2, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2454 SDtfs, 8293 SDslu, 4542 SDs, 0 SdLazy, 6565 SolverSat, 949 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 556 GetRequests, 204 SyntacticMatches, 76 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4238 ImplicationChecksByTransitivity, 99.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 1794 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 31.6s InterpolantComputationTime, 649 NumberOfCodeBlocks, 649 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 699 ConstructedInterpolants, 85 QuantifiedInterpolants, 380459 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1093 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 37 InterpolantComputations, 19 PerfectInterpolantSequences, 9/57 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME[ms]: 1629, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 23, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 61, TOOLS_POST_TIME[ms]: 848, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 61, TOOLS_QUANTIFIERELIM_TIME[ms]: 829, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 369, FLUID_QUERY_TIME[ms]: 4, FLUID_QUERIES: 96, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 3, DOMAIN_JOIN_TIME[ms]: 221, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME[ms]: 309, DOMAIN_ISSUBSETEQ_APPLICATIONS: 4, DOMAIN_ISSUBSETEQ_TIME[ms]: 26, DOMAIN_ISBOTTOM_APPLICATIONS: 23, DOMAIN_ISBOTTOM_TIME[ms]: 186, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 424, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 424, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 4, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 1, PATH_EXPR_TIME[ms]: 2, REGEX_TO_DAG_TIME[ms]: 2, DAG_COMPRESSION_TIME[ms]: 8, DAG_COMPRESSION_PROCESSED_NODES: 442, DAG_COMPRESSION_RETAINED_NODES: 99, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-09 07:22:28,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 07:22:28,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 07:22:28,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 07:22:28,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 07:22:28,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 07:22:28,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 07:22:28,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 07:22:28,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 07:22:28,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 07:22:28,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 07:22:28,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 07:22:28,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 07:22:28,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 07:22:28,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 07:22:28,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 07:22:28,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 07:22:28,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 07:22:28,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 07:22:28,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 07:22:28,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 07:22:28,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 07:22:28,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 07:22:28,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 07:22:28,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 07:22:28,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 07:22:28,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 07:22:28,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 07:22:28,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 07:22:28,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 07:22:28,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 07:22:28,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 07:22:28,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 07:22:28,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 07:22:28,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 07:22:28,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 07:22:28,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 07:22:28,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 07:22:28,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 07:22:28,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 07:22:28,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 07:22:28,335 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2020-12-09 07:22:28,361 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 07:22:28,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 07:22:28,362 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 07:22:28,362 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 07:22:28,362 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 07:22:28,362 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 07:22:28,362 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 07:22:28,362 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 07:22:28,362 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 07:22:28,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 07:22:28,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 07:22:28,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 07:22:28,363 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 07:22:28,363 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 07:22:28,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 07:22:28,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 07:22:28,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 07:22:28,364 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 07:22:28,364 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 07:22:28,364 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 07:22:28,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 07:22:28,364 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 07:22:28,365 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 07:22:28,365 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 07:22:28,365 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 07:22:28,365 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 07:22:28,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 07:22:28,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 07:22:28,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 07:22:28,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 07:22:28,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 07:22:28,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 07:22:28,366 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 07:22:28,366 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 07:22:28,366 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 07:22:28,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 07:22:28,366 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_b3434ad0-c423-454a-a719-ef8838b71404/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 -> b34e199f0da2018b0ae97fc3f9a24725315a1b16 [2020-12-09 07:22:28,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 07:22:28,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 07:22:28,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 07:22:28,620 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 07:22:28,620 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 07:22:28,621 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/../../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2020-12-09 07:22:28,663 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/data/a9ffcb791/611fe8171c814ab29b2df0f5497710a5/FLAG5f2c3f64b [2020-12-09 07:22:29,089 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 07:22:29,090 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2020-12-09 07:22:29,101 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/data/a9ffcb791/611fe8171c814ab29b2df0f5497710a5/FLAG5f2c3f64b [2020-12-09 07:22:29,110 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/data/a9ffcb791/611fe8171c814ab29b2df0f5497710a5 [2020-12-09 07:22:29,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 07:22:29,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 07:22:29,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 07:22:29,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 07:22:29,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 07:22:29,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:22:29" (1/1) ... [2020-12-09 07:22:29,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b94bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:29, skipping insertion in model container [2020-12-09 07:22:29,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:22:29" (1/1) ... [2020-12-09 07:22:29,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 07:22:29,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 07:22:29,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:22:29,404 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 07:22:29,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:22:29,495 INFO L208 MainTranslator]: Completed translation [2020-12-09 07:22:29,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:29 WrapperNode [2020-12-09 07:22:29,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 07:22:29,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 07:22:29,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 07:22:29,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 07:22:29,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:29" (1/1) ... [2020-12-09 07:22:29,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:29" (1/1) ... [2020-12-09 07:22:29,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 07:22:29,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 07:22:29,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 07:22:29,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 07:22:29,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:29" (1/1) ... [2020-12-09 07:22:29,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:29" (1/1) ... [2020-12-09 07:22:29,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:29" (1/1) ... [2020-12-09 07:22:29,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:29" (1/1) ... [2020-12-09 07:22:29,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:29" (1/1) ... [2020-12-09 07:22:29,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:29" (1/1) ... [2020-12-09 07:22:29,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:29" (1/1) ... [2020-12-09 07:22:29,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 07:22:29,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 07:22:29,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 07:22:29,564 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 07:22:29,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/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 [2020-12-09 07:22:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2020-12-09 07:22:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 07:22:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 07:22:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 07:22:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 07:22:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-09 07:22:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 07:22:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 07:22:29,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 07:22:30,262 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 07:22:30,263 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2020-12-09 07:22:30,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:22:30 BoogieIcfgContainer [2020-12-09 07:22:30,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 07:22:30,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 07:22:30,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 07:22:30,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 07:22:30,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:22:29" (1/3) ... [2020-12-09 07:22:30,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef7950a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:22:30, skipping insertion in model container [2020-12-09 07:22:30,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:29" (2/3) ... [2020-12-09 07:22:30,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef7950a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:22:30, skipping insertion in model container [2020-12-09 07:22:30,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:22:30" (3/3) ... [2020-12-09 07:22:30,271 INFO L111 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2020-12-09 07:22:30,283 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 07:22:30,285 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 58 error locations. [2020-12-09 07:22:30,293 INFO L253 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2020-12-09 07:22:30,306 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 07:22:30,306 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 07:22:30,307 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 07:22:30,307 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 07:22:30,307 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 07:22:30,307 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 07:22:30,307 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 07:22:30,307 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 07:22:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2020-12-09 07:22:30,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 07:22:30,324 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:22:30,325 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 07:22:30,325 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:22:30,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:22:30,329 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-12-09 07:22:30,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:22:30,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134308205] [2020-12-09 07:22:30,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/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 [2020-12-09 07:22:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:30,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 07:22:30,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:22:30,785 WARN L197 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2020-12-09 07:22:30,786 INFO L348 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2020-12-09 07:22:30,787 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2020-12-09 07:22:30,795 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:30,881 INFO L625 ElimStorePlain]: treesize reduction 12, result has 83.6 percent of original size [2020-12-09 07:22:30,900 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 07:22:30,907 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 07:22:30,911 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 07:22:30,915 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 07:22:30,918 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 07:22:30,921 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 07:22:30,928 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-09 07:22:30,928 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:63 [2020-12-09 07:22:30,936 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 07:22:30,940 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 07:22:30,942 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 07:22:30,945 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 07:22:30,947 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 07:22:30,950 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 07:22:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:30,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:22:30,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134308205] [2020-12-09 07:22:30,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:22:30,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 07:22:30,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637214329] [2020-12-09 07:22:30,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:22:30,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:22:30,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:22:30,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:22:30,996 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 3 states. [2020-12-09 07:22:31,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:22:31,250 INFO L93 Difference]: Finished difference Result 156 states and 177 transitions. [2020-12-09 07:22:31,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:22:31,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-09 07:22:31,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:22:31,257 INFO L225 Difference]: With dead ends: 156 [2020-12-09 07:22:31,257 INFO L226 Difference]: Without dead ends: 152 [2020-12-09 07:22:31,258 INFO L677 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 [2020-12-09 07:22:31,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-12-09 07:22:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 146. [2020-12-09 07:22:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-09 07:22:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2020-12-09 07:22:31,286 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 4 [2020-12-09 07:22:31,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:22:31,287 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2020-12-09 07:22:31,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:22:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2020-12-09 07:22:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 07:22:31,287 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:22:31,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 07:22:31,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 07:22:31,490 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:22:31,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:22:31,493 INFO L82 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2020-12-09 07:22:31,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:22:31,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217102859] [2020-12-09 07:22:31,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/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 [2020-12-09 07:22:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:31,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 07:22:31,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:22:31,860 WARN L197 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 07:22:31,861 INFO L348 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2020-12-09 07:22:31,861 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2020-12-09 07:22:31,866 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:31,954 INFO L625 ElimStorePlain]: treesize reduction 50, result has 53.7 percent of original size [2020-12-09 07:22:31,959 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 07:22:31,960 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:11 [2020-12-09 07:22:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:31,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:22:31,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217102859] [2020-12-09 07:22:31,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:22:31,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:22:31,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454645651] [2020-12-09 07:22:31,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:22:31,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:22:31,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:22:31,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:22:31,982 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand 4 states. [2020-12-09 07:22:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:22:32,311 INFO L93 Difference]: Finished difference Result 351 states and 393 transitions. [2020-12-09 07:22:32,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:22:32,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-12-09 07:22:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:22:32,314 INFO L225 Difference]: With dead ends: 351 [2020-12-09 07:22:32,314 INFO L226 Difference]: Without dead ends: 351 [2020-12-09 07:22:32,315 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:22:32,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2020-12-09 07:22:32,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 205. [2020-12-09 07:22:32,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-12-09 07:22:32,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 267 transitions. [2020-12-09 07:22:32,328 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 267 transitions. Word has length 4 [2020-12-09 07:22:32,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:22:32,328 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 267 transitions. [2020-12-09 07:22:32,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:22:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 267 transitions. [2020-12-09 07:22:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 07:22:32,329 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:22:32,329 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 07:22:32,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 07:22:32,531 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:22:32,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:22:32,533 INFO L82 PathProgramCache]: Analyzing trace with hash 28698698, now seen corresponding path program 1 times [2020-12-09 07:22:32,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:22:32,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599238348] [2020-12-09 07:22:32,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/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 [2020-12-09 07:22:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:32,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-09 07:22:32,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:22:32,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:32,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:32,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:32,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:32,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:32,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:32,902 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 47 [2020-12-09 07:22:32,903 INFO L348 Elim1Store]: treesize reduction 322, result has 20.7 percent of original size [2020-12-09 07:22:32,903 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 190 treesize of output 242 [2020-12-09 07:22:32,914 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-12-09 07:22:32,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:32,915 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-12-09 07:22:32,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:32,917 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 1] term [2020-12-09 07:22:32,917 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:32,920 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 2, 3, 1] term [2020-12-09 07:22:32,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:32,924 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:33,065 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2020-12-09 07:22:33,066 INFO L625 ElimStorePlain]: treesize reduction 12, result has 91.7 percent of original size [2020-12-09 07:22:33,133 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 07:22:33,134 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 65 [2020-12-09 07:22:33,137 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:33,287 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2020-12-09 07:22:33,288 INFO L625 ElimStorePlain]: treesize reduction 24, result has 83.3 percent of original size [2020-12-09 07:22:33,300 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 07:22:33,304 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 07:22:33,308 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 07:22:33,312 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 07:22:33,316 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 13 disjuncts [2020-12-09 07:22:33,352 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-09 07:22:33,352 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:122, output treesize:122 [2020-12-09 07:22:33,357 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 07:22:33,360 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 07:22:33,362 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 07:22:33,364 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 07:22:33,366 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 13 disjuncts [2020-12-09 07:22:33,430 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 07:22:33,432 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 07:22:33,434 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 07:22:33,436 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 07:22:33,437 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 13 disjuncts [2020-12-09 07:22:33,668 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 51 [2020-12-09 07:22:33,724 INFO L382 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 51 treesize of output 27 [2020-12-09 07:22:33,725 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:33,769 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 07:22:33,773 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-09 07:22:33,773 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:98, output treesize:69 [2020-12-09 07:22:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:33,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:22:33,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599238348] [2020-12-09 07:22:33,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:22:33,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:22:33,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664756541] [2020-12-09 07:22:33,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 07:22:33,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:22:33,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 07:22:33,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:22:33,816 INFO L87 Difference]: Start difference. First operand 205 states and 267 transitions. Second operand 5 states. [2020-12-09 07:22:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:22:35,402 INFO L93 Difference]: Finished difference Result 412 states and 516 transitions. [2020-12-09 07:22:35,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 07:22:35,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2020-12-09 07:22:35,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:22:35,405 INFO L225 Difference]: With dead ends: 412 [2020-12-09 07:22:35,405 INFO L226 Difference]: Without dead ends: 412 [2020-12-09 07:22:35,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:22:35,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2020-12-09 07:22:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 241. [2020-12-09 07:22:35,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-12-09 07:22:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 322 transitions. [2020-12-09 07:22:35,417 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 322 transitions. Word has length 5 [2020-12-09 07:22:35,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:22:35,417 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 322 transitions. [2020-12-09 07:22:35,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 07:22:35,417 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 322 transitions. [2020-12-09 07:22:35,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 07:22:35,417 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:22:35,418 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 07:22:35,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 07:22:35,620 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:22:35,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:22:35,621 INFO L82 PathProgramCache]: Analyzing trace with hash 889659685, now seen corresponding path program 1 times [2020-12-09 07:22:35,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:22:35,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171059002] [2020-12-09 07:22:35,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/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 [2020-12-09 07:22:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:35,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 07:22:35,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:22:35,797 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_45|], 12=[|v_#valid_77|]} [2020-12-09 07:22:35,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:35,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:35,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:35,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:35,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:35,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:35,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:36,055 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2020-12-09 07:22:36,055 INFO L348 Elim1Store]: treesize reduction 48, result has 70.0 percent of original size [2020-12-09 07:22:36,056 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 117 [2020-12-09 07:22:36,058 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:36,313 WARN L197 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2020-12-09 07:22:36,313 INFO L625 ElimStorePlain]: treesize reduction 60, result has 71.6 percent of original size [2020-12-09 07:22:36,359 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 07:22:36,359 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 182 [2020-12-09 07:22:36,361 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 1] term [2020-12-09 07:22:36,362 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:36,362 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-12-09 07:22:36,362 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:36,364 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 5, 2, 1] term [2020-12-09 07:22:36,364 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:36,365 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 5, 3, 5, 2, 4, 1] term [2020-12-09 07:22:36,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:36,367 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-12-09 07:22:36,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:36,371 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:36,619 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2020-12-09 07:22:36,620 INFO L625 ElimStorePlain]: treesize reduction 287, result has 31.7 percent of original size [2020-12-09 07:22:36,632 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 07:22:36,638 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 07:22:36,638 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2020-12-09 07:22:36,639 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2020-12-09 07:22:36,805 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2020-12-09 07:22:36,805 INFO L625 ElimStorePlain]: treesize reduction 6, result has 95.0 percent of original size [2020-12-09 07:22:36,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 07:22:36,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:36,814 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,815 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:36,818 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,819 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 07:22:36,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,825 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:36,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,828 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 07:22:36,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:36,833 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-09 07:22:36,833 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:116, output treesize:117 [2020-12-09 07:22:36,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 07:22:36,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:36,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:36,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 07:22:36,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:36,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,848 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 07:22:36,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:36,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,927 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 07:22:36,928 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,928 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:36,930 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,930 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:36,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,933 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,934 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 07:22:36,936 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:36,939 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:36,940 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 07:22:37,125 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2020-12-09 07:22:37,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:37,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:37,174 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 1] term [2020-12-09 07:22:37,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:37,200 INFO L382 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 [2020-12-09 07:22:37,201 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:37,366 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2020-12-09 07:22:37,367 INFO L625 ElimStorePlain]: treesize reduction 32, result has 79.1 percent of original size [2020-12-09 07:22:37,377 INFO L382 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 [2020-12-09 07:22:37,379 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:37,461 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 07:22:37,468 INFO L382 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 33 treesize of output 17 [2020-12-09 07:22:37,470 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:37,543 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 07:22:37,554 INFO L382 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 [2020-12-09 07:22:37,555 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:37,620 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 07:22:37,623 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2020-12-09 07:22:37,623 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:164, output treesize:79 [2020-12-09 07:22:37,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:37,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:22:37,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171059002] [2020-12-09 07:22:37,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:22:37,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:22:37,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613156990] [2020-12-09 07:22:37,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 07:22:37,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:22:37,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 07:22:37,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:22:37,718 INFO L87 Difference]: Start difference. First operand 241 states and 322 transitions. Second operand 5 states. [2020-12-09 07:22:38,059 WARN L197 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2020-12-09 07:22:38,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:22:38,939 INFO L93 Difference]: Finished difference Result 386 states and 448 transitions. [2020-12-09 07:22:38,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:22:38,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-12-09 07:22:38,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:22:38,942 INFO L225 Difference]: With dead ends: 386 [2020-12-09 07:22:38,942 INFO L226 Difference]: Without dead ends: 386 [2020-12-09 07:22:38,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:22:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2020-12-09 07:22:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 241. [2020-12-09 07:22:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-12-09 07:22:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 318 transitions. [2020-12-09 07:22:38,950 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 318 transitions. Word has length 6 [2020-12-09 07:22:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:22:38,950 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 318 transitions. [2020-12-09 07:22:38,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 07:22:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 318 transitions. [2020-12-09 07:22:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 07:22:38,951 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:22:38,951 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:22:39,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 07:22:39,153 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:22:39,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:22:39,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1809646508, now seen corresponding path program 1 times [2020-12-09 07:22:39,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:22:39,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366924376] [2020-12-09 07:22:39,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/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 [2020-12-09 07:22:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:39,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 07:22:39,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:22:39,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:39,467 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 33 [2020-12-09 07:22:39,467 INFO L348 Elim1Store]: treesize reduction 336, result has 15.2 percent of original size [2020-12-09 07:22:39,467 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 64 treesize of output 102 [2020-12-09 07:22:39,471 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:39,596 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2020-12-09 07:22:39,597 INFO L625 ElimStorePlain]: treesize reduction 34, result has 72.4 percent of original size [2020-12-09 07:22:39,612 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 07:22:39,612 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2020-12-09 07:22:39,613 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-09 07:22:39,693 INFO L625 ElimStorePlain]: treesize reduction 6, result has 92.8 percent of original size [2020-12-09 07:22:39,695 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 07:22:39,696 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 07:22:39,697 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 07:22:39,697 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 07:22:39,698 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 07:22:39,699 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 10 disjuncts [2020-12-09 07:22:39,705 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-09 07:22:39,705 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:58, output treesize:79 [2020-12-09 07:22:39,707 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 07:22:39,707 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 07:22:39,708 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 07:22:39,709 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 07:22:39,709 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 07:22:39,710 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 10 disjuncts [2020-12-09 07:22:39,738 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 07:22:39,739 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 07:22:39,740 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 07:22:39,741 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 07:22:39,741 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 07:22:39,742 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 10 disjuncts [2020-12-09 07:22:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:39,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:22:39,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366924376] [2020-12-09 07:22:39,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:22:39,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:22:39,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245469753] [2020-12-09 07:22:39,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:22:39,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:22:39,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:22:39,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:22:39,897 INFO L87 Difference]: Start difference. First operand 241 states and 318 transitions. Second operand 4 states. [2020-12-09 07:22:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:22:40,429 INFO L93 Difference]: Finished difference Result 315 states and 392 transitions. [2020-12-09 07:22:40,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:22:40,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-12-09 07:22:40,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:22:40,431 INFO L225 Difference]: With dead ends: 315 [2020-12-09 07:22:40,431 INFO L226 Difference]: Without dead ends: 315 [2020-12-09 07:22:40,431 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:22:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-12-09 07:22:40,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 260. [2020-12-09 07:22:40,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-12-09 07:22:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 350 transitions. [2020-12-09 07:22:40,437 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 350 transitions. Word has length 7 [2020-12-09 07:22:40,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:22:40,438 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 350 transitions. [2020-12-09 07:22:40,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:22:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 350 transitions. [2020-12-09 07:22:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 07:22:40,438 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:22:40,438 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:22:40,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 07:22:40,640 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:22:40,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:22:40,641 INFO L82 PathProgramCache]: Analyzing trace with hash 264466951, now seen corresponding path program 1 times [2020-12-09 07:22:40,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:22:40,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467461271] [2020-12-09 07:22:40,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/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 [2020-12-09 07:22:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:40,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 07:22:40,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:22:40,853 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_46|], 4=[|v_#valid_79|]} [2020-12-09 07:22:40,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:40,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:40,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:40,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:41,090 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2020-12-09 07:22:41,090 INFO L348 Elim1Store]: treesize reduction 108, result has 47.1 percent of original size [2020-12-09 07:22:41,091 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2020-12-09 07:22:41,093 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:41,223 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-12-09 07:22:41,223 INFO L625 ElimStorePlain]: treesize reduction 50, result has 65.0 percent of original size [2020-12-09 07:22:41,236 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2020-12-09 07:22:41,238 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-09 07:22:41,388 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2020-12-09 07:22:41,388 INFO L625 ElimStorePlain]: treesize reduction 22, result has 80.0 percent of original size [2020-12-09 07:22:41,396 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 07:22:41,401 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 07:22:41,401 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2020-12-09 07:22:41,401 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2020-12-09 07:22:41,515 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2020-12-09 07:22:41,515 INFO L625 ElimStorePlain]: treesize reduction 6, result has 92.5 percent of original size [2020-12-09 07:22:41,517 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,523 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-09 07:22:41,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,526 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,526 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,528 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,530 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 07:22:41,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,533 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,534 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,534 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:41,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,538 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,540 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:41,541 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:41,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,551 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,551 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,551 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,552 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,562 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,562 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,566 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,567 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,569 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,569 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,570 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,570 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,573 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,573 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 07:22:41,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,579 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,579 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 07:22:41,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:41,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:41,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 07:22:41,593 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,593 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:41,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 07:22:41,600 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-09 07:22:41,600 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:60, output treesize:74 [2020-12-09 07:22:41,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-09 07:22:41,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 07:22:41,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:41,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:41,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:41,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,625 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 07:22:41,643 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,643 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 07:22:41,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:41,651 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,651 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:41,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 07:22:41,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:41,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 07:22:41,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-09 07:22:41,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 07:22:41,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:41,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:41,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,701 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,710 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,710 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 07:22:41,711 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,711 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 07:22:41,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,716 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:41,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:41,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,728 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:22:41,729 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,729 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,729 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 07:22:41,732 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 07:22:41,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 07:22:41,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 07:22:41,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:41,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:41,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:41,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:41,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:22:41,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:22:41,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:22:42,013 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 35 [2020-12-09 07:22:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:42,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:22:42,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467461271] [2020-12-09 07:22:42,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:22:42,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:22:42,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037686974] [2020-12-09 07:22:42,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:22:42,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:22:42,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:22:42,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:22:42,117 INFO L87 Difference]: Start difference. First operand 260 states and 350 transitions. Second operand 4 states. [2020-12-09 07:22:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:22:42,747 INFO L93 Difference]: Finished difference Result 329 states and 413 transitions. [2020-12-09 07:22:42,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:22:42,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-12-09 07:22:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:22:42,749 INFO L225 Difference]: With dead ends: 329 [2020-12-09 07:22:42,750 INFO L226 Difference]: Without dead ends: 329 [2020-12-09 07:22:42,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:22:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-12-09 07:22:42,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 259. [2020-12-09 07:22:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2020-12-09 07:22:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 348 transitions. [2020-12-09 07:22:42,755 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 348 transitions. Word has length 8 [2020-12-09 07:22:42,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:22:42,755 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 348 transitions. [2020-12-09 07:22:42,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:22:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 348 transitions. [2020-12-09 07:22:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 07:22:42,755 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:22:42,755 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:22:42,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 07:22:42,957 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:22:42,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:22:42,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1118688979, now seen corresponding path program 1 times [2020-12-09 07:22:42,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:22:42,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646901862] [2020-12-09 07:22:42,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/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 [2020-12-09 07:22:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:43,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 07:22:43,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:22:43,332 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 07:22:43,333 INFO L348 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2020-12-09 07:22:43,333 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2020-12-09 07:22:43,335 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:43,431 INFO L625 ElimStorePlain]: treesize reduction 50, result has 53.7 percent of original size [2020-12-09 07:22:43,433 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 07:22:43,433 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:11 [2020-12-09 07:22:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:43,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:22:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:43,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646901862] [2020-12-09 07:22:43,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2092956833] [2020-12-09 07:22:43,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt [2020-12-09 07:22:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:43,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 07:22:43,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:22:44,072 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 07:22:44,072 INFO L348 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2020-12-09 07:22:44,072 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2020-12-09 07:22:44,074 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:44,155 INFO L625 ElimStorePlain]: treesize reduction 50, result has 53.7 percent of original size [2020-12-09 07:22:44,157 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 07:22:44,157 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:11 [2020-12-09 07:22:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:44,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:22:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:44,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388840085] [2020-12-09 07:22:44,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/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 [2020-12-09 07:22:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:44,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 07:22:44,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:22:44,486 WARN L197 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 07:22:44,486 INFO L348 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2020-12-09 07:22:44,486 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2020-12-09 07:22:44,489 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:44,574 INFO L625 ElimStorePlain]: treesize reduction 50, result has 53.7 percent of original size [2020-12-09 07:22:44,576 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 07:22:44,577 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:11 [2020-12-09 07:22:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:44,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:22:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:44,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 07:22:44,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3, 3, 3, 4] total 8 [2020-12-09 07:22:44,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922565830] [2020-12-09 07:22:44,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 07:22:44,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:22:44,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 07:22:44,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-12-09 07:22:44,814 INFO L87 Difference]: Start difference. First operand 259 states and 348 transitions. Second operand 10 states. [2020-12-09 07:22:45,048 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2020-12-09 07:22:46,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:22:46,529 INFO L93 Difference]: Finished difference Result 742 states and 886 transitions. [2020-12-09 07:22:46,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 07:22:46,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2020-12-09 07:22:46,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:22:46,533 INFO L225 Difference]: With dead ends: 742 [2020-12-09 07:22:46,533 INFO L226 Difference]: Without dead ends: 742 [2020-12-09 07:22:46,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2020-12-09 07:22:46,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2020-12-09 07:22:46,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 374. [2020-12-09 07:22:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-12-09 07:22:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 530 transitions. [2020-12-09 07:22:46,542 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 530 transitions. Word has length 12 [2020-12-09 07:22:46,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:22:46,542 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 530 transitions. [2020-12-09 07:22:46,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 07:22:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 530 transitions. [2020-12-09 07:22:46,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 07:22:46,542 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:22:46,542 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:22:47,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt,8 mathsat -unsat_core_generation=3,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 07:22:47,146 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 07:22:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:22:47,147 INFO L82 PathProgramCache]: Analyzing trace with hash -319620029, now seen corresponding path program 1 times [2020-12-09 07:22:47,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:22:47,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244410803] [2020-12-09 07:22:47,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-12-09 07:22:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:47,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 07:22:47,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:22:47,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 07:22:47,538 WARN L197 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 44 [2020-12-09 07:22:47,538 INFO L348 Elim1Store]: treesize reduction 429, result has 15.7 percent of original size [2020-12-09 07:22:47,538 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 133 treesize of output 183 [2020-12-09 07:22:47,540 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2020-12-09 07:22:47,540 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:47,541 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 1] term [2020-12-09 07:22:47,541 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:47,544 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:47,726 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2020-12-09 07:22:47,726 INFO L625 ElimStorePlain]: treesize reduction 106, result has 55.8 percent of original size [2020-12-09 07:22:47,746 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 07:22:47,746 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2020-12-09 07:22:47,747 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-09 07:22:47,885 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2020-12-09 07:22:47,885 INFO L625 ElimStorePlain]: treesize reduction 6, result has 95.3 percent of original size [2020-12-09 07:22:47,888 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 07:22:47,889 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 07:22:47,890 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 07:22:47,890 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 07:22:47,891 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 12 disjuncts [2020-12-09 07:22:47,905 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-09 07:22:47,905 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:102, output treesize:124 [2020-12-09 07:22:47,907 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 07:22:47,908 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 07:22:47,909 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 07:22:47,909 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 07:22:47,910 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 12 disjuncts [2020-12-09 07:22:47,949 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 07:22:47,949 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 07:22:47,950 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 07:22:47,951 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 07:22:47,952 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 12 disjuncts [2020-12-09 07:22:52,890 WARN L197 SmtUtils]: Spent 4.85 s on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2020-12-09 07:22:55,629 WARN L197 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 07:22:55,656 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 7, 1] term [2020-12-09 07:22:55,656 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 07:22:55,681 INFO L382 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 41 treesize of output 21 [2020-12-09 07:22:55,682 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:55,847 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-12-09 07:22:55,848 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 07:22:55,854 INFO L382 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 41 treesize of output 21 [2020-12-09 07:22:55,855 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:56,000 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-12-09 07:22:56,001 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 07:22:56,011 INFO L382 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 41 treesize of output 21 [2020-12-09 07:22:56,012 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:56,165 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-09 07:22:56,165 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 07:22:56,171 INFO L547 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-2 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2020-12-09 07:22:56,171 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:276, output treesize:209 [2020-12-09 07:22:56,393 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 32 [2020-12-09 07:22:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:56,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:22:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:22:56,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244410803] [2020-12-09 07:22:56,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1353465175] [2020-12-09 07:22:56,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt [2020-12-09 07:22:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:22:56,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 07:22:56,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:22:57,138 WARN L197 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 53 [2020-12-09 07:22:57,139 INFO L348 Elim1Store]: treesize reduction 591, result has 15.0 percent of original size [2020-12-09 07:22:57,139 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 675 treesize of output 729 [2020-12-09 07:22:57,143 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-12-09 07:22:57,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:57,143 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-12-09 07:22:57,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:57,145 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 3, 2, 2, 1] term [2020-12-09 07:22:57,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:57,145 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 3, 2, 2, 1] term [2020-12-09 07:22:57,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:57,146 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-12-09 07:22:57,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:57,147 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 3, 3, 3, 3, 2, 2, 1] term [2020-12-09 07:22:57,147 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:57,147 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 2, 1] term [2020-12-09 07:22:57,147 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:22:57,148 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 2, 1] term [2020-12-09 07:22:57,148 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:57,149 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 5, 3, 3, 3, 3, 2, 2, 1] term [2020-12-09 07:22:57,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:22:57,160 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 07:22:57,387 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2020-12-09 07:22:57,387 INFO L625 ElimStorePlain]: treesize reduction 311, result has 33.1 percent of original size [2020-12-09 07:22:57,389 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 07:22:57,390 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 07:22:57,391 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 07:22:57,392 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 12 disjuncts [2020-12-09 07:22:57,394 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 07:22:57,395 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:122, output treesize:156 [2020-12-09 07:22:57,396 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 07:22:57,397 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 07:22:57,398 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 07:22:57,398 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 12 disjuncts [2020-12-09 07:22:57,501 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 07:22:57,502 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 07:22:57,503 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 07:22:57,503 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 12 disjuncts [2020-12-09 07:23:03,355 WARN L197 SmtUtils]: Spent 5.71 s on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2020-12-09 07:23:04,354 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-09 07:23:04,375 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 9, 1] term [2020-12-09 07:23:04,375 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 07:23:04,387 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 07:23:04,412 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 40 [2020-12-09 07:23:04,414 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 07:23:04,587 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-12-09 07:23:04,587 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 07:23:04,596 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 40 [2020-12-09 07:23:04,598 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 07:23:04,766 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-12-09 07:23:04,767 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 07:23:04,775 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 40 [2020-12-09 07:23:04,776 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 07:23:04,929 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-09 07:23:04,929 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 07:23:04,936 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2020-12-09 07:23:04,936 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:340, output treesize:219 [2020-12-09 07:23:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:23:05,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:23:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:23:05,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871650543] [2020-12-09 07:23:05,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3434ad0-c423-454a-a719-ef8838b71404/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 07:23:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 07:23:05,308 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 07:23:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 07:23:05,347 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 07:23:05,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 mathsat -unsat_core_generation=3,12 cvc4 --incremental --print-success --lang smt [2020-12-09 07:23:05,988 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [1244410803] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [871650543] failed with TRACE_FEASIBLE at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:326) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 07:23:05,996 INFO L168 Benchmark]: Toolchain (without parser) took 36882.42 ms. Allocated memory was 48.2 MB in the beginning and 111.1 MB in the end (delta: 62.9 MB). Free memory was 23.1 MB in the beginning and 51.2 MB in the end (delta: -28.1 MB). Peak memory consumption was 35.6 MB. Max. memory is 16.1 GB. [2020-12-09 07:23:05,996 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 48.2 MB. Free memory is still 30.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 07:23:05,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.33 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 22.9 MB in the beginning and 33.7 MB in the end (delta: -10.8 MB). Peak memory consumption was 6.5 MB. Max. memory is 16.1 GB. [2020-12-09 07:23:05,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.58 ms. Allocated memory is still 58.7 MB. Free memory was 33.7 MB in the beginning and 31.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 07:23:05,997 INFO L168 Benchmark]: Boogie Preprocessor took 27.27 ms. Allocated memory is still 58.7 MB. Free memory was 31.0 MB in the beginning and 28.8 MB in the end (delta: 2.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 07:23:05,998 INFO L168 Benchmark]: RCFGBuilder took 700.89 ms. Allocated memory was 58.7 MB in the beginning and 75.5 MB in the end (delta: 16.8 MB). Free memory was 28.8 MB in the beginning and 46.6 MB in the end (delta: -17.8 MB). Peak memory consumption was 12.7 MB. Max. memory is 16.1 GB. [2020-12-09 07:23:05,998 INFO L168 Benchmark]: TraceAbstraction took 35729.00 ms. Allocated memory was 75.5 MB in the beginning and 111.1 MB in the end (delta: 35.7 MB). Free memory was 46.2 MB in the beginning and 51.2 MB in the end (delta: -5.0 MB). Peak memory consumption was 31.1 MB. Max. memory is 16.1 GB. [2020-12-09 07:23:06,000 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 48.2 MB. Free memory is still 30.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 382.33 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 22.9 MB in the beginning and 33.7 MB in the end (delta: -10.8 MB). Peak memory consumption was 6.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.58 ms. Allocated memory is still 58.7 MB. Free memory was 33.7 MB in the beginning and 31.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.27 ms. Allocated memory is still 58.7 MB. Free memory was 31.0 MB in the beginning and 28.8 MB in the end (delta: 2.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 700.89 ms. Allocated memory was 58.7 MB in the beginning and 75.5 MB in the end (delta: 16.8 MB). Free memory was 28.8 MB in the beginning and 46.6 MB in the end (delta: -17.8 MB). Peak memory consumption was 12.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 35729.00 ms. Allocated memory was 75.5 MB in the beginning and 111.1 MB in the end (delta: 35.7 MB). Free memory was 46.2 MB in the beginning and 51.2 MB in the end (delta: -5.0 MB). Peak memory consumption was 31.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [1244410803] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [871650543] failed with TRACE_FEASIBLE de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [1244410803] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [871650543] failed with TRACE_FEASIBLE: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:326) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...