./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all.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_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/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 ef034042979fe1e524a3655a8992190a25335ff0 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/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 ef034042979fe1e524a3655a8992190a25335ff0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@49557b36 --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:43:46,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:43:46,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:43:46,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:43:46,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:43:46,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:43:46,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:43:46,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:43:46,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:43:46,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:43:46,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:43:46,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:43:46,697 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:43:46,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:43:46,699 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:43:46,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:43:46,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:43:46,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:43:46,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:43:46,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:43:46,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:43:46,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:43:46,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:43:46,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:43:46,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:43:46,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:43:46,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:43:46,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:43:46,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:43:46,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:43:46,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:43:46,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:43:46,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:43:46,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:43:46,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:43:46,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:43:46,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:43:46,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:43:46,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:43:46,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:43:46,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:43:46,714 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 10:43:46,723 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:43:46,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:43:46,724 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:43:46,724 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:43:46,724 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:43:46,724 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:43:46,724 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 10:43:46,724 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:43:46,725 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:43:46,725 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 10:43:46,725 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 10:43:46,725 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:43:46,725 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 10:43:46,725 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 10:43:46,725 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 10:43:46,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:43:46,726 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:43:46,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:43:46,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:43:46,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:43:46,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:43:46,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:43:46,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:43:46,726 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:43:46,727 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:43:46,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:43:46,727 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:43:46,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:43:46,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:43:46,727 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:43:46,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:43:46,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:43:46,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:43:46,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:43:46,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:43:46,728 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 10:43:46,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:43:46,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:43:46,729 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:43:46,729 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:43:46,729 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_c7e5d249-febd-4a78-b8e0-ab479e452e43/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 -> ef034042979fe1e524a3655a8992190a25335ff0 [2019-12-07 10:43:46,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:43:46,845 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:43:46,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:43:46,849 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:43:46,849 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:43:46,849 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2019-12-07 10:43:46,886 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/data/bbe85c28b/bc8d03a0ab0849908a4c2d94d78de83a/FLAG9cff4dcf5 [2019-12-07 10:43:47,358 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:43:47,359 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/sv-benchmarks/c/list-simple/sll2n_update_all.i [2019-12-07 10:43:47,368 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/data/bbe85c28b/bc8d03a0ab0849908a4c2d94d78de83a/FLAG9cff4dcf5 [2019-12-07 10:43:47,377 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/data/bbe85c28b/bc8d03a0ab0849908a4c2d94d78de83a [2019-12-07 10:43:47,379 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:43:47,380 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:43:47,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:43:47,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:43:47,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:43:47,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:43:47" (1/1) ... [2019-12-07 10:43:47,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7559db5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:43:47, skipping insertion in model container [2019-12-07 10:43:47,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:43:47" (1/1) ... [2019-12-07 10:43:47,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:43:47,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:43:47,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:43:47,645 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:43:47,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:43:47,705 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:43:47,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:43:47 WrapperNode [2019-12-07 10:43:47,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:43:47,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:43:47,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:43:47,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:43:47,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:43:47" (1/1) ... [2019-12-07 10:43:47,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:43:47" (1/1) ... [2019-12-07 10:43:47,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:43:47,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:43:47,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:43:47,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:43:47,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:43:47" (1/1) ... [2019-12-07 10:43:47,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:43:47" (1/1) ... [2019-12-07 10:43:47,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:43:47" (1/1) ... [2019-12-07 10:43:47,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:43:47" (1/1) ... [2019-12-07 10:43:47,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:43:47" (1/1) ... [2019-12-07 10:43:47,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:43:47" (1/1) ... [2019-12-07 10:43:47,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:43:47" (1/1) ... [2019-12-07 10:43:47,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:43:47,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:43:47,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:43:47,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:43:47,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:43:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/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 10:43:47,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:43:47,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:43:47,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 10:43:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 10:43:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 10:43:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:43:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:43:47,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:43:48,068 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:43:48,068 INFO L287 CfgBuilder]: Removed 22 assume(true) statements. [2019-12-07 10:43:48,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:43:48 BoogieIcfgContainer [2019-12-07 10:43:48,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:43:48,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:43:48,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:43:48,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:43:48,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:43:47" (1/3) ... [2019-12-07 10:43:48,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501d9673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:43:48, skipping insertion in model container [2019-12-07 10:43:48,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:43:47" (2/3) ... [2019-12-07 10:43:48,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501d9673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:43:48, skipping insertion in model container [2019-12-07 10:43:48,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:43:48" (3/3) ... [2019-12-07 10:43:48,074 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2019-12-07 10:43:48,080 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:43:48,085 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:43:48,092 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:43:48,107 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:43:48,107 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:43:48,107 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:43:48,107 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:43:48,107 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:43:48,107 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:43:48,107 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:43:48,107 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:43:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-12-07 10:43:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 10:43:48,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:48,120 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:48,121 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:48,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:48,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1872792383, now seen corresponding path program 1 times [2019-12-07 10:43:48,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:48,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275938123] [2019-12-07 10:43:48,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:48,231 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 10:43:48,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275938123] [2019-12-07 10:43:48,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:48,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:43:48,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562573687] [2019-12-07 10:43:48,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:43:48,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:43:48,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:43:48,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:43:48,246 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-12-07 10:43:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:48,272 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2019-12-07 10:43:48,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:43:48,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 10:43:48,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:48,280 INFO L225 Difference]: With dead ends: 27 [2019-12-07 10:43:48,280 INFO L226 Difference]: Without dead ends: 12 [2019-12-07 10:43:48,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:43:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-12-07 10:43:48,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-12-07 10:43:48,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-12-07 10:43:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-12-07 10:43:48,306 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2019-12-07 10:43:48,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:48,306 INFO L462 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-12-07 10:43:48,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:43:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-12-07 10:43:48,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 10:43:48,306 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:48,306 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:48,307 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:48,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:48,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1527824236, now seen corresponding path program 1 times [2019-12-07 10:43:48,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:48,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120472192] [2019-12-07 10:43:48,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:43:48,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120472192] [2019-12-07 10:43:48,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039872367] [2019-12-07 10:43:48,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:43:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:48,403 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:43:48,407 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:43:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:43:48,417 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:43:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:43:48,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1701672945] [2019-12-07 10:43:48,441 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2019-12-07 10:43:48,441 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:43:48,444 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:43:48,448 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:43:48,449 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:43:48,620 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:48,857 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:49,286 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:49,490 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:49,655 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:50,097 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:50,316 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:43:50,656 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 82 [2019-12-07 10:43:50,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:43:50,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 3, 3] total 6 [2019-12-07 10:43:50,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527535407] [2019-12-07 10:43:50,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:43:50,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:43:50,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:43:50,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:43:50,732 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 5 states. [2019-12-07 10:43:50,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:50,792 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2019-12-07 10:43:50,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:43:50,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 10:43:50,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:50,792 INFO L225 Difference]: With dead ends: 18 [2019-12-07 10:43:50,793 INFO L226 Difference]: Without dead ends: 13 [2019-12-07 10:43:50,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:43:50,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-12-07 10:43:50,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-12-07 10:43:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-12-07 10:43:50,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-12-07 10:43:50,796 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2019-12-07 10:43:50,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:50,797 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-12-07 10:43:50,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:43:50,797 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-12-07 10:43:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:43:50,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:50,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:50,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:43:50,998 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:50,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:50,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1199038323, now seen corresponding path program 1 times [2019-12-07 10:43:50,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:50,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30907007] [2019-12-07 10:43:51,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:51,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:43:51,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30907007] [2019-12-07 10:43:51,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190228904] [2019-12-07 10:43:51,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:43:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:51,106 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:43:51,107 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:43:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:43:51,109 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:43:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:43:51,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1142059123] [2019-12-07 10:43:51,116 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 10:43:51,116 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:43:51,117 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:43:51,117 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:43:51,117 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:43:51,182 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:51,342 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:51,578 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:51,830 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:51,905 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:52,350 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:52,612 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:52,675 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:52,800 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:43:53,111 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-12-07 10:43:53,428 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-12-07 10:43:53,778 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-12-07 10:43:53,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:43:53,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3, 3, 3] total 7 [2019-12-07 10:43:53,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054120928] [2019-12-07 10:43:53,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:43:53,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:43:53,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:43:53,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:43:53,781 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 6 states. [2019-12-07 10:43:53,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:53,899 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-12-07 10:43:53,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:43:53,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-12-07 10:43:53,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:53,900 INFO L225 Difference]: With dead ends: 19 [2019-12-07 10:43:53,900 INFO L226 Difference]: Without dead ends: 14 [2019-12-07 10:43:53,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:43:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-12-07 10:43:53,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-12-07 10:43:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 10:43:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-12-07 10:43:53,904 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 11 [2019-12-07 10:43:53,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:53,904 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-12-07 10:43:53,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:43:53,905 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2019-12-07 10:43:53,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 10:43:53,905 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:53,905 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:54,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:43:54,106 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:54,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:54,107 INFO L82 PathProgramCache]: Analyzing trace with hash 639543746, now seen corresponding path program 1 times [2019-12-07 10:43:54,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:54,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147524596] [2019-12-07 10:43:54,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:43:54,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147524596] [2019-12-07 10:43:54,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:54,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:43:54,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112883747] [2019-12-07 10:43:54,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:43:54,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:43:54,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:43:54,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:43:54,153 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand 4 states. [2019-12-07 10:43:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:54,174 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2019-12-07 10:43:54,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:43:54,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 10:43:54,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:54,174 INFO L225 Difference]: With dead ends: 28 [2019-12-07 10:43:54,174 INFO L226 Difference]: Without dead ends: 21 [2019-12-07 10:43:54,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:43:54,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-12-07 10:43:54,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2019-12-07 10:43:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 10:43:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-12-07 10:43:54,180 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 12 [2019-12-07 10:43:54,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:54,180 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-12-07 10:43:54,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:43:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2019-12-07 10:43:54,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:43:54,181 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:54,181 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:54,181 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:54,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:54,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1696155557, now seen corresponding path program 2 times [2019-12-07 10:43:54,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:54,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738815659] [2019-12-07 10:43:54,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:54,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:43:54,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738815659] [2019-12-07 10:43:54,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104532753] [2019-12-07 10:43:54,208 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:43:54,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 10:43:54,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:43:54,246 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:43:54,247 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:43:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:43:54,248 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:43:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:43:54,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [95967605] [2019-12-07 10:43:54,254 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 10:43:54,254 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:43:54,254 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:43:54,254 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:43:54,255 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:43:54,293 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:54,480 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:54,653 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:54,891 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:54,946 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:55,396 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:55,805 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:43:55,930 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-12-07 10:43:56,263 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 82 [2019-12-07 10:43:56,739 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-12-07 10:43:56,740 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:43:56,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:43:56,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2019-12-07 10:43:56,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095335997] [2019-12-07 10:43:56,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:43:56,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:43:56,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:43:56,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:43:56,742 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 4 states. [2019-12-07 10:43:56,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:56,760 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2019-12-07 10:43:56,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:43:56,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 10:43:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:56,761 INFO L225 Difference]: With dead ends: 28 [2019-12-07 10:43:56,761 INFO L226 Difference]: Without dead ends: 17 [2019-12-07 10:43:56,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:43:56,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-12-07 10:43:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 10:43:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 10:43:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-12-07 10:43:56,765 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 14 [2019-12-07 10:43:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:56,765 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-12-07 10:43:56,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:43:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2019-12-07 10:43:56,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:43:56,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:56,766 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:56,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:43:56,967 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:56,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:56,967 INFO L82 PathProgramCache]: Analyzing trace with hash -248977522, now seen corresponding path program 3 times [2019-12-07 10:43:56,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:56,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258802346] [2019-12-07 10:43:56,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:57,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:43:57,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258802346] [2019-12-07 10:43:57,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880902659] [2019-12-07 10:43:57,233 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:43:57,302 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 10:43:57,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:43:57,304 INFO L264 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 78 conjunts are in the unsatisfiable core [2019-12-07 10:43:57,305 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:43:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:43:57,647 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:43:58,124 WARN L192 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 10:43:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:43:58,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1690653683] [2019-12-07 10:43:58,361 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 10:43:58,361 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:43:58,362 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:43:58,362 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:43:58,362 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:43:58,422 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:58,614 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:58,921 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:59,132 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:59,179 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:59,581 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:43:59,982 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:44:00,240 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-12-07 10:44:00,673 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-12-07 10:44:01,066 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-12-07 10:44:01,403 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-12-07 10:44:01,886 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-12-07 10:44:02,445 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-12-07 10:44:03,070 WARN L192 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-12-07 10:44:03,071 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:44:03,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:44:03,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2019-12-07 10:44:03,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593934605] [2019-12-07 10:44:03,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-07 10:44:03,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:44:03,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-07 10:44:03,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1963, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 10:44:03,076 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 39 states. [2019-12-07 10:44:04,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:44:04,788 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2019-12-07 10:44:04,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 10:44:04,789 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 16 [2019-12-07 10:44:04,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:44:04,791 INFO L225 Difference]: With dead ends: 44 [2019-12-07 10:44:04,791 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 10:44:04,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1021 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=582, Invalid=3578, Unknown=0, NotChecked=0, Total=4160 [2019-12-07 10:44:04,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 10:44:04,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 25. [2019-12-07 10:44:04,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 10:44:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2019-12-07 10:44:04,800 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 16 [2019-12-07 10:44:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:44:04,801 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2019-12-07 10:44:04,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-07 10:44:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2019-12-07 10:44:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 10:44:04,801 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:44:04,801 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:44:05,002 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:05,002 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:44:05,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:44:05,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1299274489, now seen corresponding path program 4 times [2019-12-07 10:44:05,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:44:05,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429586238] [2019-12-07 10:44:05,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:44:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:05,060 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 10:44:05,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429586238] [2019-12-07 10:44:05,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29133319] [2019-12-07 10:44:05,060 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:05,110 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:44:05,111 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:44:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:44:05,121 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:44:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:44:05,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [551513477] [2019-12-07 10:44:05,133 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 10:44:05,133 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:44:05,134 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:44:05,134 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:44:05,134 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:44:05,192 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:44:05,312 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:44:05,565 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:44:05,763 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:44:05,880 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:44:06,153 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:44:06,576 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:44:06,768 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-12-07 10:44:07,093 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-12-07 10:44:07,324 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-12-07 10:44:07,574 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-12-07 10:44:07,752 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-12-07 10:44:08,019 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-12-07 10:44:08,020 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:44:08,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:44:08,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 7 [2019-12-07 10:44:08,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897471259] [2019-12-07 10:44:08,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:44:08,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:44:08,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:44:08,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:44:08,021 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 7 states. [2019-12-07 10:44:08,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:44:08,105 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2019-12-07 10:44:08,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:44:08,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 10:44:08,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:44:08,107 INFO L225 Difference]: With dead ends: 39 [2019-12-07 10:44:08,107 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 10:44:08,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2019-12-07 10:44:08,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 10:44:08,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2019-12-07 10:44:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 10:44:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-12-07 10:44:08,117 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 17 [2019-12-07 10:44:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:44:08,117 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-12-07 10:44:08,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:44:08,117 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2019-12-07 10:44:08,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 10:44:08,118 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:44:08,118 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:44:08,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:08,319 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:44:08,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:44:08,319 INFO L82 PathProgramCache]: Analyzing trace with hash 870065333, now seen corresponding path program 1 times [2019-12-07 10:44:08,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:44:08,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557094993] [2019-12-07 10:44:08,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:44:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 10:44:08,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557094993] [2019-12-07 10:44:08,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:44:08,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:44:08,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107351744] [2019-12-07 10:44:08,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:44:08,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:44:08,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:44:08,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:44:08,364 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand 4 states. [2019-12-07 10:44:08,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:44:08,387 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-12-07 10:44:08,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:44:08,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 10:44:08,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:44:08,388 INFO L225 Difference]: With dead ends: 37 [2019-12-07 10:44:08,388 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 10:44:08,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:44:08,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 10:44:08,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-12-07 10:44:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 10:44:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-12-07 10:44:08,395 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2019-12-07 10:44:08,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:44:08,395 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-12-07 10:44:08,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:44:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-12-07 10:44:08,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:44:08,395 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:44:08,395 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:44:08,396 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:44:08,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:44:08,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1205434603, now seen corresponding path program 5 times [2019-12-07 10:44:08,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:44:08,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035620203] [2019-12-07 10:44:08,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:44:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 10:44:08,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035620203] [2019-12-07 10:44:08,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108273358] [2019-12-07 10:44:08,447 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:08,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 10:44:08,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:44:08,496 INFO L264 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:44:08,497 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:44:08,518 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 10:44:08,518 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:44:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 10:44:08,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:44:08,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 4] total 11 [2019-12-07 10:44:08,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629557529] [2019-12-07 10:44:08,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:44:08,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:44:08,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:44:08,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:44:08,537 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 5 states. [2019-12-07 10:44:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:44:08,565 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-12-07 10:44:08,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:44:08,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-07 10:44:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:44:08,566 INFO L225 Difference]: With dead ends: 42 [2019-12-07 10:44:08,566 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 10:44:08,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:44:08,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 10:44:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2019-12-07 10:44:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 10:44:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-12-07 10:44:08,572 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 18 [2019-12-07 10:44:08,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:44:08,572 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-12-07 10:44:08,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:44:08,572 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-12-07 10:44:08,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:44:08,573 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:44:08,573 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:44:08,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:08,774 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:44:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:44:08,774 INFO L82 PathProgramCache]: Analyzing trace with hash -866602201, now seen corresponding path program 6 times [2019-12-07 10:44:08,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:44:08,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157047047] [2019-12-07 10:44:08,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:44:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:08,801 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:44:08,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157047047] [2019-12-07 10:44:08,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549465339] [2019-12-07 10:44:08,801 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/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 10:44:08,848 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 10:44:08,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:44:08,849 INFO L264 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:44:08,850 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:44:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:44:08,855 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:44:08,863 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:44:08,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1725961886] [2019-12-07 10:44:08,865 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 10:44:08,865 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:44:08,865 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:44:08,865 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:44:08,865 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:44:08,894 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:44:09,044 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:44:09,278 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:44:09,491 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:44:09,550 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:44:09,727 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:44:10,177 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:44:10,367 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-12-07 10:44:10,691 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 82 [2019-12-07 10:44:10,911 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-12-07 10:44:11,165 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-12-07 10:44:11,369 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-12-07 10:44:11,600 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-12-07 10:44:11,601 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:44:11,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:44:11,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2019-12-07 10:44:11,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751165502] [2019-12-07 10:44:11,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:44:11,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:44:11,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:44:11,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:44:11,602 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 6 states. [2019-12-07 10:44:11,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:44:11,632 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2019-12-07 10:44:11,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:44:11,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-12-07 10:44:11,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:44:11,633 INFO L225 Difference]: With dead ends: 31 [2019-12-07 10:44:11,633 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 10:44:11,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:44:11,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 10:44:11,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 10:44:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 10:44:11,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-12-07 10:44:11,638 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2019-12-07 10:44:11,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:44:11,638 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-12-07 10:44:11,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:44:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-12-07 10:44:11,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:44:11,639 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:44:11,639 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:44:11,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:11,839 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:44:11,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:44:11,840 INFO L82 PathProgramCache]: Analyzing trace with hash 150388788, now seen corresponding path program 1 times [2019-12-07 10:44:11,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:44:11,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625393082] [2019-12-07 10:44:11,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:44:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 10:44:11,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625393082] [2019-12-07 10:44:11,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316530854] [2019-12-07 10:44:11,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:11,909 INFO L264 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:44:11,910 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:44:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 10:44:11,914 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:44:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 10:44:11,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1603992295] [2019-12-07 10:44:11,924 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 10:44:11,924 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:44:11,924 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:44:11,924 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:44:11,925 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:44:11,957 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:44:12,086 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:44:12,530 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:44:12,731 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:44:12,776 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:44:12,978 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:44:13,472 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:44:13,601 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-12-07 10:44:13,934 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 82 [2019-12-07 10:44:14,384 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 65 [2019-12-07 10:44:14,729 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-12-07 10:44:14,884 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-12-07 10:44:14,885 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:44:14,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:44:14,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2019-12-07 10:44:14,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816602152] [2019-12-07 10:44:14,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:44:14,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:44:14,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:44:14,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:44:14,886 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 6 states. [2019-12-07 10:44:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:44:14,922 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-12-07 10:44:14,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:44:14,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-07 10:44:14,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:44:14,923 INFO L225 Difference]: With dead ends: 26 [2019-12-07 10:44:14,923 INFO L226 Difference]: Without dead ends: 21 [2019-12-07 10:44:14,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:44:14,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-12-07 10:44:14,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-12-07 10:44:14,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 10:44:14,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-12-07 10:44:14,929 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 19 [2019-12-07 10:44:14,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:44:14,929 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-12-07 10:44:14,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:44:14,929 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-12-07 10:44:14,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:44:14,930 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:44:14,930 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:44:15,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:15,131 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:44:15,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:44:15,132 INFO L82 PathProgramCache]: Analyzing trace with hash 365519055, now seen corresponding path program 1 times [2019-12-07 10:44:15,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:44:15,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961696395] [2019-12-07 10:44:15,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:44:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:15,554 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:44:15,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961696395] [2019-12-07 10:44:15,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133556608] [2019-12-07 10:44:15,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:15,602 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 87 conjunts are in the unsatisfiable core [2019-12-07 10:44:15,603 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:44:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:44:16,694 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:44:17,446 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2019-12-07 10:44:17,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [514575457] [2019-12-07 10:44:17,447 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 10:44:17,448 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:44:17,448 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:44:17,448 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:44:17,448 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:44:17,451 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@5f10c750 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:555) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:428) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 10:44:17,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:44:17,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-12-07 10:44:17,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158092161] [2019-12-07 10:44:17,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 10:44:17,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:44:17,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 10:44:17,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1919, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 10:44:17,454 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 20 states. [2019-12-07 10:44:17,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 10:44:17,655 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:17,655 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@5f10c750 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 10:44:17,660 INFO L168 Benchmark]: Toolchain (without parser) took 30280.56 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 461.9 MB). Free memory was 937.3 MB in the beginning and 794.4 MB in the end (delta: 142.9 MB). Peak memory consumption was 604.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:44:17,661 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:44:17,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 937.3 MB in the beginning and 1.1 GB in the end (delta: -132.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:44:17,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:44:17,661 INFO L168 Benchmark]: Boogie Preprocessor took 20.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:44:17,662 INFO L168 Benchmark]: RCFGBuilder took 310.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:44:17,662 INFO L168 Benchmark]: TraceAbstraction took 29589.36 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 370.7 MB). Free memory was 1.0 GB in the beginning and 794.4 MB in the end (delta: 230.5 MB). Peak memory consumption was 601.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:44:17,663 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 937.3 MB in the beginning and 1.1 GB in the end (delta: -132.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 310.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29589.36 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 370.7 MB). Free memory was 1.0 GB in the beginning and 794.4 MB in the end (delta: 230.5 MB). Peak memory consumption was 601.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@5f10c750 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@5f10c750: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 10:44:19,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:44:19,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:44:19,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:44:19,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:44:19,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:44:19,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:44:19,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:44:19,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:44:19,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:44:19,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:44:19,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:44:19,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:44:19,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:44:19,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:44:19,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:44:19,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:44:19,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:44:19,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:44:19,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:44:19,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:44:19,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:44:19,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:44:19,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:44:19,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:44:19,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:44:19,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:44:19,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:44:19,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:44:19,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:44:19,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:44:19,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:44:19,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:44:19,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:44:19,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:44:19,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:44:19,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:44:19,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:44:19,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:44:19,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:44:19,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:44:19,040 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-12-07 10:44:19,050 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:44:19,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:44:19,051 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:44:19,051 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:44:19,051 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:44:19,052 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:44:19,052 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:44:19,052 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:44:19,052 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:44:19,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:44:19,053 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:44:19,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:44:19,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:44:19,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:44:19,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:44:19,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:44:19,053 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:44:19,053 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 10:44:19,054 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 10:44:19,054 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:44:19,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:44:19,054 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:44:19,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:44:19,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:44:19,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:44:19,055 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:44:19,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:44:19,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:44:19,055 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:44:19,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:44:19,056 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:44:19,056 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 10:44:19,056 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 10:44:19,056 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:44:19,056 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:44:19,056 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:44:19,056 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_c7e5d249-febd-4a78-b8e0-ab479e452e43/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 -> ef034042979fe1e524a3655a8992190a25335ff0 [2019-12-07 10:44:19,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:44:19,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:44:19,231 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:44:19,232 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:44:19,232 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:44:19,233 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2019-12-07 10:44:19,273 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/data/2769500ee/4296310101d544d7a4f113f26a98d0b3/FLAGf9f10af69 [2019-12-07 10:44:19,762 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:44:19,762 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/sv-benchmarks/c/list-simple/sll2n_update_all.i [2019-12-07 10:44:19,775 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/data/2769500ee/4296310101d544d7a4f113f26a98d0b3/FLAGf9f10af69 [2019-12-07 10:44:19,787 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/data/2769500ee/4296310101d544d7a4f113f26a98d0b3 [2019-12-07 10:44:19,789 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:44:19,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:44:19,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:44:19,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:44:19,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:44:19,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:44:19" (1/1) ... [2019-12-07 10:44:19,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5031311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:44:19, skipping insertion in model container [2019-12-07 10:44:19,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:44:19" (1/1) ... [2019-12-07 10:44:19,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:44:19,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:44:20,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:44:20,068 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:44:20,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:44:20,133 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:44:20,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:44:20 WrapperNode [2019-12-07 10:44:20,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:44:20,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:44:20,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:44:20,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:44:20,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:44:20" (1/1) ... [2019-12-07 10:44:20,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:44:20" (1/1) ... [2019-12-07 10:44:20,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:44:20,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:44:20,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:44:20,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:44:20,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:44:20" (1/1) ... [2019-12-07 10:44:20,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:44:20" (1/1) ... [2019-12-07 10:44:20,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:44:20" (1/1) ... [2019-12-07 10:44:20,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:44:20" (1/1) ... [2019-12-07 10:44:20,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:44:20" (1/1) ... [2019-12-07 10:44:20,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:44:20" (1/1) ... [2019-12-07 10:44:20,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:44:20" (1/1) ... [2019-12-07 10:44:20,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:44:20,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:44:20,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:44:20,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:44:20,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:44:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/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 10:44:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 10:44:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 10:44:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 10:44:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 10:44:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:44:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 10:44:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:44:20,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:44:20,456 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:44:20,456 INFO L287 CfgBuilder]: Removed 22 assume(true) statements. [2019-12-07 10:44:20,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:44:20 BoogieIcfgContainer [2019-12-07 10:44:20,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:44:20,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:44:20,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:44:20,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:44:20,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:44:19" (1/3) ... [2019-12-07 10:44:20,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d230b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:44:20, skipping insertion in model container [2019-12-07 10:44:20,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:44:20" (2/3) ... [2019-12-07 10:44:20,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d230b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:44:20, skipping insertion in model container [2019-12-07 10:44:20,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:44:20" (3/3) ... [2019-12-07 10:44:20,461 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2019-12-07 10:44:20,467 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:44:20,472 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:44:20,479 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:44:20,492 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:44:20,493 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:44:20,493 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:44:20,493 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:44:20,493 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:44:20,493 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:44:20,493 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:44:20,493 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:44:20,502 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-12-07 10:44:20,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:44:20,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:44:20,506 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:44:20,506 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:44:20,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:44:20,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1121238131, now seen corresponding path program 1 times [2019-12-07 10:44:20,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:44:20,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512619278] [2019-12-07 10:44:20,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/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 10:44:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:20,578 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 10:44:20,582 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:44:20,591 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 10:44:20,592 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:44:20,594 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 10:44:20,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512619278] [2019-12-07 10:44:20,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:44:20,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 10:44:20,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391867088] [2019-12-07 10:44:20,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 10:44:20,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:44:20,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 10:44:20,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 10:44:20,610 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-12-07 10:44:20,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:44:20,622 INFO L93 Difference]: Finished difference Result 50 states and 73 transitions. [2019-12-07 10:44:20,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 10:44:20,623 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-12-07 10:44:20,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:44:20,629 INFO L225 Difference]: With dead ends: 50 [2019-12-07 10:44:20,629 INFO L226 Difference]: Without dead ends: 22 [2019-12-07 10:44:20,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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 10:44:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-12-07 10:44:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-12-07 10:44:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 10:44:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-12-07 10:44:20,653 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2019-12-07 10:44:20,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:44:20,653 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-12-07 10:44:20,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 10:44:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-12-07 10:44:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:44:20,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:44:20,654 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:44:20,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 10:44:20,856 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:44:20,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:44:20,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1860179837, now seen corresponding path program 1 times [2019-12-07 10:44:20,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:44:20,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503231982] [2019-12-07 10:44:20,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/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 10:44:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:20,961 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:44:20,963 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:44:20,991 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 10:44:20,991 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:44:21,015 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 10:44:21,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503231982] [2019-12-07 10:44:21,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:44:21,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:44:21,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046724678] [2019-12-07 10:44:21,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:44:21,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:44:21,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:44:21,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:44:21,022 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 4 states. [2019-12-07 10:44:21,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:44:21,071 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-12-07 10:44:21,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:44:21,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:44:21,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:44:21,074 INFO L225 Difference]: With dead ends: 43 [2019-12-07 10:44:21,074 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 10:44:21,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:44:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 10:44:21,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-07 10:44:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 10:44:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-12-07 10:44:21,084 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 13 [2019-12-07 10:44:21,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:44:21,085 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-12-07 10:44:21,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:44:21,086 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-12-07 10:44:21,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 10:44:21,087 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:44:21,087 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:44:21,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 10:44:21,289 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:44:21,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:44:21,290 INFO L82 PathProgramCache]: Analyzing trace with hash -650193283, now seen corresponding path program 1 times [2019-12-07 10:44:21,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:44:21,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425440285] [2019-12-07 10:44:21,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/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 10:44:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:21,408 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:44:21,409 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:44:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:44:21,426 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:44:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:44:21,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425440285] [2019-12-07 10:44:21,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:44:21,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 10:44:21,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589099339] [2019-12-07 10:44:21,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:44:21,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:44:21,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:44:21,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:44:21,443 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2019-12-07 10:44:21,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:44:21,499 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-12-07 10:44:21,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:44:21,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-12-07 10:44:21,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:44:21,501 INFO L225 Difference]: With dead ends: 51 [2019-12-07 10:44:21,501 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 10:44:21,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:44:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 10:44:21,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2019-12-07 10:44:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 10:44:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-12-07 10:44:21,509 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 23 [2019-12-07 10:44:21,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:44:21,510 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-12-07 10:44:21,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:44:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-12-07 10:44:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:44:21,511 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:44:21,511 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:44:21,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 10:44:21,712 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:44:21,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:44:21,713 INFO L82 PathProgramCache]: Analyzing trace with hash 218280017, now seen corresponding path program 1 times [2019-12-07 10:44:21,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:44:21,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777438707] [2019-12-07 10:44:21,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/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 10:44:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:21,803 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:44:21,805 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:44:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:44:21,825 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:44:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:44:21,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777438707] [2019-12-07 10:44:21,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2047900322] [2019-12-07 10:44:21,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:44:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:22,003 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:44:22,004 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:44:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:44:22,009 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:44:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:44:22,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692033338] [2019-12-07 10:44:22,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:22,082 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:44:22,083 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:44:22,087 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:44:22,087 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:44:22,091 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:44:22,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:44:22,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2019-12-07 10:44:22,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034232407] [2019-12-07 10:44:22,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:44:22,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:44:22,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:44:22,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:44:22,093 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 8 states. [2019-12-07 10:44:22,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:44:22,237 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2019-12-07 10:44:22,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:44:22,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-12-07 10:44:22,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:44:22,239 INFO L225 Difference]: With dead ends: 70 [2019-12-07 10:44:22,239 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 10:44:22,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:44:22,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 10:44:22,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2019-12-07 10:44:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 10:44:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-12-07 10:44:22,246 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 31 [2019-12-07 10:44:22,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:44:22,246 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-12-07 10:44:22,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:44:22,247 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-12-07 10:44:22,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 10:44:22,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:44:22,248 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:44:22,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3,6 cvc4 --incremental --print-success --lang smt --rewrite-divk,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:22,851 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:44:22,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:44:22,852 INFO L82 PathProgramCache]: Analyzing trace with hash 343591370, now seen corresponding path program 1 times [2019-12-07 10:44:22,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:44:22,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042797150] [2019-12-07 10:44:22,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 10:44:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:22,981 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 48 conjunts are in the unsatisfiable core [2019-12-07 10:44:22,984 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:44:23,014 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 10:44:23,014 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:23,019 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:23,019 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:23,020 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 10:44:23,052 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:23,052 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:44:23,053 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:23,058 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:23,059 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:23,059 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-12-07 10:44:23,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:44:23,093 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:23,101 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:23,102 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:23,102 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-12-07 10:44:23,214 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_20|], 2=[|v_#memory_$Pointer$.base_22|]} [2019-12-07 10:44:23,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:44:23,221 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:23,239 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:23,243 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-12-07 10:44:23,244 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:23,252 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:23,252 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:23,252 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:24 [2019-12-07 10:44:23,337 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:44:23,338 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2019-12-07 10:44:23,339 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:23,347 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:23,347 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:23,348 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:20 [2019-12-07 10:44:23,390 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 10:44:23,391 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:23,402 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:23,403 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:23,403 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:16 [2019-12-07 10:44:23,497 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 24 treesize of output 12 [2019-12-07 10:44:23,498 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:23,502 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:23,502 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:23,502 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:7 [2019-12-07 10:44:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:44:23,562 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:44:23,995 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 94 treesize of output 90 [2019-12-07 10:44:23,996 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:34,239 WARN L192 SmtUtils]: Spent 10.24 s on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-12-07 10:44:34,240 INFO L614 ElimStorePlain]: treesize reduction 9, result has 89.4 percent of original size [2019-12-07 10:44:34,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:34,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:34,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:34,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:34,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:34,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:34,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:34,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:34,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:34,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:34,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:34,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:34,255 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:44:36,327 WARN L192 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 10:44:36,327 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:36,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:36,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:36,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:36,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:36,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:36,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:36,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:36,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:36,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:36,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:36,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:36,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:36,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:36,336 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2019-12-07 10:44:36,337 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:91 [2019-12-07 10:44:40,575 WARN L192 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2019-12-07 10:44:40,711 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 18 treesize of output 16 [2019-12-07 10:44:40,712 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 10:44:40,718 INFO L614 ElimStorePlain]: treesize reduction 18, result has 18.2 percent of original size [2019-12-07 10:44:40,719 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:40,720 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:40,720 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:40,720 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:4 [2019-12-07 10:44:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:44:40,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042797150] [2019-12-07 10:44:40,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [516851102] [2019-12-07 10:44:40,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:44:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:41,042 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 10:44:41,044 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:44:41,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 10:44:41,048 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:41,052 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:41,052 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:41,052 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 10:44:41,061 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:41,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:44:41,062 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:41,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:41,067 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:41,067 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-12-07 10:44:41,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:44:41,075 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:41,084 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:41,084 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:41,084 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-12-07 10:44:41,088 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_28|], 2=[|v_#memory_$Pointer$.base_30|]} [2019-12-07 10:44:41,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:44:41,093 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:41,108 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:41,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-12-07 10:44:41,112 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:41,119 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:41,119 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:41,120 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:24 [2019-12-07 10:44:41,124 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:44:41,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2019-12-07 10:44:41,125 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:41,132 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:41,132 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:41,132 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:20 [2019-12-07 10:44:41,137 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 10:44:41,138 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:41,148 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:41,149 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:41,149 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:16 [2019-12-07 10:44:41,153 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 24 treesize of output 12 [2019-12-07 10:44:41,153 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:41,156 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:41,156 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:41,157 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:7 [2019-12-07 10:44:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:44:41,160 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:44:41,267 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 94 treesize of output 90 [2019-12-07 10:44:41,268 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:51,671 WARN L192 SmtUtils]: Spent 10.40 s on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-12-07 10:44:51,672 INFO L614 ElimStorePlain]: treesize reduction 9, result has 89.4 percent of original size [2019-12-07 10:44:51,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:51,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:51,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:51,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:51,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:51,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:51,676 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:44:53,739 WARN L192 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 10:44:53,740 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:53,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:53,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:53,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:53,742 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2019-12-07 10:44:53,742 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:28 [2019-12-07 10:44:53,792 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 18 treesize of output 16 [2019-12-07 10:44:53,793 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 10:44:53,800 INFO L614 ElimStorePlain]: treesize reduction 18, result has 18.2 percent of original size [2019-12-07 10:44:53,800 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:53,802 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:53,802 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:53,802 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:4 [2019-12-07 10:44:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:44:53,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889144101] [2019-12-07 10:44:53,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:53,862 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 10:44:53,864 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:44:53,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 10:44:53,868 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:53,871 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:53,872 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:53,872 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 10:44:53,879 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:53,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:44:53,880 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:53,885 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:53,886 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:53,886 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-12-07 10:44:53,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:44:53,891 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:53,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:53,900 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:53,900 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-12-07 10:44:53,903 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_36|], 2=[|v_#memory_$Pointer$.base_38|]} [2019-12-07 10:44:53,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:44:53,908 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:53,922 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:53,925 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-12-07 10:44:53,925 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:53,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:53,933 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:53,933 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:24 [2019-12-07 10:44:53,937 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:44:53,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2019-12-07 10:44:53,938 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:53,945 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:53,946 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:53,946 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:20 [2019-12-07 10:44:53,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 10:44:53,950 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:53,960 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:53,961 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:53,961 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:16 [2019-12-07 10:44:53,965 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 24 treesize of output 12 [2019-12-07 10:44:53,965 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:53,968 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:53,968 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:53,969 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:7 [2019-12-07 10:44:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:44:53,972 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:44:54,069 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 94 treesize of output 90 [2019-12-07 10:44:54,069 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:04,331 WARN L192 SmtUtils]: Spent 10.26 s on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-12-07 10:45:04,332 INFO L614 ElimStorePlain]: treesize reduction 9, result has 89.4 percent of original size [2019-12-07 10:45:04,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,336 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:06,405 WARN L192 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 10:45:06,406 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:06,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:06,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:06,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:06,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:06,408 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2019-12-07 10:45:06,408 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:49 [2019-12-07 10:45:06,494 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 18 treesize of output 16 [2019-12-07 10:45:06,496 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 10:45:06,502 INFO L614 ElimStorePlain]: treesize reduction 18, result has 18.2 percent of original size [2019-12-07 10:45:06,502 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:06,503 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:06,503 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:06,503 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:4 [2019-12-07 10:45:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:45:06,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:45:06,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20, 19, 20, 19] total 37 [2019-12-07 10:45:06,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919626107] [2019-12-07 10:45:06,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-07 10:45:06,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:45:06,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-07 10:45:06,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1217, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 10:45:06,509 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 37 states. [2019-12-07 10:45:09,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:09,374 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2019-12-07 10:45:09,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 10:45:09,375 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 32 [2019-12-07 10:45:09,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:09,375 INFO L225 Difference]: With dead ends: 78 [2019-12-07 10:45:09,375 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 10:45:09,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 147 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=585, Invalid=2955, Unknown=0, NotChecked=0, Total=3540 [2019-12-07 10:45:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 10:45:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 49. [2019-12-07 10:45:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 10:45:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2019-12-07 10:45:09,385 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 32 [2019-12-07 10:45:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:09,385 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2019-12-07 10:45:09,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-07 10:45:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2019-12-07 10:45:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:45:09,386 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:09,386 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:09,987 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk,8 mathsat -unsat_core_generation=3,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:45:09,990 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:09,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:09,990 INFO L82 PathProgramCache]: Analyzing trace with hash 2113051981, now seen corresponding path program 1 times [2019-12-07 10:45:09,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:45:09,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448495668] [2019-12-07 10:45:09,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 10:45:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:10,083 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:45:10,084 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 10:45:10,091 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:10,102 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 10:45:10,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448495668] [2019-12-07 10:45:10,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:45:10,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 10:45:10,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923447081] [2019-12-07 10:45:10,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:45:10,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:45:10,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:45:10,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:45:10,103 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 6 states. [2019-12-07 10:45:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:10,139 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2019-12-07 10:45:10,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:45:10,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 10:45:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:10,140 INFO L225 Difference]: With dead ends: 66 [2019-12-07 10:45:10,140 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 10:45:10,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 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 10:45:10,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 10:45:10,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2019-12-07 10:45:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 10:45:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-12-07 10:45:10,147 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 33 [2019-12-07 10:45:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:10,147 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-12-07 10:45:10,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:45:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-12-07 10:45:10,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:45:10,148 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:10,148 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:10,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 10:45:10,349 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:10,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:10,349 INFO L82 PathProgramCache]: Analyzing trace with hash -66723983, now seen corresponding path program 2 times [2019-12-07 10:45:10,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:45:10,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225792124] [2019-12-07 10:45:10,350 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 10:45:10,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:45:10,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:45:10,464 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:45:10,465 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:10,479 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:45:10,480 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:45:10,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225792124] [2019-12-07 10:45:10,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [472268358] [2019-12-07 10:45:10,527 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:45:10,648 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:45:10,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:45:10,650 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:45:10,651 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:45:10,653 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:10,655 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:45:10,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818230651] [2019-12-07 10:45:10,655 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:45:10,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:45:10,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:45:10,703 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 10:45:10,704 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:45:10,706 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:45:10,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:45:10,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 7] total 15 [2019-12-07 10:45:10,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014863529] [2019-12-07 10:45:10,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 10:45:10,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:45:10,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 10:45:10,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:45:10,861 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 15 states. [2019-12-07 10:45:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:11,571 INFO L93 Difference]: Finished difference Result 154 states and 180 transitions. [2019-12-07 10:45:11,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 10:45:11,572 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2019-12-07 10:45:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:11,573 INFO L225 Difference]: With dead ends: 154 [2019-12-07 10:45:11,573 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 10:45:11,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2019-12-07 10:45:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 10:45:11,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 55. [2019-12-07 10:45:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 10:45:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-12-07 10:45:11,582 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 33 [2019-12-07 10:45:11,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:11,582 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-12-07 10:45:11,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 10:45:11,583 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-12-07 10:45:11,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 10:45:11,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:11,584 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:12,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 cvc4 --incremental --print-success --lang smt --rewrite-divk,12 mathsat -unsat_core_generation=3 [2019-12-07 10:45:12,187 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:12,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:12,187 INFO L82 PathProgramCache]: Analyzing trace with hash 655990325, now seen corresponding path program 1 times [2019-12-07 10:45:12,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:45:12,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236899782] [2019-12-07 10:45:12,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 10:45:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:12,277 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:45:12,278 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 10:45:12,289 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 10:45:12,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236899782] [2019-12-07 10:45:12,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [918606585] [2019-12-07 10:45:12,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:45:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:12,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:45:12,438 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 10:45:12,443 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 10:45:12,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238892308] [2019-12-07 10:45:12,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:45:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:12,496 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:45:12,497 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:12,502 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 10:45:12,502 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 10:45:12,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:45:12,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2019-12-07 10:45:12,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327981144] [2019-12-07 10:45:12,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:45:12,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:45:12,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:45:12,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:45:12,505 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2019-12-07 10:45:12,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:12,624 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2019-12-07 10:45:12,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:45:12,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-12-07 10:45:12,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:12,625 INFO L225 Difference]: With dead ends: 80 [2019-12-07 10:45:12,625 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 10:45:12,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 215 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:45:12,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 10:45:12,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 56. [2019-12-07 10:45:12,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 10:45:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2019-12-07 10:45:12,636 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 38 [2019-12-07 10:45:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:12,636 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-12-07 10:45:12,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:45:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2019-12-07 10:45:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 10:45:12,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:12,637 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:13,238 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3,16 cvc4 --incremental --print-success --lang smt --rewrite-divk,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:45:13,239 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:13,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:13,239 INFO L82 PathProgramCache]: Analyzing trace with hash -137671404, now seen corresponding path program 3 times [2019-12-07 10:45:13,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:45:13,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086635224] [2019-12-07 10:45:13,240 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 10:45:13,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 10:45:13,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:45:13,411 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:45:13,412 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 10:45:13,436 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 10:45:13,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086635224] [2019-12-07 10:45:13,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [278821073] [2019-12-07 10:45:13,488 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:45:13,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 10:45:13,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:45:13,683 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 10:45:13,684 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 10:45:13,690 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:13,889 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 10:45:13,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533943721] [2019-12-07 10:45:13,889 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:45:14,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 10:45:14,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:45:14,600 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 10:45:14,601 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 10:45:14,605 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 10:45:14,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:45:14,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 8, 6, 9] total 20 [2019-12-07 10:45:14,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894101062] [2019-12-07 10:45:14,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 10:45:14,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:45:14,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 10:45:14,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2019-12-07 10:45:14,835 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 20 states. [2019-12-07 10:45:14,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:14,949 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2019-12-07 10:45:14,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:45:14,949 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-12-07 10:45:14,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:14,949 INFO L225 Difference]: With dead ends: 67 [2019-12-07 10:45:14,950 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 10:45:14,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2019-12-07 10:45:14,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 10:45:14,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-07 10:45:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 10:45:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-12-07 10:45:14,954 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-12-07 10:45:14,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:14,955 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-12-07 10:45:14,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 10:45:14,955 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-12-07 10:45:14,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 10:45:14,955 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:14,955 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:15,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:45:15,557 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:15,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:15,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1087482302, now seen corresponding path program 1 times [2019-12-07 10:45:15,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:45:15,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500133328] [2019-12-07 10:45:15,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 10:45:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:15,680 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 57 conjunts are in the unsatisfiable core [2019-12-07 10:45:15,682 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:15,687 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 10:45:15,687 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:15,691 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:15,691 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:15,691 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 10:45:15,714 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:15,715 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:45:15,715 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:15,720 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:15,720 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:15,720 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-12-07 10:45:15,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:45:15,746 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:15,755 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:15,755 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:15,755 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-12-07 10:45:15,846 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_66|], 2=[|v_#memory_$Pointer$.base_73|]} [2019-12-07 10:45:15,849 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2019-12-07 10:45:15,850 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:15,865 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:15,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-12-07 10:45:15,867 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:15,874 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:15,875 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:15,875 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:20 [2019-12-07 10:45:15,999 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_71|], 2=[|v_#memory_$Pointer$.offset_67|], 6=[|v_#memory_$Pointer$.base_74|]} [2019-12-07 10:45:16,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2019-12-07 10:45:16,005 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:16,037 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:16,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:45:16,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 86 [2019-12-07 10:45:16,041 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:16,057 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:16,060 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:45:16,119 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:16,119 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 165 [2019-12-07 10:45:16,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:16,120 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:16,153 INFO L614 ElimStorePlain]: treesize reduction 125, result has 25.1 percent of original size [2019-12-07 10:45:16,153 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:16,153 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:140, output treesize:42 [2019-12-07 10:45:16,363 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 37 treesize of output 25 [2019-12-07 10:45:16,363 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:16,372 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:16,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-12-07 10:45:16,374 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:16,381 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:16,382 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:16,382 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:17 [2019-12-07 10:45:16,415 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 21 treesize of output 13 [2019-12-07 10:45:16,415 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:16,418 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:16,419 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:16,419 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:13 [2019-12-07 10:45:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:45:16,481 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:16,787 INFO L430 ElimStorePlain]: Different costs {1=[|#memory_int|], 2=[|v_#memory_$Pointer$.base_75|, |v_#memory_$Pointer$.offset_68|]} [2019-12-07 10:45:16,792 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 68 treesize of output 52 [2019-12-07 10:45:16,793 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 10:45:16,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:16,834 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-12-07 10:45:16,863 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:16,864 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-12-07 10:45:16,883 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:16,883 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-12-07 10:45:16,883 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-12-07 10:45:17,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:17,265 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.base_76|], 7=[|v_#memory_$Pointer$.offset_69|]} [2019-12-07 10:45:17,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-12-07 10:45:17,275 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:17,282 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-12-07 10:45:17,282 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:17,316 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:17,319 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:17,321 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:17,334 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:17,336 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 69 treesize of output 51 [2019-12-07 10:45:17,336 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:17,382 INFO L614 ElimStorePlain]: treesize reduction 18, result has 60.9 percent of original size [2019-12-07 10:45:17,382 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 10:45:17,383 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:111, output treesize:22 [2019-12-07 10:45:17,693 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 18 treesize of output 16 [2019-12-07 10:45:17,694 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 10:45:17,701 INFO L614 ElimStorePlain]: treesize reduction 18, result has 18.2 percent of original size [2019-12-07 10:45:17,701 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:17,702 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:17,702 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:17,703 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:4 [2019-12-07 10:45:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:45:17,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500133328] [2019-12-07 10:45:17,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1200699243] [2019-12-07 10:45:17,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:45:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:18,137 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 53 conjunts are in the unsatisfiable core [2019-12-07 10:45:18,139 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:18,142 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 10:45:18,142 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,145 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,146 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,146 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 10:45:18,152 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:45:18,153 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,158 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,158 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,158 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-12-07 10:45:18,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:45:18,162 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,170 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,170 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,171 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-12-07 10:45:18,173 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_74|], 2=[|v_#memory_$Pointer$.base_82|]} [2019-12-07 10:45:18,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2019-12-07 10:45:18,177 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,194 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,197 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-12-07 10:45:18,197 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,205 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,205 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,205 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:20 [2019-12-07 10:45:18,208 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_78|], 2=[|v_#memory_$Pointer$.offset_75|], 6=[|v_#memory_$Pointer$.base_83|]} [2019-12-07 10:45:18,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2019-12-07 10:45:18,214 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,248 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:45:18,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 86 [2019-12-07 10:45:18,252 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,269 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,271 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:45:18,322 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,322 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 165 [2019-12-07 10:45:18,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:18,323 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,356 INFO L614 ElimStorePlain]: treesize reduction 125, result has 25.1 percent of original size [2019-12-07 10:45:18,356 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,356 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:140, output treesize:42 [2019-12-07 10:45:18,406 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 37 treesize of output 25 [2019-12-07 10:45:18,406 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,416 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,418 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-12-07 10:45:18,418 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,425 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,425 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,425 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:17 [2019-12-07 10:45:18,428 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 21 treesize of output 13 [2019-12-07 10:45:18,428 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,434 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,434 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,434 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:13 [2019-12-07 10:45:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:45:18,444 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:18,449 INFO L430 ElimStorePlain]: Different costs {1=[|#memory_int|], 2=[|v_#memory_$Pointer$.offset_76|, |v_#memory_$Pointer$.base_84|]} [2019-12-07 10:45:18,454 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 68 treesize of output 52 [2019-12-07 10:45:18,455 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 10:45:18,493 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,495 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-12-07 10:45:18,524 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,525 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-12-07 10:45:18,543 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,543 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-12-07 10:45:18,543 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-12-07 10:45:18,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:18,650 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.base_85|], 7=[|v_#memory_$Pointer$.offset_77|]} [2019-12-07 10:45:18,658 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-12-07 10:45:18,659 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-12-07 10:45:18,667 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,700 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,703 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,704 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:18,715 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,717 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 69 treesize of output 51 [2019-12-07 10:45:18,718 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,761 INFO L614 ElimStorePlain]: treesize reduction 18, result has 60.9 percent of original size [2019-12-07 10:45:18,762 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 10:45:18,762 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:111, output treesize:22 [2019-12-07 10:45:18,857 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 18 treesize of output 16 [2019-12-07 10:45:18,858 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 10:45:18,865 INFO L614 ElimStorePlain]: treesize reduction 18, result has 18.2 percent of original size [2019-12-07 10:45:18,865 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,866 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,866 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,866 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:4 [2019-12-07 10:45:18,873 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:45:18,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889558670] [2019-12-07 10:45:18,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7e5d249-febd-4a78-b8e0-ab479e452e43/bin/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:45:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:18,930 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 60 conjunts are in the unsatisfiable core [2019-12-07 10:45:18,931 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:18,934 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 10:45:18,934 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,938 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,938 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,938 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 10:45:18,944 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:45:18,945 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,950 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,950 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,950 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-12-07 10:45:18,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:45:18,954 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,962 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,963 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,963 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-12-07 10:45:18,965 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_82|], 2=[|v_#memory_$Pointer$.base_91|]} [2019-12-07 10:45:18,970 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2019-12-07 10:45:18,970 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,984 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,986 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-12-07 10:45:18,986 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,996 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:18,996 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:18,996 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:20 [2019-12-07 10:45:19,213 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_85|], 2=[|v_#memory_$Pointer$.offset_83|], 6=[|v_#memory_$Pointer$.base_92|]} [2019-12-07 10:45:19,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2019-12-07 10:45:19,221 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:19,257 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:19,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:45:19,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 86 [2019-12-07 10:45:19,261 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:19,280 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:19,282 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:45:19,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:19,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 165 [2019-12-07 10:45:19,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:19,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:19,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:19,337 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-12-07 10:45:19,387 INFO L614 ElimStorePlain]: treesize reduction 316, result has 10.7 percent of original size [2019-12-07 10:45:19,387 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:19,388 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:140, output treesize:38 [2019-12-07 10:45:19,599 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 37 treesize of output 25 [2019-12-07 10:45:19,600 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:19,608 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:19,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-12-07 10:45:19,610 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:19,617 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:19,617 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:19,617 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:17 [2019-12-07 10:45:19,619 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 21 treesize of output 13 [2019-12-07 10:45:19,620 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:19,623 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:19,623 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:45:19,624 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:13 [2019-12-07 10:45:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:45:19,631 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:19,992 INFO L430 ElimStorePlain]: Different costs {1=[|#memory_int|], 2=[|v_#memory_$Pointer$.offset_84|, |v_#memory_$Pointer$.base_93|]} [2019-12-07 10:45:19,998 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 68 treesize of output 52 [2019-12-07 10:45:19,998 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 10:45:20,043 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:20,045 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-12-07 10:45:20,081 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:20,083 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-12-07 10:45:20,106 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:20,107 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-12-07 10:45:20,107 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-12-07 10:45:20,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:20,893 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.offset_85|], 7=[|v_#memory_$Pointer$.base_94|]} [2019-12-07 10:45:20,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-12-07 10:45:20,904 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:20,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-12-07 10:45:20,913 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:20,984 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:20,989 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 41 treesize of output 35 [2019-12-07 10:45:20,990 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:21,058 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:21,062 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:21,068 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:21,115 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:21,115 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 10:45:21,116 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:135, output treesize:105 [2019-12-07 10:45:21,492 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 10:45:22,084 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2019-12-07 10:45:22,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-12-07 10:45:22,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22, 22] total 42 [2019-12-07 10:45:22,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428592295] [2019-12-07 10:45:22,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-07 10:45:22,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:45:22,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 10:45:22,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2636, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 10:45:22,086 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 42 states. [2019-12-07 10:45:22,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 10:45:22,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3,22 cvc4 --incremental --print-success --lang smt --rewrite-divk,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:45:22,688 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@49557b36 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 10:45:22,696 INFO L168 Benchmark]: Toolchain (without parser) took 62905.06 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 252.7 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -77.2 MB). Peak memory consumption was 175.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:45:22,696 INFO L168 Benchmark]: CDTParser took 0.17 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 10:45:22,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:45:22,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.37 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 10:45:22,697 INFO L168 Benchmark]: Boogie Preprocessor took 23.76 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 10:45:22,697 INFO L168 Benchmark]: RCFGBuilder took 265.41 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: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:45:22,697 INFO L168 Benchmark]: TraceAbstraction took 62235.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.9 MB). Peak memory consumption was 172.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:45:22,699 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 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.37 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 23.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 265.41 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: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 62235.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.9 MB). Peak memory consumption was 172.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@49557b36 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@49557b36: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...