./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-sets/test_mutex_double_lock_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6b07fda4-a2d0-4eb3-9706-d83da9e3a7da/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6b07fda4-a2d0-4eb3-9706-d83da9e3a7da/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6b07fda4-a2d0-4eb3-9706-d83da9e3a7da/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6b07fda4-a2d0-4eb3-9706-d83da9e3a7da/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex_double_lock_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6b07fda4-a2d0-4eb3-9706-d83da9e3a7da/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6b07fda4-a2d0-4eb3-9706-d83da9e3a7da/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 ad29ac750d7eee43ee0f4c2b7f90b5e7c26b142d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:25:08,949 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:25:08,950 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:25:08,956 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:25:08,956 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:25:08,957 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:25:08,957 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:25:08,958 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:25:08,959 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:25:08,959 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:25:08,960 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:25:08,960 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:25:08,960 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:25:08,961 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:25:08,961 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:25:08,962 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:25:08,962 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:25:08,963 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:25:08,964 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:25:08,965 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:25:08,965 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:25:08,966 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:25:08,967 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:25:08,967 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:25:08,967 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:25:08,967 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:25:08,968 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:25:08,968 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:25:08,969 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:25:08,969 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:25:08,969 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:25:08,970 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:25:08,970 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:25:08,970 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:25:08,970 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:25:08,971 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:25:08,971 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6b07fda4-a2d0-4eb3-9706-d83da9e3a7da/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:25:08,978 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:25:08,978 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:25:08,979 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:25:08,979 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:25:08,979 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:25:08,979 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:25:08,979 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:25:08,979 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:25:08,979 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:25:08,980 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:25:08,980 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:25:08,980 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:25:08,980 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:25:08,980 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:25:08,980 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:25:08,981 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:25:08,981 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:25:08,981 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:25:08,981 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:25:08,981 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:25:08,981 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:25:08,981 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:25:08,982 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:25:08,982 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:25:08,982 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:25:08,982 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:25:08,982 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:25:08,982 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:25:08,982 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:25:08,982 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:25:08,983 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:25:08,983 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:25:08,983 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:25:08,983 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:25:08,983 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:25:08,983 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:25:08,983 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_6b07fda4-a2d0-4eb3-9706-d83da9e3a7da/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 -> ad29ac750d7eee43ee0f4c2b7f90b5e7c26b142d [2018-12-09 19:25:09,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:25:09,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:25:09,013 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:25:09,014 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:25:09,015 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:25:09,015 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6b07fda4-a2d0-4eb3-9706-d83da9e3a7da/bin-2019/utaipan/../../sv-benchmarks/c/ldv-sets/test_mutex_double_lock_false-unreach-call_true-termination.i [2018-12-09 19:25:09,060 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b07fda4-a2d0-4eb3-9706-d83da9e3a7da/bin-2019/utaipan/data/03105166b/627483a3674b4cad93d7f67766e4110e/FLAG6b43433af [2018-12-09 19:25:09,477 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:25:09,477 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6b07fda4-a2d0-4eb3-9706-d83da9e3a7da/sv-benchmarks/c/ldv-sets/test_mutex_double_lock_false-unreach-call_true-termination.i [2018-12-09 19:25:09,483 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b07fda4-a2d0-4eb3-9706-d83da9e3a7da/bin-2019/utaipan/data/03105166b/627483a3674b4cad93d7f67766e4110e/FLAG6b43433af [2018-12-09 19:25:09,492 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6b07fda4-a2d0-4eb3-9706-d83da9e3a7da/bin-2019/utaipan/data/03105166b/627483a3674b4cad93d7f67766e4110e [2018-12-09 19:25:09,494 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:25:09,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:25:09,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:25:09,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:25:09,497 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:25:09,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:25:09" (1/1) ... [2018-12-09 19:25:09,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73559806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:09, skipping insertion in model container [2018-12-09 19:25:09,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:25:09" (1/1) ... [2018-12-09 19:25:09,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:25:09,523 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:25:09,708 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:25:09,745 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:25:09,780 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:25:09,806 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:25:09,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:09 WrapperNode [2018-12-09 19:25:09,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:25:09,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:25:09,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:25:09,807 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:25:09,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:09" (1/1) ... [2018-12-09 19:25:09,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:09" (1/1) ... [2018-12-09 19:25:09,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:25:09,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:25:09,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:25:09,825 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:25:09,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:09" (1/1) ... [2018-12-09 19:25:09,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:09" (1/1) ... [2018-12-09 19:25:09,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:09" (1/1) ... [2018-12-09 19:25:09,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:09" (1/1) ... [2018-12-09 19:25:09,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:09" (1/1) ... [2018-12-09 19:25:09,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:09" (1/1) ... [2018-12-09 19:25:09,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:09" (1/1) ... [2018-12-09 19:25:09,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:25:09,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:25:09,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:25:09,847 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:25:09,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b07fda4-a2d0-4eb3-9706-d83da9e3a7da/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-12-09 19:25:09,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:25:09,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-12-09 19:25:09,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-12-09 19:25:09,878 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2018-12-09 19:25:09,878 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2018-12-09 19:25:09,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_empty [2018-12-09 19:25:09,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_empty [2018-12-09 19:25:09,878 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2018-12-09 19:25:09,878 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2018-12-09 19:25:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2018-12-09 19:25:09,879 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2018-12-09 19:25:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2018-12-09 19:25:09,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2018-12-09 19:25:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:25:09,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:25:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2018-12-09 19:25:09,879 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2018-12-09 19:25:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:25:09,879 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:25:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 19:25:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2018-12-09 19:25:09,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2018-12-09 19:25:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2018-12-09 19:25:09,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2018-12-09 19:25:09,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 19:25:09,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_empty [2018-12-09 19:25:09,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_empty [2018-12-09 19:25:09,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:25:09,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 19:25:09,880 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-12-09 19:25:09,880 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-12-09 19:25:09,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2018-12-09 19:25:09,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2018-12-09 19:25:09,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2018-12-09 19:25:09,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2018-12-09 19:25:09,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-12-09 19:25:09,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-12-09 19:25:09,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_del [2018-12-09 19:25:09,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_del [2018-12-09 19:25:09,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:25:09,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:25:10,098 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:25:10,098 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 19:25:10,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:25:10 BoogieIcfgContainer [2018-12-09 19:25:10,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:25:10,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:25:10,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:25:10,100 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:25:10,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:25:09" (1/3) ... [2018-12-09 19:25:10,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9044d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:25:10, skipping insertion in model container [2018-12-09 19:25:10,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:09" (2/3) ... [2018-12-09 19:25:10,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9044d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:25:10, skipping insertion in model container [2018-12-09 19:25:10,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:25:10" (3/3) ... [2018-12-09 19:25:10,102 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_double_lock_false-unreach-call_true-termination.i [2018-12-09 19:25:10,107 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:25:10,112 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 19:25:10,120 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 19:25:10,137 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:25:10,137 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:25:10,138 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:25:10,138 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:25:10,138 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:25:10,138 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:25:10,138 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:25:10,138 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:25:10,148 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-12-09 19:25:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:25:10,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:10,152 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-12-09 19:25:10,154 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:10,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:10,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1594759354, now seen corresponding path program 1 times [2018-12-09 19:25:10,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:10,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:10,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 19:25:10,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:10,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:25:10,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:10,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 19:25:10,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 19:25:10,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 19:25:10,269 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 2 states. [2018-12-09 19:25:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:10,288 INFO L93 Difference]: Finished difference Result 188 states and 225 transitions. [2018-12-09 19:25:10,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 19:25:10,289 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-12-09 19:25:10,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:10,294 INFO L225 Difference]: With dead ends: 188 [2018-12-09 19:25:10,295 INFO L226 Difference]: Without dead ends: 92 [2018-12-09 19:25:10,297 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-12-09 19:25:10,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-09 19:25:10,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-09 19:25:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-09 19:25:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-12-09 19:25:10,323 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 30 [2018-12-09 19:25:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:10,324 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-12-09 19:25:10,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 19:25:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-12-09 19:25:10,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:25:10,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:10,325 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-12-09 19:25:10,326 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:10,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:10,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1879861572, now seen corresponding path program 1 times [2018-12-09 19:25:10,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:10,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:10,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 19:25:10,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:10,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:10,381 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:10,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:10,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:10,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:10,383 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 4 states. [2018-12-09 19:25:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:10,400 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2018-12-09 19:25:10,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:10,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-12-09 19:25:10,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:10,402 INFO L225 Difference]: With dead ends: 98 [2018-12-09 19:25:10,402 INFO L226 Difference]: Without dead ends: 96 [2018-12-09 19:25:10,403 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-12-09 19:25:10,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-09 19:25:10,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-09 19:25:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-09 19:25:10,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2018-12-09 19:25:10,411 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 30 [2018-12-09 19:25:10,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:10,411 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2018-12-09 19:25:10,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:10,412 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-12-09 19:25:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:25:10,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:10,412 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-12-09 19:25:10,412 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:10,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:10,413 INFO L82 PathProgramCache]: Analyzing trace with hash -305258267, now seen corresponding path program 1 times [2018-12-09 19:25:10,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:10,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:10,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 19:25:10,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:10,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:10,486 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:10,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:25:10,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:25:10,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:10,486 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 5 states. [2018-12-09 19:25:10,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:10,750 INFO L93 Difference]: Finished difference Result 257 states and 311 transitions. [2018-12-09 19:25:10,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:25:10,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-09 19:25:10,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:10,752 INFO L225 Difference]: With dead ends: 257 [2018-12-09 19:25:10,752 INFO L226 Difference]: Without dead ends: 175 [2018-12-09 19:25:10,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:25:10,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-09 19:25:10,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 140. [2018-12-09 19:25:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-09 19:25:10,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 168 transitions. [2018-12-09 19:25:10,770 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 168 transitions. Word has length 30 [2018-12-09 19:25:10,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:10,770 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 168 transitions. [2018-12-09 19:25:10,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:25:10,771 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 168 transitions. [2018-12-09 19:25:10,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 19:25:10,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:10,773 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-12-09 19:25:10,773 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:10,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:10,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1875239642, now seen corresponding path program 1 times [2018-12-09 19:25:10,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:10,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:10,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-09 19:25:10,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:10,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:25:10,827 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 79 with the following transitions: [2018-12-09 19:25:10,828 INFO L205 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-12-09 19:25:10,855 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:25:10,855 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:25:10,989 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 19:25:10,990 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-12-09 19:25:10,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:10,994 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 19:25:11,067 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 72.44% of their original sizes. [2018-12-09 19:25:11,067 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 19:25:11,125 INFO L418 sIntCurrentIteration]: We unified 77 AI predicates to 77 [2018-12-09 19:25:11,126 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 19:25:11,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:25:11,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2018-12-09 19:25:11,126 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:11,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:25:11,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:25:11,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:25:11,127 INFO L87 Difference]: Start difference. First operand 140 states and 168 transitions. Second operand 11 states. [2018-12-09 19:25:11,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:11,937 INFO L93 Difference]: Finished difference Result 257 states and 308 transitions. [2018-12-09 19:25:11,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:25:11,938 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2018-12-09 19:25:11,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:11,939 INFO L225 Difference]: With dead ends: 257 [2018-12-09 19:25:11,939 INFO L226 Difference]: Without dead ends: 149 [2018-12-09 19:25:11,940 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:25:11,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-09 19:25:11,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2018-12-09 19:25:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-09 19:25:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 170 transitions. [2018-12-09 19:25:11,949 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 170 transitions. Word has length 78 [2018-12-09 19:25:11,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:11,949 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 170 transitions. [2018-12-09 19:25:11,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:25:11,949 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 170 transitions. [2018-12-09 19:25:11,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 19:25:11,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:11,951 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-12-09 19:25:11,951 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:11,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:11,951 INFO L82 PathProgramCache]: Analyzing trace with hash 885640952, now seen corresponding path program 1 times [2018-12-09 19:25:11,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:11,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:11,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:11,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:11,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 19:25:12,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:12,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:25:12,087 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 79 with the following transitions: [2018-12-09 19:25:12,087 INFO L205 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-12-09 19:25:12,089 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:25:12,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:25:12,138 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:25:12,138 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-12-09 19:25:12,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:12,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:25:12,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:12,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b07fda4-a2d0-4eb3-9706-d83da9e3a7da/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-12-09 19:25:12,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:12,149 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:25:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:12,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:12,257 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-12-09 19:25:12,260 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-12-09 19:25:12,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,266 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-12-09 19:25:12,268 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-12-09 19:25:12,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,273 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-12-09 19:25:12,307 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-12-09 19:25:12,309 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-12-09 19:25:12,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,324 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-12-09 19:25:12,325 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-12-09 19:25:12,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,329 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-12-09 19:25:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 19:25:12,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:12,681 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-12-09 19:25:12,683 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-12-09 19:25:12,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,690 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-12-09 19:25:12,692 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-12-09 19:25:12,692 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,697 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2018-12-09 19:25:12,771 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-12-09 19:25:12,773 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-12-09 19:25:12,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,778 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-12-09 19:25:12,779 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-12-09 19:25:12,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,782 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2018-12-09 19:25:12,887 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-12-09 19:25:12,889 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-12-09 19:25:12,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,895 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-12-09 19:25:12,896 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-12-09 19:25:12,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,900 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,912 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-12-09 19:25:12,913 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-12-09 19:25:12,913 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,916 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,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 32 treesize of output 30 [2018-12-09 19:25:12,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 6 treesize of output 1 [2018-12-09 19:25:12,919 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,922 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:12,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 19:25:12,932 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:81, output treesize:49 [2018-12-09 19:25:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 19:25:13,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:25:13,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [13, 10] total 28 [2018-12-09 19:25:13,017 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:13,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:25:13,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:25:13,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2018-12-09 19:25:13,017 INFO L87 Difference]: Start difference. First operand 143 states and 170 transitions. Second operand 10 states. [2018-12-09 19:25:13,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:13,719 INFO L93 Difference]: Finished difference Result 323 states and 386 transitions. [2018-12-09 19:25:13,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 19:25:13,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-12-09 19:25:13,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:13,721 INFO L225 Difference]: With dead ends: 323 [2018-12-09 19:25:13,721 INFO L226 Difference]: Without dead ends: 209 [2018-12-09 19:25:13,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=361, Invalid=1361, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 19:25:13,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-09 19:25:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 146. [2018-12-09 19:25:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-09 19:25:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 169 transitions. [2018-12-09 19:25:13,742 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 169 transitions. Word has length 78 [2018-12-09 19:25:13,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:13,743 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 169 transitions. [2018-12-09 19:25:13,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:25:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 169 transitions. [2018-12-09 19:25:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 19:25:13,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:13,744 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-12-09 19:25:13,744 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:13,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:13,744 INFO L82 PathProgramCache]: Analyzing trace with hash 559822637, now seen corresponding path program 1 times [2018-12-09 19:25:13,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:13,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:13,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:13,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:13,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:25:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:25:13,809 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 19:25:13,831 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 19:25:13,832 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 19:25:13,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:25:13 BoogieIcfgContainer [2018-12-09 19:25:13,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:25:13,846 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:25:13,846 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:25:13,846 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:25:13,846 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:25:10" (3/4) ... [2018-12-09 19:25:13,848 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 19:25:13,854 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 19:25:13,854 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 19:25:13,887 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6b07fda4-a2d0-4eb3-9706-d83da9e3a7da/bin-2019/utaipan/witness.graphml [2018-12-09 19:25:13,887 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:25:13,888 INFO L168 Benchmark]: Toolchain (without parser) took 4393.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -87.8 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:25:13,888 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:25:13,889 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -134.5 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-12-09 19:25:13,889 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:25:13,889 INFO L168 Benchmark]: Boogie Preprocessor took 21.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:25:13,889 INFO L168 Benchmark]: RCFGBuilder took 251.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:25:13,889 INFO L168 Benchmark]: TraceAbstraction took 3746.76 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -2.8 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:25:13,890 INFO L168 Benchmark]: Witness Printer took 41.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:25:13,891 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -134.5 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 251.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3746.76 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -2.8 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. * Witness Printer took 41.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 656]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L652] struct ldv_list_head mutexes = { &(mutexes), &(mutexes) }; VAL [\old(mutexes)=null, \old(mutexes)=null, mutexes={19:0}] [L679] CALL foo() VAL [mutexes={19:0}] [L668] FCALL ldv_initialize() VAL [mutexes={19:0}] [L669] CALL, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [\old(size)=8, mutexes={19:0}] [L563] void *ptr = malloc(size); [L565] return ptr; VAL [\old(size)=8, \result={14:0}, malloc(size)={14:0}, mutexes={19:0}, ptr={14:0}, size=8] [L669] RET, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [ldv_successful_malloc(sizeof(struct mutex))={14:0}, mutexes={19:0}] [L669] struct mutex *m1 = ldv_successful_malloc(sizeof(struct mutex)); [L670] CALL, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [\old(size)=8, mutexes={19:0}] [L563] void *ptr = malloc(size); [L565] return ptr; VAL [\old(size)=8, \result={20:0}, malloc(size)={20:0}, mutexes={19:0}, ptr={20:0}, size=8] [L670] RET, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [ldv_successful_malloc(sizeof(struct mutex))={20:0}, m1={14:0}, mutexes={19:0}] [L670] struct mutex *m2 = ldv_successful_malloc(sizeof(struct mutex)); [L671] CALL mutex_lock(m1) VAL [m={14:0}, mutexes={19:0}] [L656] CALL ldv_is_in_set(m, &mutexes) VAL [e={14:0}, mutexes={19:0}, s={19:0}] [L641] struct ldv_list_element *m; [L642] EXPR (s)->next [L642] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L642] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [__mptr={19:0}, e={14:0}, e={14:0}, m={19:-4}, mutexes={19:0}, s={19:0}, s={19:0}] [L642] COND FALSE !(&m->list != (s)) VAL [__mptr={19:0}, e={14:0}, e={14:0}, m={19:-4}, mutexes={19:0}, s={19:0}, s={19:0}] [L647] return 0; VAL [\result=0, __mptr={19:0}, e={14:0}, e={14:0}, m={19:-4}, mutexes={19:0}, s={19:0}, s={19:0}] [L656] RET ldv_is_in_set(m, &mutexes) VAL [ldv_is_in_set(m, &mutexes)=0, m={14:0}, m={14:0}, mutexes={19:0}] [L656] COND FALSE !(ldv_is_in_set(m, &mutexes)) [L657] CALL ldv_set_add(m, &mutexes) VAL [mutexes={19:0}, new={14:0}, s={19:0}] [L623] CALL, EXPR ldv_is_in_set(new, s) VAL [e={14:0}, mutexes={19:0}, s={19:0}] [L641] struct ldv_list_element *m; [L642] EXPR (s)->next [L642] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L642] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [__mptr={19:0}, e={14:0}, e={14:0}, m={19:-4}, mutexes={19:0}, s={19:0}, s={19:0}] [L642] COND FALSE !(&m->list != (s)) VAL [__mptr={19:0}, e={14:0}, e={14:0}, m={19:-4}, mutexes={19:0}, s={19:0}, s={19:0}] [L647] return 0; VAL [\result=0, __mptr={19:0}, e={14:0}, e={14:0}, m={19:-4}, mutexes={19:0}, s={19:0}, s={19:0}] [L623] RET, EXPR ldv_is_in_set(new, s) VAL [ldv_is_in_set(new, s)=0, mutexes={19:0}, new={14:0}, new={14:0}, s={19:0}, s={19:0}] [L623] COND TRUE !ldv_is_in_set(new, s) [L624] struct ldv_list_element *le; VAL [mutexes={19:0}, new={14:0}, new={14:0}, s={19:0}, s={19:0}] [L625] CALL, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) VAL [\old(size)=12, mutexes={19:0}] [L563] void *ptr = malloc(size); [L565] return ptr; VAL [\old(size)=12, \result={16:0}, malloc(size)={16:0}, mutexes={19:0}, ptr={16:0}, size=12] [L625] RET, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) VAL [ldv_successful_malloc(sizeof(struct ldv_list_element))={16:0}, mutexes={19:0}, new={14:0}, new={14:0}, s={19:0}, s={19:0}] [L625] le = (struct ldv_list_element*)ldv_successful_malloc(sizeof(struct ldv_list_element)) [L626] le->e = new VAL [le={16:0}, mutexes={19:0}, new={14:0}, new={14:0}, s={19:0}, s={19:0}] [L627] CALL ldv_list_add(&le->list, s) VAL [head={19:0}, mutexes={19:0}, new={16:4}] [L595] EXPR head->next VAL [head={19:0}, head={19:0}, head->next={19:0}, mutexes={19:0}, new={16:4}, new={16:4}] [L595] CALL __ldv_list_add(new, head, head->next) VAL [mutexes={19:0}, new={16:4}, next={19:0}, prev={19:0}] [L583] next->prev = new [L584] new->next = next [L585] new->prev = prev [L586] prev->next = new VAL [mutexes={19:0}, new={16:4}, new={16:4}, next={19:0}, next={19:0}, prev={19:0}, prev={19:0}] [L595] RET __ldv_list_add(new, head, head->next) VAL [head={19:0}, head={19:0}, head->next={19:0}, mutexes={19:0}, new={16:4}, new={16:4}] [L627] RET ldv_list_add(&le->list, s) VAL [le={16:0}, mutexes={19:0}, new={14:0}, new={14:0}, s={19:0}, s={19:0}] [L657] RET ldv_set_add(m, &mutexes) VAL [m={14:0}, m={14:0}, mutexes={19:0}] [L671] RET mutex_lock(m1) VAL [m1={14:0}, m2={20:0}, mutexes={19:0}] [L672] CALL mutex_lock(m1) VAL [m={14:0}, mutexes={19:0}] [L656] CALL ldv_is_in_set(m, &mutexes) VAL [e={14:0}, mutexes={19:0}, s={19:0}] [L641] struct ldv_list_element *m; [L642] EXPR (s)->next [L642] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L642] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [__mptr={16:4}, e={14:0}, e={14:0}, m={16:0}, mutexes={19:0}, s={19:0}, s={19:0}] [L642] COND TRUE &m->list != (s) [L643] EXPR m->e VAL [__mptr={16:4}, e={14:0}, e={14:0}, m={16:0}, m->e={14:0}, mutexes={19:0}, s={19:0}, s={19:0}] [L643] COND TRUE m->e == e [L644] return 1; VAL [\result=1, __mptr={16:4}, e={14:0}, e={14:0}, m={16:0}, mutexes={19:0}, s={19:0}, s={19:0}] [L656] RET ldv_is_in_set(m, &mutexes) VAL [ldv_is_in_set(m, &mutexes)=1, m={14:0}, m={14:0}, mutexes={19:0}] [L656] COND TRUE ldv_is_in_set(m, &mutexes) [L656] __VERIFIER_error() VAL [m={14:0}, m={14:0}, mutexes={19:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 101 locations, 3 error locations. UNSAFE Result, 3.7s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 511 SDtfs, 440 SDslu, 1029 SDs, 0 SdLazy, 865 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 283 GetRequests, 218 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9074964717821861 AbsIntWeakeningRatio, 1.7662337662337662 AbsIntAvgWeakeningVarsNumRemoved, 3.6363636363636362 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 104 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 196951 SizeOfPredicates, 20 NumberOfNonLiveVariables, 439 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 198/255 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...