./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/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 cbb43537396073ed1952fe5a005c3f141189020b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/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 cbb43537396073ed1952fe5a005c3f141189020b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_67 |__ldv_list_add_#in~new.offset| __ldv_list_add_~next.offset) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 04:17:46,640 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:17:46,642 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:17:46,651 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:17:46,651 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:17:46,652 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:17:46,653 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:17:46,654 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:17:46,655 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:17:46,655 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:17:46,656 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:17:46,656 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:17:46,657 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:17:46,658 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:17:46,659 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:17:46,660 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:17:46,660 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:17:46,661 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:17:46,663 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:17:46,664 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:17:46,665 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:17:46,666 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:17:46,668 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:17:46,668 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:17:46,668 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:17:46,669 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:17:46,670 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:17:46,671 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:17:46,671 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:17:46,672 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:17:46,673 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:17:46,673 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:17:46,673 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:17:46,673 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:17:46,674 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:17:46,675 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:17:46,675 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 04:17:46,685 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:17:46,686 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:17:46,687 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 04:17:46,687 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 04:17:46,687 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 04:17:46,687 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 04:17:46,687 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 04:17:46,687 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 04:17:46,687 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 04:17:46,688 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 04:17:46,688 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 04:17:46,688 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 04:17:46,688 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 04:17:46,689 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:17:46,689 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:17:46,689 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:17:46,689 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:17:46,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:17:46,689 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 04:17:46,689 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 04:17:46,690 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 04:17:46,690 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:17:46,690 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:17:46,691 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:17:46,692 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 04:17:46,692 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:17:46,692 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:17:46,692 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 04:17:46,692 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 04:17:46,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 04:17:46,692 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:17:46,693 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 04:17:46,693 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 04:17:46,693 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 04:17:46,693 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 04:17:46,693 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 04:17:46,693 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 04:17:46,693 INFO L133 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/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/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 -> cbb43537396073ed1952fe5a005c3f141189020b [2018-11-23 04:17:46,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:17:46,727 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:17:46,730 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:17:46,731 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:17:46,731 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:17:46,732 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/../../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock_false-unreach-call.i [2018-11-23 04:17:46,774 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/data/e426e9aff/2ae5df6b5be44f809fa3a3839e6aba2b/FLAGcf85afcb5 [2018-11-23 04:17:47,217 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:17:47,218 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock_false-unreach-call.i [2018-11-23 04:17:47,228 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/data/e426e9aff/2ae5df6b5be44f809fa3a3839e6aba2b/FLAGcf85afcb5 [2018-11-23 04:17:47,239 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/data/e426e9aff/2ae5df6b5be44f809fa3a3839e6aba2b [2018-11-23 04:17:47,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:17:47,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:17:47,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:17:47,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:17:47,246 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:17:47,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:17:47" (1/1) ... [2018-11-23 04:17:47,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b7fe60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:17:47, skipping insertion in model container [2018-11-23 04:17:47,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:17:47" (1/1) ... [2018-11-23 04:17:47,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:17:47,290 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:17:47,522 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:17:47,576 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:17:47,617 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:17:47,656 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:17:47,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:17:47 WrapperNode [2018-11-23 04:17:47,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:17:47,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:17:47,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:17:47,658 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:17:47,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:17:47" (1/1) ... [2018-11-23 04:17:47,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:17:47" (1/1) ... [2018-11-23 04:17:47,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:17:47,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:17:47,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:17:47,679 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:17:47,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:17:47" (1/1) ... [2018-11-23 04:17:47,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:17:47" (1/1) ... [2018-11-23 04:17:47,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:17:47" (1/1) ... [2018-11-23 04:17:47,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:17:47" (1/1) ... [2018-11-23 04:17:47,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:17:47" (1/1) ... [2018-11-23 04:17:47,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:17:47" (1/1) ... [2018-11-23 04:17:47,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:17:47" (1/1) ... [2018-11-23 04:17:47,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:17:47,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:17:47,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:17:47,704 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:17:47,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:17:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/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 [2018-11-23 04:17:47,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 04:17:47,738 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-23 04:17:47,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-11-23 04:17:47,738 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2018-11-23 04:17:47,738 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2018-11-23 04:17:47,738 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_empty [2018-11-23 04:17:47,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_empty [2018-11-23 04:17:47,738 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2018-11-23 04:17:47,738 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2018-11-23 04:17:47,739 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2018-11-23 04:17:47,739 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2018-11-23 04:17:47,739 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2018-11-23 04:17:47,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2018-11-23 04:17:47,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 04:17:47,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 04:17:47,739 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2018-11-23 04:17:47,739 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2018-11-23 04:17:47,739 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 04:17:47,739 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 04:17:47,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 04:17:47,740 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2018-11-23 04:17:47,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2018-11-23 04:17:47,740 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2018-11-23 04:17:47,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2018-11-23 04:17:47,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 04:17:47,740 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_empty [2018-11-23 04:17:47,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_empty [2018-11-23 04:17:47,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 04:17:47,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 04:17:47,741 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-23 04:17:47,741 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-23 04:17:47,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2018-11-23 04:17:47,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2018-11-23 04:17:47,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2018-11-23 04:17:47,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2018-11-23 04:17:47,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-23 04:17:47,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-23 04:17:47,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_del [2018-11-23 04:17:47,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_del [2018-11-23 04:17:47,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:17:47,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:17:48,036 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:17:48,036 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 04:17:48,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:17:48 BoogieIcfgContainer [2018-11-23 04:17:48,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:17:48,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 04:17:48,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 04:17:48,041 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 04:17:48,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:17:47" (1/3) ... [2018-11-23 04:17:48,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed4f35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:17:48, skipping insertion in model container [2018-11-23 04:17:48,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:17:47" (2/3) ... [2018-11-23 04:17:48,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed4f35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:17:48, skipping insertion in model container [2018-11-23 04:17:48,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:17:48" (3/3) ... [2018-11-23 04:17:48,044 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock_false-unreach-call.i [2018-11-23 04:17:48,053 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 04:17:48,063 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-23 04:17:48,074 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-23 04:17:48,099 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 04:17:48,100 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 04:17:48,100 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 04:17:48,100 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:17:48,100 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:17:48,100 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 04:17:48,100 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:17:48,100 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 04:17:48,112 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-11-23 04:17:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 04:17:48,116 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:17:48,117 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:17:48,118 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:17:48,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:17:48,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1594759354, now seen corresponding path program 1 times [2018-11-23 04:17:48,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:17:48,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:17:48,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:17:48,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:17:48,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:17:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:17:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 04:17:48,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:17:48,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:17:48,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:17:48,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 04:17:48,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 04:17:48,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 04:17:48,264 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 2 states. [2018-11-23 04:17:48,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:17:48,288 INFO L93 Difference]: Finished difference Result 188 states and 225 transitions. [2018-11-23 04:17:48,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 04:17:48,289 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-23 04:17:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:17:48,297 INFO L225 Difference]: With dead ends: 188 [2018-11-23 04:17:48,297 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 04:17:48,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 04:17:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 04:17:48,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-23 04:17:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 04:17:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-11-23 04:17:48,333 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 30 [2018-11-23 04:17:48,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:17:48,334 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-11-23 04:17:48,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 04:17:48,334 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-11-23 04:17:48,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 04:17:48,335 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:17:48,335 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:17:48,335 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:17:48,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:17:48,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1879861572, now seen corresponding path program 1 times [2018-11-23 04:17:48,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:17:48,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:17:48,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:17:48,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:17:48,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:17:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:17:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 04:17:48,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:17:48,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:17:48,414 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:17:48,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 04:17:48,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 04:17:48,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:17:48,415 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 4 states. [2018-11-23 04:17:48,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:17:48,442 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2018-11-23 04:17:48,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 04:17:48,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-23 04:17:48,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:17:48,445 INFO L225 Difference]: With dead ends: 98 [2018-11-23 04:17:48,445 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 04:17:48,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:17:48,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 04:17:48,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-23 04:17:48,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 04:17:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2018-11-23 04:17:48,458 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 30 [2018-11-23 04:17:48,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:17:48,458 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2018-11-23 04:17:48,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 04:17:48,459 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-11-23 04:17:48,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 04:17:48,459 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:17:48,459 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:17:48,459 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:17:48,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:17:48,460 INFO L82 PathProgramCache]: Analyzing trace with hash -305258267, now seen corresponding path program 1 times [2018-11-23 04:17:48,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:17:48,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:17:48,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:17:48,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:17:48,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:17:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:17:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 04:17:48,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:17:48,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:17:48,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:17:48,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:17:48,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:17:48,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:17:48,575 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 5 states. [2018-11-23 04:17:48,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:17:48,942 INFO L93 Difference]: Finished difference Result 257 states and 311 transitions. [2018-11-23 04:17:48,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 04:17:48,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-23 04:17:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:17:48,944 INFO L225 Difference]: With dead ends: 257 [2018-11-23 04:17:48,944 INFO L226 Difference]: Without dead ends: 175 [2018-11-23 04:17:48,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 04:17:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-23 04:17:48,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 140. [2018-11-23 04:17:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 04:17:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 168 transitions. [2018-11-23 04:17:48,965 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 168 transitions. Word has length 30 [2018-11-23 04:17:48,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:17:48,965 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 168 transitions. [2018-11-23 04:17:48,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:17:48,965 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 168 transitions. [2018-11-23 04:17:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 04:17:48,968 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:17:48,968 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:17:48,969 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:17:48,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:17:48,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1875239642, now seen corresponding path program 1 times [2018-11-23 04:17:48,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:17:48,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:17:48,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:17:48,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:17:48,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:17:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:17:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-23 04:17:49,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:17:49,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:17:49,048 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 79 with the following transitions: [2018-11-23 04:17:49,049 INFO L202 CegarAbsIntRunner]: [8], [10], [26], [27], [30], [32], [35], [36], [47], [48], [82], [84], [91], [94], [95], [97], [105], [107], [111], [112], [118], [130], [131], [134], [135], [136], [137], [138], [139], [140], [141], [142], [143], [144], [150], [154], [155], [164], [165], [166], [167], [168], [169], [174], [175], [176] [2018-11-23 04:17:49,075 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:17:49,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:17:49,229 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 04:17:49,230 INFO L272 AbstractInterpreter]: Visited 33 different actions 39 times. Never merged. Never widened. Performed 341 root evaluator evaluations with a maximum evaluation depth of 9. Performed 341 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Never found a fixpoint. Largest state had 31 variables. [2018-11-23 04:17:49,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:17:49,235 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 04:17:49,337 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 72.44% of their original sizes. [2018-11-23 04:17:49,337 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 04:17:49,444 INFO L415 sIntCurrentIteration]: We unified 77 AI predicates to 77 [2018-11-23 04:17:49,444 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 04:17:49,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 04:17:49,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2018-11-23 04:17:49,445 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:17:49,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 04:17:49,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:17:49,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:17:49,446 INFO L87 Difference]: Start difference. First operand 140 states and 168 transitions. Second operand 11 states. [2018-11-23 04:17:50,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:17:50,670 INFO L93 Difference]: Finished difference Result 257 states and 308 transitions. [2018-11-23 04:17:50,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 04:17:50,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2018-11-23 04:17:50,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:17:50,672 INFO L225 Difference]: With dead ends: 257 [2018-11-23 04:17:50,672 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 04:17:50,675 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-23 04:17:50,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 04:17:50,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2018-11-23 04:17:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 04:17:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 170 transitions. [2018-11-23 04:17:50,689 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 170 transitions. Word has length 78 [2018-11-23 04:17:50,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:17:50,689 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 170 transitions. [2018-11-23 04:17:50,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 04:17:50,689 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 170 transitions. [2018-11-23 04:17:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 04:17:50,691 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:17:50,691 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:17:50,691 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:17:50,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:17:50,691 INFO L82 PathProgramCache]: Analyzing trace with hash 885640952, now seen corresponding path program 1 times [2018-11-23 04:17:50,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:17:50,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:17:50,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:17:50,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:17:50,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:17:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:17:50,886 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 04:17:50,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:17:50,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:17:50,886 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 79 with the following transitions: [2018-11-23 04:17:50,887 INFO L202 CegarAbsIntRunner]: [8], [10], [26], [27], [30], [32], [35], [36], [47], [48], [82], [84], [91], [94], [95], [97], [105], [107], [111], [112], [118], [120], [123], [130], [131], [134], [135], [136], [137], [138], [139], [140], [141], [142], [143], [144], [150], [154], [155], [164], [165], [166], [167], [168], [169], [174], [175], [176] [2018-11-23 04:17:50,888 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:17:50,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:17:50,950 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 04:17:50,950 INFO L272 AbstractInterpreter]: Visited 48 different actions 108 times. Merged at 8 different actions 20 times. Never widened. Performed 735 root evaluator evaluations with a maximum evaluation depth of 9. Performed 735 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 3 fixpoints after 2 different actions. Largest state had 33 variables. [2018-11-23 04:17:50,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:17:50,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 04:17:50,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:17:50,964 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:17:50,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:17:50,981 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 04:17:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:17:51,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:17:51,115 INFO L478 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 7 treesize of output 5 [2018-11-23 04:17:51,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:17:51,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,144 INFO L478 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 7 treesize of output 5 [2018-11-23 04:17:51,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:17:51,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,155 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-11-23 04:17:51,182 INFO L478 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 7 treesize of output 5 [2018-11-23 04:17:51,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:17:51,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,198 INFO L478 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 7 treesize of output 5 [2018-11-23 04:17:51,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:17:51,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,200 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,204 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-11-23 04:17:51,316 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 04:17:51,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 04:17:51,625 INFO L478 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 8 treesize of output 6 [2018-11-23 04:17:51,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 04:17:51,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,635 INFO L478 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 8 treesize of output 6 [2018-11-23 04:17:51,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-11-23 04:17:51,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,643 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2018-11-23 04:17:51,741 INFO L478 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 8 treesize of output 6 [2018-11-23 04:17:51,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 04:17:51,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,749 INFO L478 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 8 treesize of output 6 [2018-11-23 04:17:51,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 04:17:51,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,756 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2018-11-23 04:17:51,939 INFO L478 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 40 treesize of output 38 [2018-11-23 04:17:51,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 04:17:51,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,948 INFO L478 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 40 treesize of output 38 [2018-11-23 04:17:51,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 04:17:51,952 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,963 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,975 INFO L478 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 32 treesize of output 30 [2018-11-23 04:17:51,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 04:17:51,978 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,981 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,982 INFO L478 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 32 treesize of output 30 [2018-11-23 04:17:51,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 04:17:51,984 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,988 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:51,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:17:51,996 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:81, output treesize:49 [2018-11-23 04:17:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-23 04:17:52,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:17:52,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [13, 10] total 28 [2018-11-23 04:17:52,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:17:52,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 04:17:52,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 04:17:52,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2018-11-23 04:17:52,082 INFO L87 Difference]: Start difference. First operand 143 states and 170 transitions. Second operand 10 states. [2018-11-23 04:17:52,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:17:52,915 INFO L93 Difference]: Finished difference Result 323 states and 386 transitions. [2018-11-23 04:17:52,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 04:17:52,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-11-23 04:17:52,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:17:52,918 INFO L225 Difference]: With dead ends: 323 [2018-11-23 04:17:52,918 INFO L226 Difference]: Without dead ends: 209 [2018-11-23 04:17:52,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=361, Invalid=1361, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 04:17:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-23 04:17:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 146. [2018-11-23 04:17:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 04:17:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 169 transitions. [2018-11-23 04:17:52,941 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 169 transitions. Word has length 78 [2018-11-23 04:17:52,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:17:52,941 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 169 transitions. [2018-11-23 04:17:52,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 04:17:52,941 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 169 transitions. [2018-11-23 04:17:52,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 04:17:52,943 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:17:52,943 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:17:52,943 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:17:52,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:17:52,943 INFO L82 PathProgramCache]: Analyzing trace with hash 559822637, now seen corresponding path program 1 times [2018-11-23 04:17:52,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:17:52,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:17:52,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:17:52,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:17:52,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:17:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:17:54,365 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 04:17:54,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:17:54,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:17:54,365 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-11-23 04:17:54,366 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [8], [10], [26], [27], [28], [29], [47], [48], [82], [84], [87], [88], [91], [94], [95], [97], [100], [102], [107], [111], [112], [118], [120], [123], [130], [131], [132], [133], [134], [135], [136], [137], [138], [139], [140], [141], [142], [150], [164], [165], [166], [167], [168], [169], [170], [171], [172], [173], [174], [175], [176] [2018-11-23 04:17:54,367 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:17:54,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:17:54,466 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 04:17:54,466 INFO L272 AbstractInterpreter]: Visited 54 different actions 124 times. Merged at 6 different actions 16 times. Never widened. Performed 904 root evaluator evaluations with a maximum evaluation depth of 9. Performed 904 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 4 fixpoints after 2 different actions. Largest state had 33 variables. [2018-11-23 04:17:54,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:17:54,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 04:17:54,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:17:54,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:17:54,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:17:54,522 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 04:17:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:17:54,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:17:54,630 INFO L478 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 [2018-11-23 04:17:54,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:54,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:54,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-11-23 04:17:54,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:54,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:54,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 04:17:54,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:54,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:54,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-11-23 04:17:55,026 INFO L478 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 7 treesize of output 5 [2018-11-23 04:17:55,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:17:55,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:55,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:55,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:55,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2018-11-23 04:17:55,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 48 [2018-11-23 04:17:55,614 INFO L478 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 10 treesize of output 9 [2018-11-23 04:17:55,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:55,806 INFO L478 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 45 treesize of output 58 [2018-11-23 04:17:55,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 49 [2018-11-23 04:17:55,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:55,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:55,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 63 [2018-11-23 04:17:55,854 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-23 04:17:55,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:55,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-11-23 04:17:55,941 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:56,000 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 04:17:56,196 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-11-23 04:17:56,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:56,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2018-11-23 04:17:56,202 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:56,220 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:56,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-11-23 04:17:56,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:56,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 58 [2018-11-23 04:17:56,405 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-11-23 04:17:56,454 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 04:17:56,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-11-23 04:17:56,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:56,685 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:56,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 67 [2018-11-23 04:17:56,709 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-11-23 04:17:56,793 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 04:17:56,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-11-23 04:17:56,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:56,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:56,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 44 [2018-11-23 04:17:56,816 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-11-23 04:17:56,867 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 04:17:56,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-11-23 04:17:56,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:56,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 36 [2018-11-23 04:17:56,964 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-23 04:17:56,999 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:17:57,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-23 04:17:57,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 53 [2018-11-23 04:17:57,350 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2018-11-23 04:17:57,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:57,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2018-11-23 04:17:57,357 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:57,376 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:57,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2018-11-23 04:17:57,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:57,486 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:57,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 64 [2018-11-23 04:17:57,497 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-11-23 04:17:57,571 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:57,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 46 [2018-11-23 04:17:57,573 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:57,641 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 04:17:57,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 50 [2018-11-23 04:17:57,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 52 [2018-11-23 04:17:57,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:57,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 57 [2018-11-23 04:17:57,828 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:57,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:57,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:17:57,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 81 [2018-11-23 04:17:57,878 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-11-23 04:17:57,937 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 04:17:58,019 INFO L478 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 37 treesize of output 36 [2018-11-23 04:17:58,020 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:58,091 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 04:17:58,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 57 [2018-11-23 04:17:58,284 INFO L478 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 48 treesize of output 53 [2018-11-23 04:17:58,284 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:58,318 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:58,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2018-11-23 04:17:58,424 INFO L478 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 8 treesize of output 13 [2018-11-23 04:17:58,424 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:58,436 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:58,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-11-23 04:17:58,444 INFO L478 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 8 treesize of output 13 [2018-11-23 04:17:58,444 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-23 04:17:58,458 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:17:58,499 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 04:17:58,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-11-23 04:17:58,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 6 xjuncts. [2018-11-23 04:17:58,724 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 2 variables, input treesize:158, output treesize:746 [2018-11-23 04:17:59,546 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-23 04:18:03,150 WARN L180 SmtUtils]: Spent 3.05 s on a formula simplification that was a NOOP. DAG size: 107 [2018-11-23 04:19:22,782 WARN L180 SmtUtils]: Spent 1.02 m on a formula simplification that was a NOOP. DAG size: 171 [2018-11-23 04:20:30,035 WARN L180 SmtUtils]: Spent 31.41 s on a formula simplification. DAG size of input: 170 DAG size of output: 109 [2018-11-23 04:20:34,372 WARN L180 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 222 DAG size of output: 81 [2018-11-23 04:20:34,379 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:34,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:34,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:34,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 04:20:34,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:34,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 118 [2018-11-23 04:20:34,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 04:20:34,552 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 59 [2018-11-23 04:20:34,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 04:20:34,601 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2018-11-23 04:20:34,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:34,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-11-23 04:20:34,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:34,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 53 [2018-11-23 04:20:34,623 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,630 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:34,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-11-23 04:20:34,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:34,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-11-23 04:20:34,647 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,659 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,667 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,674 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,690 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,691 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 04:20:34,691 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,692 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 04:20:34,692 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,692 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 04:20:34,692 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,693 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 04:20:34,693 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,693 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 04:20:34,694 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,694 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 04:20:34,694 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,695 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 04:20:34,695 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 163 [2018-11-23 04:20:34,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 04:20:34,706 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:34,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 90 [2018-11-23 04:20:34,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 75 [2018-11-23 04:20:34,782 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-11-23 04:20:34,811 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:34,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 74 [2018-11-23 04:20:34,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-23 04:20:34,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 04:20:34,824 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,829 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:34,845 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:34,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:34,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 65 [2018-11-23 04:20:34,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 46 [2018-11-23 04:20:34,850 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,861 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,872 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:34,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:34,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:34,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 81 [2018-11-23 04:20:34,899 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 45 [2018-11-23 04:20:34,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2018-11-23 04:20:34,904 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,919 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:34,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:34,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:34,934 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:20:34,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 52 [2018-11-23 04:20:34,940 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:20:34,951 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 32 [2018-11-23 04:20:34,952 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:20:34,960 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:20:34,970 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:20:34,994 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 04:20:35,018 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 04:20:35,019 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 04:20:35,019 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:35,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-23 04:20:35,059 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 11 variables, input treesize:1206, output treesize:365 [2018-11-23 04:20:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 04:20:37,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 04:20:39,180 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-23 04:20:39,386 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-11-23 04:20:39,503 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-23 04:20:39,619 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-23 04:20:41,046 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-23 04:20:41,200 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-11-23 04:20:41,302 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-23 04:20:41,863 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:20:41,864 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 89781 column 11: unknown constant v_prenex_21 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:114) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:136) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:120) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.checkEqualityStatus(Elim1Store.java:668) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.analyzeIndexEqualities(Elim1Store.java:760) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:300) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) 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:123) 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) [2018-11-23 04:20:41,867 INFO L168 Benchmark]: Toolchain (without parser) took 174624.65 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.1 MB). Free memory was 955.4 MB in the beginning and 884.0 MB in the end (delta: 71.3 MB). Peak memory consumption was 419.5 MB. Max. memory is 11.5 GB. [2018-11-23 04:20:41,867 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:20:41,867 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. [2018-11-23 04:20:41,868 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.61 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. [2018-11-23 04:20:41,868 INFO L168 Benchmark]: Boogie Preprocessor took 24.25 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 04:20:41,868 INFO L168 Benchmark]: RCFGBuilder took 332.84 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: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-11-23 04:20:41,868 INFO L168 Benchmark]: TraceAbstraction took 173829.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.7 MB). Free memory was 1.1 GB in the beginning and 884.0 MB in the end (delta: 192.7 MB). Peak memory consumption was 402.4 MB. Max. memory is 11.5 GB. [2018-11-23 04:20:41,870 INFO L336 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 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 413.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.61 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 24.25 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 332.84 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: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 173829.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.7 MB). Free memory was 1.1 GB in the beginning and 884.0 MB in the end (delta: 192.7 MB). Peak memory consumption was 402.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 89781 column 11: unknown constant v_prenex_21 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 89781 column 11: unknown constant v_prenex_21: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 04:20:43,278 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:20:43,279 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:20:43,287 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:20:43,287 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:20:43,288 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:20:43,288 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:20:43,290 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:20:43,291 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:20:43,291 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:20:43,292 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:20:43,292 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:20:43,293 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:20:43,293 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:20:43,294 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:20:43,295 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:20:43,295 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:20:43,297 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:20:43,298 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:20:43,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:20:43,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:20:43,300 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:20:43,302 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:20:43,302 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:20:43,302 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:20:43,303 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:20:43,304 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:20:43,304 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:20:43,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:20:43,306 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:20:43,306 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:20:43,306 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:20:43,306 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:20:43,307 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:20:43,307 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:20:43,308 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:20:43,308 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 04:20:43,318 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:20:43,319 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:20:43,319 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 04:20:43,319 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 04:20:43,320 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 04:20:43,320 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 04:20:43,320 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 04:20:43,320 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 04:20:43,320 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 04:20:43,320 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 04:20:43,321 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:20:43,321 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:20:43,321 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:20:43,321 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:20:43,321 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 04:20:43,322 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 04:20:43,322 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 04:20:43,322 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 04:20:43,322 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 04:20:43,322 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:20:43,322 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:20:43,322 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:20:43,323 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 04:20:43,323 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:20:43,323 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:20:43,323 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 04:20:43,323 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 04:20:43,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 04:20:43,323 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:20:43,324 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 04:20:43,324 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 04:20:43,324 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 04:20:43,324 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 04:20:43,324 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 04:20:43,324 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 04:20:43,324 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/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 -> cbb43537396073ed1952fe5a005c3f141189020b [2018-11-23 04:20:43,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:20:43,360 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:20:43,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:20:43,364 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:20:43,364 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:20:43,364 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/../../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock_false-unreach-call.i [2018-11-23 04:20:43,400 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/data/4990e1b06/266fbd59b7044d5ea127836901d0b114/FLAG35b6b6a74 [2018-11-23 04:20:43,840 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:20:43,841 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock_false-unreach-call.i [2018-11-23 04:20:43,850 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/data/4990e1b06/266fbd59b7044d5ea127836901d0b114/FLAG35b6b6a74 [2018-11-23 04:20:43,858 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/data/4990e1b06/266fbd59b7044d5ea127836901d0b114 [2018-11-23 04:20:43,860 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:20:43,861 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:20:43,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:20:43,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:20:43,864 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:20:43,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:20:43" (1/1) ... [2018-11-23 04:20:43,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f3c34a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:43, skipping insertion in model container [2018-11-23 04:20:43,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:20:43" (1/1) ... [2018-11-23 04:20:43,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:20:43,907 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:20:44,159 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:20:44,168 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:20:44,215 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:20:44,288 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:20:44,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:44 WrapperNode [2018-11-23 04:20:44,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:20:44,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:20:44,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:20:44,290 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:20:44,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:44" (1/1) ... [2018-11-23 04:20:44,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:44" (1/1) ... [2018-11-23 04:20:44,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:20:44,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:20:44,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:20:44,314 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:20:44,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:44" (1/1) ... [2018-11-23 04:20:44,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:44" (1/1) ... [2018-11-23 04:20:44,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:44" (1/1) ... [2018-11-23 04:20:44,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:44" (1/1) ... [2018-11-23 04:20:44,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:44" (1/1) ... [2018-11-23 04:20:44,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:44" (1/1) ... [2018-11-23 04:20:44,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:44" (1/1) ... [2018-11-23 04:20:44,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:20:44,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:20:44,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:20:44,342 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:20:44,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/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 [2018-11-23 04:20:44,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 04:20:44,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-23 04:20:44,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-11-23 04:20:44,379 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2018-11-23 04:20:44,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2018-11-23 04:20:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_empty [2018-11-23 04:20:44,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_empty [2018-11-23 04:20:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2018-11-23 04:20:44,380 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2018-11-23 04:20:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2018-11-23 04:20:44,380 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2018-11-23 04:20:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2018-11-23 04:20:44,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2018-11-23 04:20:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 04:20:44,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 04:20:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2018-11-23 04:20:44,381 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2018-11-23 04:20:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 04:20:44,381 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 04:20:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 04:20:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2018-11-23 04:20:44,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2018-11-23 04:20:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2018-11-23 04:20:44,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2018-11-23 04:20:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 04:20:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_empty [2018-11-23 04:20:44,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_empty [2018-11-23 04:20:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 04:20:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 04:20:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-23 04:20:44,382 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-23 04:20:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2018-11-23 04:20:44,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2018-11-23 04:20:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2018-11-23 04:20:44,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2018-11-23 04:20:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-23 04:20:44,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-23 04:20:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_del [2018-11-23 04:20:44,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_del [2018-11-23 04:20:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:20:44,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:20:44,746 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:20:44,746 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 04:20:44,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:20:44 BoogieIcfgContainer [2018-11-23 04:20:44,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:20:44,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 04:20:44,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 04:20:44,750 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 04:20:44,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:20:43" (1/3) ... [2018-11-23 04:20:44,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6df3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:20:44, skipping insertion in model container [2018-11-23 04:20:44,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:44" (2/3) ... [2018-11-23 04:20:44,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6df3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:20:44, skipping insertion in model container [2018-11-23 04:20:44,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:20:44" (3/3) ... [2018-11-23 04:20:44,753 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock_false-unreach-call.i [2018-11-23 04:20:44,759 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 04:20:44,764 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-23 04:20:44,773 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-23 04:20:44,796 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 04:20:44,796 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 04:20:44,796 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 04:20:44,796 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 04:20:44,796 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:20:44,796 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:20:44,796 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 04:20:44,796 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:20:44,796 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 04:20:44,812 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-11-23 04:20:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 04:20:44,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:20:44,816 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:20:44,818 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:20:44,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:20:44,821 INFO L82 PathProgramCache]: Analyzing trace with hash -2118021768, now seen corresponding path program 1 times [2018-11-23 04:20:44,825 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 04:20:44,825 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 04:20:44,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:20:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:20:44,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:20:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 04:20:44,944 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 04:20:44,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:20:44,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:20:44,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 04:20:44,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 04:20:44,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:20:44,959 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 4 states. [2018-11-23 04:20:44,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:20:44,999 INFO L93 Difference]: Finished difference Result 183 states and 223 transitions. [2018-11-23 04:20:44,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 04:20:45,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-23 04:20:45,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:20:45,007 INFO L225 Difference]: With dead ends: 183 [2018-11-23 04:20:45,008 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 04:20:45,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:20:45,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 04:20:45,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-23 04:20:45,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 04:20:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2018-11-23 04:20:45,042 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 29 [2018-11-23 04:20:45,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:20:45,043 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2018-11-23 04:20:45,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 04:20:45,043 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2018-11-23 04:20:45,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 04:20:45,045 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:20:45,045 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:20:45,045 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:20:45,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:20:45,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2067228113, now seen corresponding path program 1 times [2018-11-23 04:20:45,046 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 04:20:45,046 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 04:20:45,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:20:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:20:45,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:20:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 04:20:45,245 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 04:20:45,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:20:45,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:20:45,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:20:45,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:20:45,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:20:45,250 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 5 states. [2018-11-23 04:20:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:20:45,760 INFO L93 Difference]: Finished difference Result 235 states and 283 transitions. [2018-11-23 04:20:45,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:20:45,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 04:20:45,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:20:45,763 INFO L225 Difference]: With dead ends: 235 [2018-11-23 04:20:45,763 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 04:20:45,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:20:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 04:20:45,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2018-11-23 04:20:45,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 04:20:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 160 transitions. [2018-11-23 04:20:45,781 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 160 transitions. Word has length 29 [2018-11-23 04:20:45,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:20:45,781 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 160 transitions. [2018-11-23 04:20:45,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:20:45,781 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 160 transitions. [2018-11-23 04:20:45,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 04:20:45,782 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:20:45,782 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:20:45,783 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:20:45,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:20:45,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1711544116, now seen corresponding path program 1 times [2018-11-23 04:20:45,783 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 04:20:45,784 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 04:20:45,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:20:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:20:45,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:20:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 04:20:45,900 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 04:20:45,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:20:45,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:20:45,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 04:20:45,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 04:20:45,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:20:45,903 INFO L87 Difference]: Start difference. First operand 132 states and 160 transitions. Second operand 4 states. [2018-11-23 04:20:45,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:20:45,923 INFO L93 Difference]: Finished difference Result 239 states and 291 transitions. [2018-11-23 04:20:45,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 04:20:45,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-11-23 04:20:45,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:20:45,926 INFO L225 Difference]: With dead ends: 239 [2018-11-23 04:20:45,926 INFO L226 Difference]: Without dead ends: 136 [2018-11-23 04:20:45,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:20:45,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-23 04:20:45,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-11-23 04:20:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 04:20:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 164 transitions. [2018-11-23 04:20:45,940 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 164 transitions. Word has length 73 [2018-11-23 04:20:45,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:20:45,941 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 164 transitions. [2018-11-23 04:20:45,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 04:20:45,941 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 164 transitions. [2018-11-23 04:20:45,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 04:20:45,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:20:45,944 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:20:45,945 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:20:45,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:20:45,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1933427362, now seen corresponding path program 1 times [2018-11-23 04:20:45,945 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 04:20:45,945 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 04:20:45,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:20:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:20:46,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:20:46,135 INFO L478 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 [2018-11-23 04:20:46,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:46,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:46,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-11-23 04:20:46,229 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:46,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:46,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 04:20:46,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:46,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:46,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-11-23 04:20:46,300 INFO L478 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 7 treesize of output 5 [2018-11-23 04:20:46,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:20:46,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:46,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:46,316 INFO L478 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 7 treesize of output 5 [2018-11-23 04:20:46,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:20:46,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:46,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:46,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:46,327 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-11-23 04:20:46,687 INFO L478 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 7 treesize of output 5 [2018-11-23 04:20:46,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:20:46,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:46,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:46,707 INFO L478 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 7 treesize of output 5 [2018-11-23 04:20:46,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:20:46,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:46,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:46,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:46,725 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-11-23 04:20:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 04:20:46,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 04:20:49,333 INFO L478 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 72 treesize of output 68 [2018-11-23 04:20:49,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-11-23 04:20:49,341 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:20:49,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:20:49,458 INFO L478 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 66 [2018-11-23 04:20:49,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 57 treesize of output 55 [2018-11-23 04:20:49,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:49,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 52 treesize of output 40 [2018-11-23 04:20:49,513 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:49,549 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:49,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:20:49,577 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:99, output treesize:67 [2018-11-23 04:20:50,377 INFO L478 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 57 [2018-11-23 04:20:50,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 48 treesize of output 40 [2018-11-23 04:20:50,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:50,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 43 treesize of output 35 [2018-11-23 04:20:50,418 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:50,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:50,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:50,433 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:67, output treesize:17 [2018-11-23 04:20:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 04:20:51,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:20:51,479 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:20:51,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:20:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:20:51,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:20:51,547 INFO L478 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 [2018-11-23 04:20:51,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:51,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:51,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-11-23 04:20:51,562 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:51,563 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:20:51,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 04:20:51,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:51,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:51,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-11-23 04:20:51,575 INFO L478 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 7 treesize of output 5 [2018-11-23 04:20:51,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:20:51,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:51,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:51,586 INFO L478 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 7 treesize of output 5 [2018-11-23 04:20:51,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:20:51,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:51,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:51,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:51,593 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-11-23 04:20:51,611 INFO L478 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 7 treesize of output 5 [2018-11-23 04:20:51,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:20:51,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:51,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:51,628 INFO L478 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 7 treesize of output 5 [2018-11-23 04:20:51,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:20:51,630 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:51,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:51,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:51,638 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-11-23 04:20:51,663 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 04:20:51,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 04:20:53,182 INFO L478 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 74 [2018-11-23 04:20:53,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 65 treesize of output 45 [2018-11-23 04:20:53,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:53,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 45 treesize of output 43 [2018-11-23 04:20:53,232 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:53,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:53,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:20:53,324 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:99, output treesize:67 [2018-11-23 04:20:53,503 INFO L478 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 57 [2018-11-23 04:20:53,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 48 treesize of output 40 [2018-11-23 04:20:53,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:53,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 21 [2018-11-23 04:20:53,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:20:53,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:53,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:20:53,566 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:67, output treesize:17 [2018-11-23 04:20:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 04:20:54,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 04:20:54,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 20, 23] total 41 [2018-11-23 04:20:54,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 04:20:54,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 04:20:54,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1478, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 04:20:54,051 INFO L87 Difference]: Start difference. First operand 136 states and 164 transitions. Second operand 41 states. [2018-11-23 04:20:57,640 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2018-11-23 04:21:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:21:10,992 INFO L93 Difference]: Finished difference Result 310 states and 397 transitions. [2018-11-23 04:21:10,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 04:21:10,993 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 73 [2018-11-23 04:21:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:21:10,994 INFO L225 Difference]: With dead ends: 310 [2018-11-23 04:21:10,994 INFO L226 Difference]: Without dead ends: 235 [2018-11-23 04:21:10,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 254 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1725 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=717, Invalid=5289, Unknown=0, NotChecked=0, Total=6006 [2018-11-23 04:21:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-23 04:21:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 187. [2018-11-23 04:21:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-23 04:21:11,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 242 transitions. [2018-11-23 04:21:11,029 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 242 transitions. Word has length 73 [2018-11-23 04:21:11,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:21:11,030 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 242 transitions. [2018-11-23 04:21:11,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 04:21:11,030 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 242 transitions. [2018-11-23 04:21:11,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 04:21:11,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:21:11,032 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:21:11,032 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:21:11,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:21:11,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1551257098, now seen corresponding path program 1 times [2018-11-23 04:21:11,034 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 04:21:11,034 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 04:21:11,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:21:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:21:11,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:21:11,208 INFO L478 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 [2018-11-23 04:21:11,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:21:11,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:21:11,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-11-23 04:21:11,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:21:11,298 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:21:11,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 04:21:11,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:21:11,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:21:11,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-11-23 04:21:11,368 INFO L478 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 7 treesize of output 5 [2018-11-23 04:21:11,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:21:11,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:21:11,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:21:11,379 INFO L478 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 7 treesize of output 5 [2018-11-23 04:21:11,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:21:11,380 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:21:11,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:21:11,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:21:11,386 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-11-23 04:21:11,720 INFO L478 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 7 treesize of output 5 [2018-11-23 04:21:11,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:21:11,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:21:11,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:21:11,735 INFO L478 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 7 treesize of output 5 [2018-11-23 04:21:11,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:21:11,738 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:21:11,739 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:21:11,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:21:11,744 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-11-23 04:21:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 31 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 04:21:12,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 04:21:17,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 128 [2018-11-23 04:21:17,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 115 [2018-11-23 04:21:17,774 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:21:17,872 INFO L478 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 116 [2018-11-23 04:21:17,873 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 04:21:17,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 111 [2018-11-23 04:21:17,987 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:21:18,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-23 04:21:18,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 122 [2018-11-23 04:21:18,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 106 treesize of output 94 [2018-11-23 04:21:18,320 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:21:18,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2018-11-23 04:21:18,529 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:21:18,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 115 [2018-11-23 04:21:18,686 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-23 04:21:18,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 77 treesize of output 75 [2018-11-23 04:21:18,908 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:21:18,998 INFO L267 ElimStorePlain]: Start of recursive call 6: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:21:19,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 123 [2018-11-23 04:21:19,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 96 [2018-11-23 04:21:19,090 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:21:19,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 118 [2018-11-23 04:21:19,514 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-23 04:21:20,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 118 [2018-11-23 04:21:20,019 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-23 04:21:20,338 INFO L267 ElimStorePlain]: Start of recursive call 11: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:21:20,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 120 [2018-11-23 04:21:20,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 94 treesize of output 92 [2018-11-23 04:21:20,424 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 04:21:20,778 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:21:20,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 80 [2018-11-23 04:21:20,783 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 04:21:21,019 INFO L267 ElimStorePlain]: Start of recursive call 15: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:21:21,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:21:21,150 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 4 variables, input treesize:252, output treesize:99 [2018-11-23 04:21:21,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 105 [2018-11-23 04:21:21,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 90 treesize of output 76 [2018-11-23 04:21:21,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:21:22,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 100 [2018-11-23 04:21:22,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-11-23 04:21:22,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:21:22,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:21:22,426 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:99, output treesize:17 [2018-11-23 04:21:23,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 84 treesize of output 47 [2018-11-23 04:21:23,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:21:23,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:21:23,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:47 [2018-11-23 04:21:24,311 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-23 04:21:24,311 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 1 variables, input treesize:102, output treesize:1 [2018-11-23 04:21:24,355 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 04:21:24,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:21:24,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:21:24,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:21:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:21:24,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:21:24,406 INFO L478 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 7 treesize of output 5 [2018-11-23 04:21:24,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:21:24,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:21:24,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:21:24,417 INFO L478 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 7 treesize of output 5 [2018-11-23 04:21:24,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:21:24,419 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:21:24,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:21:24,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:21:24,424 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-11-23 04:21:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 04:21:25,091 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 04:21:25,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:21:25,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [25, 30] total 58 [2018-11-23 04:21:25,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-23 04:21:25,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-23 04:21:25,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=3049, Unknown=1, NotChecked=0, Total=3306 [2018-11-23 04:21:25,108 INFO L87 Difference]: Start difference. First operand 187 states and 242 transitions. Second operand 58 states. [2018-11-23 04:21:25,508 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-11-23 04:21:40,538 WARN L180 SmtUtils]: Spent 12.38 s on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2018-11-23 04:21:57,652 WARN L180 SmtUtils]: Spent 12.54 s on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2018-11-23 04:22:10,880 WARN L180 SmtUtils]: Spent 12.60 s on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2018-11-23 04:22:23,970 WARN L180 SmtUtils]: Spent 12.58 s on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2018-11-23 04:22:27,402 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2018-11-23 04:22:46,499 WARN L180 SmtUtils]: Spent 12.44 s on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-11-23 04:22:59,714 WARN L180 SmtUtils]: Spent 12.66 s on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2018-11-23 04:23:08,357 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2018-11-23 04:23:23,594 WARN L180 SmtUtils]: Spent 12.56 s on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-11-23 04:23:48,077 WARN L180 SmtUtils]: Spent 12.57 s on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-11-23 04:24:02,284 WARN L180 SmtUtils]: Spent 12.47 s on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2018-11-23 04:24:15,725 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2018-11-23 04:24:38,228 WARN L180 SmtUtils]: Spent 12.55 s on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2018-11-23 04:24:38,879 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-11-23 04:24:41,656 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-23 04:24:54,860 WARN L180 SmtUtils]: Spent 12.71 s on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-11-23 04:24:55,633 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2018-11-23 04:25:00,721 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2018-11-23 04:25:14,955 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-23 04:25:22,285 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-11-23 04:25:41,691 WARN L180 SmtUtils]: Spent 12.61 s on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2018-11-23 04:25:55,005 WARN L180 SmtUtils]: Spent 12.59 s on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2018-11-23 04:26:08,236 WARN L180 SmtUtils]: Spent 12.59 s on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2018-11-23 04:26:21,384 WARN L180 SmtUtils]: Spent 12.61 s on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2018-11-23 04:26:35,742 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2018-11-23 04:26:39,064 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2018-11-23 04:26:39,527 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2018-11-23 04:26:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:26:54,308 INFO L93 Difference]: Finished difference Result 542 states and 693 transitions. [2018-11-23 04:26:54,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-11-23 04:26:54,309 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 76 [2018-11-23 04:26:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:26:54,312 INFO L225 Difference]: With dead ends: 542 [2018-11-23 04:26:54,312 INFO L226 Difference]: Without dead ends: 393 [2018-11-23 04:26:54,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6071 ImplicationChecksByTransitivity, 287.7s TimeCoverageRelationStatistics Valid=2339, Invalid=20302, Unknown=9, NotChecked=0, Total=22650 [2018-11-23 04:26:54,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-11-23 04:26:54,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 281. [2018-11-23 04:26:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-23 04:26:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 374 transitions. [2018-11-23 04:26:54,348 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 374 transitions. Word has length 76 [2018-11-23 04:26:54,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:26:54,348 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 374 transitions. [2018-11-23 04:26:54,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-23 04:26:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 374 transitions. [2018-11-23 04:26:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 04:26:54,349 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:26:54,349 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:26:54,349 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:26:54,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:54,349 INFO L82 PathProgramCache]: Analyzing trace with hash -99437852, now seen corresponding path program 1 times [2018-11-23 04:26:54,350 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 04:26:54,350 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 04:26:54,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:26:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:26:54,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:26:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 04:26:54,419 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 04:26:54,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:26:54,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:26:54,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 04:26:54,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 04:26:54,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:26:54,421 INFO L87 Difference]: Start difference. First operand 281 states and 374 transitions. Second operand 4 states. [2018-11-23 04:26:54,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:26:54,443 INFO L93 Difference]: Finished difference Result 521 states and 699 transitions. [2018-11-23 04:26:54,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 04:26:54,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-23 04:26:54,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:26:54,445 INFO L225 Difference]: With dead ends: 521 [2018-11-23 04:26:54,445 INFO L226 Difference]: Without dead ends: 272 [2018-11-23 04:26:54,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:26:54,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-11-23 04:26:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 267. [2018-11-23 04:26:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-23 04:26:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 340 transitions. [2018-11-23 04:26:54,468 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 340 transitions. Word has length 65 [2018-11-23 04:26:54,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:26:54,468 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 340 transitions. [2018-11-23 04:26:54,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 04:26:54,468 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 340 transitions. [2018-11-23 04:26:54,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 04:26:54,469 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:26:54,469 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:26:54,469 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:26:54,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:54,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1212876293, now seen corresponding path program 2 times [2018-11-23 04:26:54,470 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 04:26:54,470 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_efa7eff8-47df-47eb-a325-577a56f33890/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 04:26:54,482 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 04:26:54,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 04:26:54,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:26:54,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:26:54,747 INFO L478 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 [2018-11-23 04:26:54,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:26:54,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:26:54,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-11-23 04:26:54,845 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:26:54,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:26:54,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 04:26:54,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:26:54,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:26:54,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-11-23 04:26:54,917 INFO L478 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 7 treesize of output 5 [2018-11-23 04:26:54,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 04:26:54,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:26:54,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:26:54,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:26:54,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-23 04:26:55,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 48 [2018-11-23 04:26:55,449 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 04:26:55,490 INFO L478 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 10 treesize of output 9 [2018-11-23 04:26:55,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:26:56,109 INFO L478 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 45 treesize of output 58 [2018-11-23 04:26:56,116 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-11-23 04:26:56,126 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:26:56,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2018-11-23 04:26:56,137 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:26:56,338 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:26:59,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 49 [2018-11-23 04:26:59,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:26:59,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-11-23 04:26:59,220 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:27:00,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:27:00,167 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:27:00,209 INFO L303 Elim1Store]: Index analysis took 200 ms [2018-11-23 04:27:00,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 63 [2018-11-23 04:27:00,279 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-23 04:27:01,225 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 04:27:05,474 INFO L303 Elim1Store]: Index analysis took 171 ms [2018-11-23 04:27:05,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 55 [2018-11-23 04:27:05,747 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 04:27:05,747 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_67 |__ldv_list_add_#in~new.offset| __ldv_list_add_~next.offset) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:219) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:210) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.convert(DerPreprocessor.java:142) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:211) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) 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:123) 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) [2018-11-23 04:27:05,750 INFO L168 Benchmark]: Toolchain (without parser) took 381889.62 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.7 MB). Free memory was 943.8 MB in the beginning and 1.2 GB in the end (delta: -251.4 MB). Peak memory consumption was 66.4 MB. Max. memory is 11.5 GB. [2018-11-23 04:27:05,750 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:27:05,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -196.7 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. [2018-11-23 04:27:05,750 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.87 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. [2018-11-23 04:27:05,751 INFO L168 Benchmark]: Boogie Preprocessor took 27.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:27:05,751 INFO L168 Benchmark]: RCFGBuilder took 404.98 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: 40.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. [2018-11-23 04:27:05,751 INFO L168 Benchmark]: TraceAbstraction took 381002.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -101.7 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. [2018-11-23 04:27:05,752 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 428.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -196.7 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.87 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 27.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 404.98 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: 40.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 381002.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -101.7 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_67 |__ldv_list_add_#in~new.offset| __ldv_list_add_~next.offset) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_67 |__ldv_list_add_#in~new.offset| __ldv_list_add_~next.offset): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...