./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 349f58ffdccd311d6bfdc9aeda8effe69db2cc43 ...................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 349f58ffdccd311d6bfdc9aeda8effe69db2cc43 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 21:19:59,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:19:59,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:19:59,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:19:59,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:19:59,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:19:59,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:19:59,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:19:59,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:19:59,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:19:59,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:19:59,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:19:59,631 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:19:59,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:19:59,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:19:59,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:19:59,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:19:59,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:19:59,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:19:59,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:19:59,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:19:59,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:19:59,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:19:59,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:19:59,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:19:59,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:19:59,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:19:59,643 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:19:59,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:19:59,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:19:59,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:19:59,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:19:59,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:19:59,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:19:59,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:19:59,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:19:59,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:19:59,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:19:59,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:19:59,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:19:59,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:19:59,648 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:19:59,658 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:19:59,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:19:59,658 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:19:59,659 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:19:59,659 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:19:59,659 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:19:59,659 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:19:59,659 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:19:59,659 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:19:59,659 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:19:59,660 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:19:59,660 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:19:59,660 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:19:59,660 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:19:59,660 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:19:59,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:19:59,661 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:19:59,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:19:59,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:19:59,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:19:59,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:19:59,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:19:59,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:19:59,662 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:19:59,662 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:19:59,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:19:59,662 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:19:59,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:19:59,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:19:59,663 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:19:59,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:19:59,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:19:59,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:19:59,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:19:59,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:19:59,664 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:19:59,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:19:59,664 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:19:59,664 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:19:59,664 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:19:59,665 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/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 ! call(__VERIFIER_error())) ) 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 -> 349f58ffdccd311d6bfdc9aeda8effe69db2cc43 [2019-12-07 21:19:59,768 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:19:59,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:19:59,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:19:59,782 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:19:59,782 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:19:59,783 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2019-12-07 21:19:59,830 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/data/70ac5fecc/0fac358f842c4638829eb50657c37c57/FLAGef65d8a04 [2019-12-07 21:20:00,264 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:20:00,264 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2019-12-07 21:20:00,274 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/data/70ac5fecc/0fac358f842c4638829eb50657c37c57/FLAGef65d8a04 [2019-12-07 21:20:00,610 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/data/70ac5fecc/0fac358f842c4638829eb50657c37c57 [2019-12-07 21:20:00,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:20:00,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:20:00,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:20:00,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:20:00,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:20:00,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:20:00" (1/1) ... [2019-12-07 21:20:00,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b180c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:00, skipping insertion in model container [2019-12-07 21:20:00,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:20:00" (1/1) ... [2019-12-07 21:20:00,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:20:00,654 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:20:00,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:20:00,887 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-12-07 21:20:00,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@265a3227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:00, skipping insertion in model container [2019-12-07 21:20:00,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:20:00,888 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2019-12-07 21:20:00,890 INFO L168 Benchmark]: Toolchain (without parser) took 273.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:00,890 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:20:00,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:00,892 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 270.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 628]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 21:20:02,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:20:02,041 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:20:02,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:20:02,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:20:02,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:20:02,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:20:02,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:20:02,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:20:02,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:20:02,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:20:02,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:20:02,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:20:02,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:20:02,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:20:02,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:20:02,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:20:02,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:20:02,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:20:02,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:20:02,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:20:02,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:20:02,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:20:02,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:20:02,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:20:02,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:20:02,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:20:02,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:20:02,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:20:02,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:20:02,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:20:02,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:20:02,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:20:02,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:20:02,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:20:02,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:20:02,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:20:02,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:20:02,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:20:02,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:20:02,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:20:02,074 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-12-07 21:20:02,084 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:20:02,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:20:02,084 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:20:02,085 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:20:02,085 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:20:02,085 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:20:02,085 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:20:02,085 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:20:02,085 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:20:02,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:20:02,086 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:20:02,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:20:02,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:20:02,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:20:02,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:20:02,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:20:02,087 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:20:02,087 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 21:20:02,087 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 21:20:02,087 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:20:02,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:20:02,087 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:20:02,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:20:02,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:20:02,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 21:20:02,088 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:20:02,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:20:02,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:20:02,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:20:02,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:20:02,089 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:20:02,089 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 21:20:02,089 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 21:20:02,089 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:20:02,089 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:20:02,089 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:20:02,090 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/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 ! call(__VERIFIER_error())) ) 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 -> 349f58ffdccd311d6bfdc9aeda8effe69db2cc43 [2019-12-07 21:20:02,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:20:02,272 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:20:02,274 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:20:02,275 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:20:02,275 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:20:02,275 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2019-12-07 21:20:02,314 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/data/efa9f9073/57e90191208843c48ca941104943f1aa/FLAG1040b1af2 [2019-12-07 21:20:02,811 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:20:02,811 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2019-12-07 21:20:02,824 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/data/efa9f9073/57e90191208843c48ca941104943f1aa/FLAG1040b1af2 [2019-12-07 21:20:02,836 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/data/efa9f9073/57e90191208843c48ca941104943f1aa [2019-12-07 21:20:02,838 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:20:02,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:20:02,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:20:02,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:20:02,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:20:02,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:20:02" (1/1) ... [2019-12-07 21:20:02,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@576048d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:02, skipping insertion in model container [2019-12-07 21:20:02,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:20:02" (1/1) ... [2019-12-07 21:20:02,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:20:02,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:20:03,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:20:03,151 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 21:20:03,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:20:03,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:20:03,187 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:20:03,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:20:03,261 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:20:03,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:03 WrapperNode [2019-12-07 21:20:03,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:20:03,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:20:03,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:20:03,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:20:03,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:03" (1/1) ... [2019-12-07 21:20:03,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:03" (1/1) ... [2019-12-07 21:20:03,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:20:03,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:20:03,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:20:03,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:20:03,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:03" (1/1) ... [2019-12-07 21:20:03,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:03" (1/1) ... [2019-12-07 21:20:03,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:03" (1/1) ... [2019-12-07 21:20:03,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:03" (1/1) ... [2019-12-07 21:20:03,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:03" (1/1) ... [2019-12-07 21:20:03,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:03" (1/1) ... [2019-12-07 21:20:03,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:03" (1/1) ... [2019-12-07 21:20:03,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:20:03,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:20:03,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:20:03,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:20:03,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:20:03,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 21:20:03,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 21:20:03,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:20:03,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 21:20:03,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:20:03,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 21:20:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:20:03,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:20:03,852 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:20:03,853 INFO L287 CfgBuilder]: Removed 51 assume(true) statements. [2019-12-07 21:20:03,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:20:03 BoogieIcfgContainer [2019-12-07 21:20:03,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:20:03,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:20:03,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:20:03,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:20:03,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:20:02" (1/3) ... [2019-12-07 21:20:03,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b4eb59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:20:03, skipping insertion in model container [2019-12-07 21:20:03,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:03" (2/3) ... [2019-12-07 21:20:03,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b4eb59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:20:03, skipping insertion in model container [2019-12-07 21:20:03,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:20:03" (3/3) ... [2019-12-07 21:20:03,858 INFO L109 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-1.i [2019-12-07 21:20:03,864 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:20:03,869 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-12-07 21:20:03,876 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-07 21:20:03,891 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:20:03,891 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:20:03,891 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:20:03,891 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:20:03,891 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:20:03,892 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:20:03,892 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:20:03,892 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:20:03,901 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-12-07 21:20:03,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:20:03,905 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:03,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:03,906 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:03,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:03,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1088394025, now seen corresponding path program 1 times [2019-12-07 21:20:03,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:20:03,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409004376] [2019-12-07 21:20:03,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 21:20:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:03,996 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 21:20:03,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:04,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:04,008 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:04,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:04,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409004376] [2019-12-07 21:20:04,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:04,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 21:20:04,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882420824] [2019-12-07 21:20:04,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 21:20:04,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:20:04,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 21:20:04,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 21:20:04,028 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2019-12-07 21:20:04,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:04,047 INFO L93 Difference]: Finished difference Result 101 states and 141 transitions. [2019-12-07 21:20:04,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 21:20:04,049 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-12-07 21:20:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:04,056 INFO L225 Difference]: With dead ends: 101 [2019-12-07 21:20:04,057 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 21:20:04,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 21:20:04,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 21:20:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-07 21:20:04,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 21:20:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2019-12-07 21:20:04,083 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 11 [2019-12-07 21:20:04,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:04,083 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2019-12-07 21:20:04,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 21:20:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2019-12-07 21:20:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:20:04,084 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:04,084 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:04,285 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 21:20:04,285 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:04,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:04,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1205370039, now seen corresponding path program 1 times [2019-12-07 21:20:04,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:20:04,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557228318] [2019-12-07 21:20:04,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 21:20:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:04,377 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 21:20:04,378 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:04,431 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 21:20:04,431 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:04,444 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:04,448 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 21:20:04,449 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:04,459 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:04,459 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:20:04,459 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:12 [2019-12-07 21:20:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:04,477 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:04,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557228318] [2019-12-07 21:20:04,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:04,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 21:20:04,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596515751] [2019-12-07 21:20:04,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:20:04,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:20:04,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:20:04,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:20:04,517 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 6 states. [2019-12-07 21:20:04,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:04,828 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2019-12-07 21:20:04,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:20:04,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-12-07 21:20:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:04,830 INFO L225 Difference]: With dead ends: 104 [2019-12-07 21:20:04,830 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 21:20:04,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:20:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 21:20:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2019-12-07 21:20:04,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 21:20:04,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2019-12-07 21:20:04,838 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 11 [2019-12-07 21:20:04,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:04,838 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2019-12-07 21:20:04,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:20:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2019-12-07 21:20:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 21:20:04,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:04,839 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:05,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 21:20:05,041 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:05,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:05,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1319890869, now seen corresponding path program 1 times [2019-12-07 21:20:05,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:20:05,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397772075] [2019-12-07 21:20:05,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 21:20:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:05,139 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 21:20:05,141 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:05,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:05,175 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:05,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397772075] [2019-12-07 21:20:05,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:05,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 21:20:05,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609615740] [2019-12-07 21:20:05,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 21:20:05,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:20:05,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 21:20:05,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:20:05,204 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 9 states. [2019-12-07 21:20:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:05,635 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-12-07 21:20:05,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:20:05,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-12-07 21:20:05,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:05,637 INFO L225 Difference]: With dead ends: 62 [2019-12-07 21:20:05,637 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 21:20:05,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:20:05,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 21:20:05,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-12-07 21:20:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 21:20:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2019-12-07 21:20:05,642 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 13 [2019-12-07 21:20:05,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:05,642 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-12-07 21:20:05,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 21:20:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2019-12-07 21:20:05,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 21:20:05,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:05,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:05,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 21:20:05,844 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:05,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:05,845 INFO L82 PathProgramCache]: Analyzing trace with hash 744266300, now seen corresponding path program 1 times [2019-12-07 21:20:05,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:20:05,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689895230] [2019-12-07 21:20:05,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 21:20:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:05,937 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 21:20:05,938 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:05,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:20:05,946 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:20:05,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689895230] [2019-12-07 21:20:05,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:05,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 21:20:05,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785301203] [2019-12-07 21:20:05,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:20:05,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:20:05,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:20:05,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:20:05,949 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand 4 states. [2019-12-07 21:20:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:05,992 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2019-12-07 21:20:05,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:20:05,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 21:20:05,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:05,994 INFO L225 Difference]: With dead ends: 81 [2019-12-07 21:20:05,994 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 21:20:05,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:20:05,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 21:20:06,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 53. [2019-12-07 21:20:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 21:20:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-12-07 21:20:06,001 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 15 [2019-12-07 21:20:06,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:06,002 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-12-07 21:20:06,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:20:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2019-12-07 21:20:06,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 21:20:06,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:06,003 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:06,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 21:20:06,204 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:06,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:06,205 INFO L82 PathProgramCache]: Analyzing trace with hash 745875014, now seen corresponding path program 1 times [2019-12-07 21:20:06,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:20:06,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015922747] [2019-12-07 21:20:06,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 21:20:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:06,346 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 21:20:06,348 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:06,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-07 21:20:06,362 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 21:20:06,428 INFO L614 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-12-07 21:20:06,428 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:20:06,428 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:35 [2019-12-07 21:20:06,501 INFO L430 ElimStorePlain]: Different costs {8=[|v_#memory_$Pointer$.offset_33|], 18=[|v_#memory_$Pointer$.base_33|]} [2019-12-07 21:20:06,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:20:06,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:20:09,391 WARN L192 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-12-07 21:20:09,392 INFO L343 Elim1Store]: treesize reduction 88, result has 60.2 percent of original size [2019-12-07 21:20:09,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 150 [2019-12-07 21:20:09,393 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:10,153 WARN L192 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-12-07 21:20:10,154 INFO L614 ElimStorePlain]: treesize reduction 59, result has 80.2 percent of original size [2019-12-07 21:20:10,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:20:10,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:21:07,642 WARN L192 SmtUtils]: Spent 57.45 s on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-12-07 21:21:07,643 INFO L343 Elim1Store]: treesize reduction 176, result has 52.4 percent of original size [2019-12-07 21:21:07,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 174 treesize of output 240 [2019-12-07 21:21:07,645 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:21:26,305 WARN L192 SmtUtils]: Spent 18.66 s on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2019-12-07 21:21:26,306 INFO L614 ElimStorePlain]: treesize reduction 113, result has 60.8 percent of original size [2019-12-07 21:21:26,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,429 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 21:21:26,430 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:268, output treesize:253 [2019-12-07 21:21:26,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:26,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:26,683 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 21:30:00,818 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-12-07 21:30:00,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015922747] [2019-12-07 21:30:00,819 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2019-12-07 21:30:00,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1270868721] [2019-12-07 21:30:00,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:30:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:30:01,004 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 21:30:01,005 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:30:01,006 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken [2019-12-07 21:30:01,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243090762] [2019-12-07 21:30:01,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4c96dca-6a59-45a8-9f75-f59fb28ca483/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:30:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:30:01,069 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 21:30:01,071 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:30:01,072 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2b263420 [2019-12-07 21:30:01,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:30:01,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 21:30:01,072 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 21:30:01,072 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:30:01,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 mathsat -unsat_core_generation=3,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:30:01,693 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 21:30:01,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:30:01 BoogieIcfgContainer [2019-12-07 21:30:01,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:30:01,694 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:30:01,694 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:30:01,694 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:30:01,694 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:20:03" (3/4) ... [2019-12-07 21:30:01,696 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 21:30:01,697 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:30:01,698 INFO L168 Benchmark]: Toolchain (without parser) took 598858.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 947.0 MB in the beginning and 937.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 208.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:30:01,698 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:30:01,698 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -148.3 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-12-07 21:30:01,699 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:30:01,699 INFO L168 Benchmark]: Boogie Preprocessor took 32.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:30:01,700 INFO L168 Benchmark]: RCFGBuilder took 519.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:30:01,700 INFO L168 Benchmark]: TraceAbstraction took 597839.30 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.0 GB in the beginning and 937.2 MB in the end (delta: 105.0 MB). Peak memory consumption was 171.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:30:01,700 INFO L168 Benchmark]: Witness Printer took 2.70 ms. Allocated memory is still 1.2 GB. Free memory is still 937.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:30:01,703 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 422.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -148.3 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 519.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 597839.30 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.0 GB in the beginning and 937.2 MB in the end (delta: 105.0 MB). Peak memory consumption was 171.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.70 ms. Allocated memory is still 1.2 GB. Free memory is still 937.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 659]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L655] struct ldv_list_head mutexes = { &(mutexes), &(mutexes) }; [L673] struct ldv_list_head drvlist = { &(drvlist), &(drvlist) }; [L677] int i; [L678] int N = __VERIFIER_nondet_int(); [L679] i=0 [L679] COND TRUE inext [L586] next->prev = new [L587] new->next = next [L588] new->prev = prev [L589] prev->next = new [L679] i++ [L679] COND FALSE !(inext [L684] const typeof( ((typeof(*me) *)0)->list ) *__mptr = ((&drvlist)->next); [L684] me = ({ const typeof( ((typeof(*me) *)0)->list ) *__mptr = ((&drvlist)->next); (typeof(*me) *)( (char *)__mptr - ((size_t) &((typeof(*me) *)0)->list) );}) [L684] COND TRUE &me->list != (&drvlist) [L644] struct ldv_list_element *m; [L645] EXPR (s)->next [L645] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L645] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) [L645] COND TRUE &m->list != (s) [L646] EXPR m->e [L646] COND TRUE m->e == e [L647] return 1; [L659] COND TRUE ldv_is_in_set(m, &mutexes) [L659] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 3 error locations. Result: UNKNOWN, OverallTime: 597.7s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 242 SDtfs, 68 SDslu, 501 SDs, 0 SdLazy, 121 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 34 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 5514 SizeOfPredicates, 23 NumberOfNonLiveVariables, 259 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...