./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 01:52:38,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 01:52:38,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 01:52:38,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 01:52:38,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 01:52:38,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 01:52:38,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 01:52:38,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 01:52:38,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 01:52:38,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 01:52:38,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 01:52:38,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 01:52:38,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 01:52:38,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 01:52:38,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 01:52:38,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 01:52:38,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 01:52:38,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 01:52:38,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 01:52:38,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 01:52:38,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 01:52:38,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 01:52:38,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 01:52:38,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 01:52:38,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 01:52:38,833 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 01:52:38,834 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 01:52:38,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 01:52:38,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 01:52:38,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 01:52:38,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 01:52:38,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 01:52:38,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 01:52:38,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 01:52:38,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 01:52:38,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 01:52:38,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 01:52:38,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 01:52:38,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 01:52:38,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 01:52:38,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 01:52:38,863 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-23 01:52:38,919 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 01:52:38,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 01:52:38,922 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 01:52:38,923 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 01:52:38,931 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 01:52:38,932 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 01:52:38,932 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 01:52:38,933 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 01:52:38,933 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 01:52:38,933 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 01:52:38,935 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 01:52:38,935 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 01:52:38,936 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 01:52:38,936 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 01:52:38,936 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 01:52:38,937 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 01:52:38,937 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 01:52:38,937 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 01:52:38,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 01:52:38,939 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 01:52:38,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 01:52:38,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 01:52:38,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 01:52:38,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 01:52:38,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 01:52:38,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 01:52:38,943 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 01:52:38,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 01:52:38,944 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 01:52:38,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 01:52:38,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 01:52:38,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 01:52:38,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 01:52:38,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 01:52:38,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 01:52:38,946 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 01:52:38,946 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 01:52:38,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 01:52:38,947 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 01:52:38,947 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 01:52:38,948 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 01:52:38,948 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V 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(reach_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 -> 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 [2021-11-23 01:52:39,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 01:52:39,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 01:52:39,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 01:52:39,336 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 01:52:39,337 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 01:52:39,339 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2021-11-23 01:52:39,417 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/data/f24ae1b6d/abeca788fd264ecbac98293965c12730/FLAG408e9bdc6 [2021-11-23 01:52:39,959 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 01:52:39,960 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2021-11-23 01:52:39,974 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/data/f24ae1b6d/abeca788fd264ecbac98293965c12730/FLAG408e9bdc6 [2021-11-23 01:52:40,260 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/data/f24ae1b6d/abeca788fd264ecbac98293965c12730 [2021-11-23 01:52:40,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 01:52:40,265 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 01:52:40,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 01:52:40,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 01:52:40,273 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 01:52:40,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:40" (1/1) ... [2021-11-23 01:52:40,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e915bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:40, skipping insertion in model container [2021-11-23 01:52:40,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:40" (1/1) ... [2021-11-23 01:52:40,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 01:52:40,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 01:52:40,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2021-11-23 01:52:40,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2021-11-23 01:52:40,683 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:52:40,696 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 01:52:40,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2021-11-23 01:52:40,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2021-11-23 01:52:40,763 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:52:40,805 INFO L208 MainTranslator]: Completed translation [2021-11-23 01:52:40,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:40 WrapperNode [2021-11-23 01:52:40,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 01:52:40,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 01:52:40,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 01:52:40,809 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 01:52:40,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:40" (1/1) ... [2021-11-23 01:52:40,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:40" (1/1) ... [2021-11-23 01:52:40,896 INFO L137 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 417 [2021-11-23 01:52:40,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 01:52:40,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 01:52:40,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 01:52:40,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 01:52:40,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:40" (1/1) ... [2021-11-23 01:52:40,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:40" (1/1) ... [2021-11-23 01:52:40,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:40" (1/1) ... [2021-11-23 01:52:40,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:40" (1/1) ... [2021-11-23 01:52:40,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:40" (1/1) ... [2021-11-23 01:52:40,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:40" (1/1) ... [2021-11-23 01:52:40,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:40" (1/1) ... [2021-11-23 01:52:40,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 01:52:40,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 01:52:40,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 01:52:40,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 01:52:40,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:40" (1/1) ... [2021-11-23 01:52:40,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 01:52:41,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:52:41,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 01:52:41,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 01:52:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 01:52:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-11-23 01:52:41,064 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-11-23 01:52:41,065 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2021-11-23 01:52:41,065 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2021-11-23 01:52:41,065 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-11-23 01:52:41,065 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-11-23 01:52:41,066 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-11-23 01:52:41,066 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-11-23 01:52:41,066 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-11-23 01:52:41,066 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-11-23 01:52:41,067 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-11-23 01:52:41,067 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-11-23 01:52:41,067 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-11-23 01:52:41,067 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-11-23 01:52:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 01:52:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-11-23 01:52:41,068 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-11-23 01:52:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 01:52:41,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 01:52:41,069 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-11-23 01:52:41,069 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-11-23 01:52:41,195 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 01:52:41,197 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 01:52:41,793 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 01:52:41,975 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 01:52:41,975 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-11-23 01:52:41,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:41 BoogieIcfgContainer [2021-11-23 01:52:41,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 01:52:41,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 01:52:41,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 01:52:41,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 01:52:41,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:52:40" (1/3) ... [2021-11-23 01:52:41,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5747414b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:52:41, skipping insertion in model container [2021-11-23 01:52:41,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:40" (2/3) ... [2021-11-23 01:52:41,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5747414b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:52:41, skipping insertion in model container [2021-11-23 01:52:41,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:41" (3/3) ... [2021-11-23 01:52:41,993 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2021-11-23 01:52:42,006 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 01:52:42,006 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-23 01:52:42,092 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 01:52:42,101 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 01:52:42,101 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-23 01:52:42,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 90 states have internal predecessors, (129), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2021-11-23 01:52:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 01:52:42,142 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:52:42,143 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:52:42,143 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:52:42,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:52:42,157 INFO L85 PathProgramCache]: Analyzing trace with hash -715024938, now seen corresponding path program 1 times [2021-11-23 01:52:42,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:52:42,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796458450] [2021-11-23 01:52:42,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:52:42,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:52:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:52:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:52:42,512 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:52:42,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796458450] [2021-11-23 01:52:42,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796458450] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:52:42,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:52:42,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 01:52:42,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016011818] [2021-11-23 01:52:42,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:52:42,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:52:42,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:52:42,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:52:42,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:52:42,571 INFO L87 Difference]: Start difference. First operand has 118 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 90 states have internal predecessors, (129), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 01:52:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:52:42,763 INFO L93 Difference]: Finished difference Result 269 states and 390 transitions. [2021-11-23 01:52:42,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:52:42,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2021-11-23 01:52:42,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:52:42,780 INFO L225 Difference]: With dead ends: 269 [2021-11-23 01:52:42,780 INFO L226 Difference]: Without dead ends: 151 [2021-11-23 01:52:42,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:52:42,790 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 138 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 01:52:42,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 203 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:52:42,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-11-23 01:52:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2021-11-23 01:52:42,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 111 states have (on average 1.4054054054054055) internal successors, (156), 114 states have internal predecessors, (156), 24 states have call successors, (24), 11 states have call predecessors, (24), 10 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2021-11-23 01:52:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 202 transitions. [2021-11-23 01:52:42,872 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 202 transitions. Word has length 28 [2021-11-23 01:52:42,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:52:42,873 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 202 transitions. [2021-11-23 01:52:42,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 01:52:42,874 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 202 transitions. [2021-11-23 01:52:42,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-23 01:52:42,878 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:52:42,878 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:52:42,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 01:52:42,879 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:52:42,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:52:42,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1323713014, now seen corresponding path program 1 times [2021-11-23 01:52:42,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:52:42,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957111382] [2021-11-23 01:52:42,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:52:42,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:52:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:52:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:52:42,982 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:52:42,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957111382] [2021-11-23 01:52:42,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957111382] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:52:42,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:52:42,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 01:52:42,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95660515] [2021-11-23 01:52:42,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:52:42,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:52:42,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:52:42,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:52:42,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:52:42,996 INFO L87 Difference]: Start difference. First operand 147 states and 202 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 01:52:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:52:43,156 INFO L93 Difference]: Finished difference Result 303 states and 419 transitions. [2021-11-23 01:52:43,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:52:43,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2021-11-23 01:52:43,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:52:43,166 INFO L225 Difference]: With dead ends: 303 [2021-11-23 01:52:43,168 INFO L226 Difference]: Without dead ends: 222 [2021-11-23 01:52:43,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:52:43,174 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 136 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 01:52:43,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 188 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:52:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-11-23 01:52:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 218. [2021-11-23 01:52:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 171 states have (on average 1.3859649122807018) internal successors, (237), 174 states have internal predecessors, (237), 31 states have call successors, (31), 15 states have call predecessors, (31), 14 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2021-11-23 01:52:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 297 transitions. [2021-11-23 01:52:43,245 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 297 transitions. Word has length 29 [2021-11-23 01:52:43,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:52:43,246 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 297 transitions. [2021-11-23 01:52:43,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 01:52:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 297 transitions. [2021-11-23 01:52:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-23 01:52:43,258 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:52:43,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:52:43,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 01:52:43,259 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:52:43,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:52:43,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1288342113, now seen corresponding path program 1 times [2021-11-23 01:52:43,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:52:43,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103326275] [2021-11-23 01:52:43,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:52:43,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:52:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:52:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:52:43,420 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:52:43,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103326275] [2021-11-23 01:52:43,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103326275] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:52:43,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:52:43,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 01:52:43,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246688376] [2021-11-23 01:52:43,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:52:43,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:52:43,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:52:43,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:52:43,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:52:43,427 INFO L87 Difference]: Start difference. First operand 218 states and 297 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 01:52:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:52:43,573 INFO L93 Difference]: Finished difference Result 458 states and 625 transitions. [2021-11-23 01:52:43,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:52:43,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2021-11-23 01:52:43,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:52:43,581 INFO L225 Difference]: With dead ends: 458 [2021-11-23 01:52:43,581 INFO L226 Difference]: Without dead ends: 306 [2021-11-23 01:52:43,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:52:43,594 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 46 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 01:52:43,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 261 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:52:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-11-23 01:52:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 292. [2021-11-23 01:52:43,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 234 states have (on average 1.376068376068376) internal successors, (322), 239 states have internal predecessors, (322), 37 states have call successors, (37), 20 states have call predecessors, (37), 19 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2021-11-23 01:52:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 394 transitions. [2021-11-23 01:52:43,656 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 394 transitions. Word has length 30 [2021-11-23 01:52:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:52:43,656 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 394 transitions. [2021-11-23 01:52:43,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 01:52:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 394 transitions. [2021-11-23 01:52:43,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 01:52:43,659 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:52:43,659 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:52:43,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 01:52:43,660 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:52:43,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:52:43,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1485955618, now seen corresponding path program 1 times [2021-11-23 01:52:43,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:52:43,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075164559] [2021-11-23 01:52:43,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:52:43,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:52:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:52:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:52:43,805 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:52:43,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075164559] [2021-11-23 01:52:43,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075164559] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:52:43,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:52:43,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 01:52:43,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518794973] [2021-11-23 01:52:43,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:52:43,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 01:52:43,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:52:43,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 01:52:43,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 01:52:43,810 INFO L87 Difference]: Start difference. First operand 292 states and 394 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-23 01:52:44,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:52:44,345 INFO L93 Difference]: Finished difference Result 565 states and 786 transitions. [2021-11-23 01:52:44,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 01:52:44,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2021-11-23 01:52:44,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:52:44,354 INFO L225 Difference]: With dead ends: 565 [2021-11-23 01:52:44,354 INFO L226 Difference]: Without dead ends: 505 [2021-11-23 01:52:44,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-23 01:52:44,357 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 401 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 01:52:44,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 448 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 01:52:44,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-11-23 01:52:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 494. [2021-11-23 01:52:44,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 371 states have (on average 1.3477088948787062) internal successors, (500), 379 states have internal predecessors, (500), 78 states have call successors, (78), 44 states have call predecessors, (78), 43 states have return successors, (94), 71 states have call predecessors, (94), 76 states have call successors, (94) [2021-11-23 01:52:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 672 transitions. [2021-11-23 01:52:44,418 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 672 transitions. Word has length 34 [2021-11-23 01:52:44,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:52:44,418 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 672 transitions. [2021-11-23 01:52:44,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-23 01:52:44,419 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 672 transitions. [2021-11-23 01:52:44,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 01:52:44,422 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:52:44,422 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:52:44,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 01:52:44,423 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:52:44,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:52:44,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2063684072, now seen corresponding path program 1 times [2021-11-23 01:52:44,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:52:44,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875847267] [2021-11-23 01:52:44,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:52:44,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:52:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:52:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 01:52:44,482 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:52:44,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875847267] [2021-11-23 01:52:44,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875847267] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:52:44,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:52:44,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 01:52:44,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888855363] [2021-11-23 01:52:44,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:52:44,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:52:44,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:52:44,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:52:44,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:52:44,486 INFO L87 Difference]: Start difference. First operand 494 states and 672 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 01:52:44,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:52:44,579 INFO L93 Difference]: Finished difference Result 657 states and 890 transitions. [2021-11-23 01:52:44,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:52:44,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 43 [2021-11-23 01:52:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:52:44,586 INFO L225 Difference]: With dead ends: 657 [2021-11-23 01:52:44,586 INFO L226 Difference]: Without dead ends: 499 [2021-11-23 01:52:44,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:52:44,588 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 32 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 01:52:44,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 293 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:52:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2021-11-23 01:52:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 488. [2021-11-23 01:52:44,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 365 states have (on average 1.3315068493150686) internal successors, (486), 373 states have internal predecessors, (486), 78 states have call successors, (78), 44 states have call predecessors, (78), 43 states have return successors, (94), 71 states have call predecessors, (94), 76 states have call successors, (94) [2021-11-23 01:52:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 658 transitions. [2021-11-23 01:52:44,640 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 658 transitions. Word has length 43 [2021-11-23 01:52:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:52:44,640 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 658 transitions. [2021-11-23 01:52:44,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 01:52:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 658 transitions. [2021-11-23 01:52:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-23 01:52:44,644 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:52:44,644 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2021-11-23 01:52:44,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 01:52:44,645 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:52:44,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:52:44,646 INFO L85 PathProgramCache]: Analyzing trace with hash 87900133, now seen corresponding path program 1 times [2021-11-23 01:52:44,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:52:44,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994028241] [2021-11-23 01:52:44,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:52:44,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:52:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:52:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 01:52:44,695 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:52:44,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994028241] [2021-11-23 01:52:44,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994028241] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:52:44,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:52:44,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 01:52:44,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091272003] [2021-11-23 01:52:44,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:52:44,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:52:44,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:52:44,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:52:44,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:52:44,698 INFO L87 Difference]: Start difference. First operand 488 states and 658 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-23 01:52:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:52:44,817 INFO L93 Difference]: Finished difference Result 737 states and 982 transitions. [2021-11-23 01:52:44,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:52:44,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2021-11-23 01:52:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:52:44,827 INFO L225 Difference]: With dead ends: 737 [2021-11-23 01:52:44,827 INFO L226 Difference]: Without dead ends: 534 [2021-11-23 01:52:44,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:52:44,830 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 122 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 01:52:44,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 186 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:52:44,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-11-23 01:52:44,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2021-11-23 01:52:44,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 404 states have (on average 1.3094059405940595) internal successors, (529), 412 states have internal predecessors, (529), 82 states have call successors, (82), 47 states have call predecessors, (82), 46 states have return successors, (98), 75 states have call predecessors, (98), 80 states have call successors, (98) [2021-11-23 01:52:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 709 transitions. [2021-11-23 01:52:44,884 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 709 transitions. Word has length 46 [2021-11-23 01:52:44,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:52:44,884 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 709 transitions. [2021-11-23 01:52:44,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-23 01:52:44,885 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 709 transitions. [2021-11-23 01:52:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-23 01:52:44,888 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:52:44,888 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:52:44,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 01:52:44,889 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:52:44,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:52:44,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1877600957, now seen corresponding path program 1 times [2021-11-23 01:52:44,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:52:44,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380455448] [2021-11-23 01:52:44,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:52:44,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:52:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:52:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-23 01:52:45,005 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:52:45,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380455448] [2021-11-23 01:52:45,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380455448] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:52:45,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:52:45,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 01:52:45,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990220129] [2021-11-23 01:52:45,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:52:45,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 01:52:45,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:52:45,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 01:52:45,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 01:52:45,009 INFO L87 Difference]: Start difference. First operand 534 states and 709 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 01:52:45,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:52:45,203 INFO L93 Difference]: Finished difference Result 574 states and 756 transitions. [2021-11-23 01:52:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 01:52:45,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2021-11-23 01:52:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:52:45,210 INFO L225 Difference]: With dead ends: 574 [2021-11-23 01:52:45,210 INFO L226 Difference]: Without dead ends: 571 [2021-11-23 01:52:45,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 01:52:45,212 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 232 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 01:52:45,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 184 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:52:45,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-11-23 01:52:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 533. [2021-11-23 01:52:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 404 states have (on average 1.3044554455445545) internal successors, (527), 411 states have internal predecessors, (527), 81 states have call successors, (81), 47 states have call predecessors, (81), 46 states have return successors, (98), 75 states have call predecessors, (98), 80 states have call successors, (98) [2021-11-23 01:52:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 706 transitions. [2021-11-23 01:52:45,283 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 706 transitions. Word has length 47 [2021-11-23 01:52:45,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:52:45,284 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 706 transitions. [2021-11-23 01:52:45,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 01:52:45,285 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 706 transitions. [2021-11-23 01:52:45,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-23 01:52:45,286 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:52:45,287 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:52:45,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 01:52:45,287 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:52:45,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:52:45,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1923326440, now seen corresponding path program 1 times [2021-11-23 01:52:45,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:52:45,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498576101] [2021-11-23 01:52:45,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:52:45,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:52:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:52:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-23 01:52:45,463 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:52:45,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498576101] [2021-11-23 01:52:45,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498576101] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:52:45,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340163418] [2021-11-23 01:52:45,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:52:45,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:52:45,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:52:45,469 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:52:45,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 01:52:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:52:45,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 01:52:45,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:52:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:52:46,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 01:52:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-23 01:52:46,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340163418] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 01:52:46,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [471487129] [2021-11-23 01:52:46,478 INFO L159 IcfgInterpreter]: Started Sifa with 40 locations of interest [2021-11-23 01:52:46,479 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 01:52:46,485 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 01:52:46,492 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 01:52:46,493 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 01:52:49,055 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 75 for LOIs [2021-11-23 01:52:49,071 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 90 for LOIs [2021-11-23 01:52:49,092 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify_threads with input of size 196 for LOIs [2021-11-23 01:52:50,355 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 01:53:00,245 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9652#(and (= ~t1_pc~0 0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (= ~t1_st~0 0) (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (= ~m_i~0 0) (not (= ~c_num_read~0 ~p_num_write~0)) (<= 0 (+ ~q_buf_0~0 2147483648)) (= ~p_dw_pc~0 1) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~q_buf_0~0) (= ~local~0 0) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~p_last_write~0 2147483647) (= ~E_M~0 2) (= ~a_t~0 0) (= ~E_1~0 2) (= ~M_E~0 2) (<= 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))' at error location [2021-11-23 01:53:00,245 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 01:53:00,245 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 01:53:00,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2021-11-23 01:53:00,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230106011] [2021-11-23 01:53:00,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 01:53:00,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 01:53:00,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:53:00,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 01:53:00,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2021-11-23 01:53:00,248 INFO L87 Difference]: Start difference. First operand 533 states and 706 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-11-23 01:53:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:53:00,599 INFO L93 Difference]: Finished difference Result 976 states and 1274 transitions. [2021-11-23 01:53:00,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 01:53:00,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 48 [2021-11-23 01:53:00,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:53:00,608 INFO L225 Difference]: With dead ends: 976 [2021-11-23 01:53:00,609 INFO L226 Difference]: Without dead ends: 973 [2021-11-23 01:53:00,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 109 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2021-11-23 01:53:00,612 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 286 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 01:53:00,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 627 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 01:53:00,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-11-23 01:53:00,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 742. [2021-11-23 01:53:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 581 states have (on average 1.3080895008605853) internal successors, (760), 590 states have internal predecessors, (760), 100 states have call successors, (100), 60 states have call predecessors, (100), 59 states have return successors, (117), 92 states have call predecessors, (117), 99 states have call successors, (117) [2021-11-23 01:53:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 977 transitions. [2021-11-23 01:53:00,684 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 977 transitions. Word has length 48 [2021-11-23 01:53:00,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:53:00,685 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 977 transitions. [2021-11-23 01:53:00,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-11-23 01:53:00,685 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 977 transitions. [2021-11-23 01:53:00,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-23 01:53:00,688 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:53:00,688 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1] [2021-11-23 01:53:00,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 01:53:00,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:53:00,907 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:53:00,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:53:00,908 INFO L85 PathProgramCache]: Analyzing trace with hash -153963260, now seen corresponding path program 1 times [2021-11-23 01:53:00,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:53:00,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821940385] [2021-11-23 01:53:00,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:53:00,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:53:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:53:01,009 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 01:53:01,009 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:53:01,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821940385] [2021-11-23 01:53:01,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821940385] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:53:01,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:53:01,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 01:53:01,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447447263] [2021-11-23 01:53:01,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:53:01,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 01:53:01,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:53:01,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 01:53:01,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 01:53:01,013 INFO L87 Difference]: Start difference. First operand 742 states and 977 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-23 01:53:01,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:53:01,364 INFO L93 Difference]: Finished difference Result 1161 states and 1569 transitions. [2021-11-23 01:53:01,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 01:53:01,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 59 [2021-11-23 01:53:01,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:53:01,372 INFO L225 Difference]: With dead ends: 1161 [2021-11-23 01:53:01,372 INFO L226 Difference]: Without dead ends: 900 [2021-11-23 01:53:01,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-23 01:53:01,377 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 225 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 01:53:01,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 338 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 01:53:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2021-11-23 01:53:01,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 886. [2021-11-23 01:53:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 677 states have (on average 1.2968980797636631) internal successors, (878), 688 states have internal predecessors, (878), 130 states have call successors, (130), 78 states have call predecessors, (130), 77 states have return successors, (159), 120 states have call predecessors, (159), 129 states have call successors, (159) [2021-11-23 01:53:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1167 transitions. [2021-11-23 01:53:01,469 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1167 transitions. Word has length 59 [2021-11-23 01:53:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:53:01,470 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 1167 transitions. [2021-11-23 01:53:01,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-23 01:53:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1167 transitions. [2021-11-23 01:53:01,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-23 01:53:01,475 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:53:01,475 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2021-11-23 01:53:01,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 01:53:01,475 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:53:01,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:53:01,476 INFO L85 PathProgramCache]: Analyzing trace with hash -597725691, now seen corresponding path program 1 times [2021-11-23 01:53:01,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:53:01,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348632217] [2021-11-23 01:53:01,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:53:01,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:53:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:53:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 01:53:01,545 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:53:01,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348632217] [2021-11-23 01:53:01,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348632217] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:53:01,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:53:01,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 01:53:01,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493635453] [2021-11-23 01:53:01,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:53:01,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:53:01,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:53:01,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:53:01,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:53:01,547 INFO L87 Difference]: Start difference. First operand 886 states and 1167 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 01:53:01,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:53:01,657 INFO L93 Difference]: Finished difference Result 1327 states and 1773 transitions. [2021-11-23 01:53:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:53:01,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2021-11-23 01:53:01,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:53:01,666 INFO L225 Difference]: With dead ends: 1327 [2021-11-23 01:53:01,666 INFO L226 Difference]: Without dead ends: 973 [2021-11-23 01:53:01,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:53:01,669 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 28 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 01:53:01,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 289 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 01:53:01,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-11-23 01:53:01,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 917. [2021-11-23 01:53:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 702 states have (on average 1.3005698005698005) internal successors, (913), 713 states have internal predecessors, (913), 133 states have call successors, (133), 81 states have call predecessors, (133), 80 states have return successors, (162), 123 states have call predecessors, (162), 132 states have call successors, (162) [2021-11-23 01:53:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1208 transitions. [2021-11-23 01:53:01,747 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1208 transitions. Word has length 60 [2021-11-23 01:53:01,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:53:01,747 INFO L470 AbstractCegarLoop]: Abstraction has 917 states and 1208 transitions. [2021-11-23 01:53:01,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 01:53:01,748 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1208 transitions. [2021-11-23 01:53:01,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-23 01:53:01,750 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:53:01,751 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1] [2021-11-23 01:53:01,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-23 01:53:01,751 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:53:01,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:53:01,752 INFO L85 PathProgramCache]: Analyzing trace with hash -980507615, now seen corresponding path program 2 times [2021-11-23 01:53:01,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:53:01,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624060247] [2021-11-23 01:53:01,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:53:01,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:53:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:53:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-23 01:53:01,780 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:53:01,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624060247] [2021-11-23 01:53:01,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624060247] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:53:01,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:53:01,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 01:53:01,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17037555] [2021-11-23 01:53:01,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:53:01,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:53:01,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:53:01,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:53:01,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:53:01,783 INFO L87 Difference]: Start difference. First operand 917 states and 1208 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-23 01:53:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:53:01,878 INFO L93 Difference]: Finished difference Result 1247 states and 1641 transitions. [2021-11-23 01:53:01,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:53:01,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 61 [2021-11-23 01:53:01,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:53:01,885 INFO L225 Difference]: With dead ends: 1247 [2021-11-23 01:53:01,885 INFO L226 Difference]: Without dead ends: 859 [2021-11-23 01:53:01,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:53:01,887 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 135 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 01:53:01,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 199 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 01:53:01,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-11-23 01:53:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 850. [2021-11-23 01:53:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 645 states have (on average 1.289922480620155) internal successors, (832), 657 states have internal predecessors, (832), 127 states have call successors, (127), 77 states have call predecessors, (127), 76 states have return successors, (156), 116 states have call predecessors, (156), 126 states have call successors, (156) [2021-11-23 01:53:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1115 transitions. [2021-11-23 01:53:01,978 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1115 transitions. Word has length 61 [2021-11-23 01:53:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:53:01,979 INFO L470 AbstractCegarLoop]: Abstraction has 850 states and 1115 transitions. [2021-11-23 01:53:01,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-23 01:53:01,979 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1115 transitions. [2021-11-23 01:53:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-23 01:53:01,982 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:53:01,982 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-11-23 01:53:01,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-23 01:53:01,983 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:53:01,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:53:01,983 INFO L85 PathProgramCache]: Analyzing trace with hash 717283250, now seen corresponding path program 1 times [2021-11-23 01:53:01,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:53:01,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245013176] [2021-11-23 01:53:01,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:53:01,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:53:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:53:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 01:53:02,015 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:53:02,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245013176] [2021-11-23 01:53:02,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245013176] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:53:02,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:53:02,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 01:53:02,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664541225] [2021-11-23 01:53:02,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:53:02,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:53:02,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:53:02,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:53:02,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:53:02,017 INFO L87 Difference]: Start difference. First operand 850 states and 1115 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-23 01:53:02,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:53:02,105 INFO L93 Difference]: Finished difference Result 977 states and 1274 transitions. [2021-11-23 01:53:02,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:53:02,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 73 [2021-11-23 01:53:02,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:53:02,110 INFO L225 Difference]: With dead ends: 977 [2021-11-23 01:53:02,110 INFO L226 Difference]: Without dead ends: 443 [2021-11-23 01:53:02,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:53:02,113 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 27 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 01:53:02,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 264 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 01:53:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-11-23 01:53:02,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2021-11-23 01:53:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 302 states have (on average 1.2913907284768211) internal successors, (390), 308 states have internal predecessors, (390), 89 states have call successors, (89), 51 states have call predecessors, (89), 51 states have return successors, (119), 84 states have call predecessors, (119), 89 states have call successors, (119) [2021-11-23 01:53:02,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 598 transitions. [2021-11-23 01:53:02,153 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 598 transitions. Word has length 73 [2021-11-23 01:53:02,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:53:02,154 INFO L470 AbstractCegarLoop]: Abstraction has 443 states and 598 transitions. [2021-11-23 01:53:02,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-23 01:53:02,154 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 598 transitions. [2021-11-23 01:53:02,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 01:53:02,156 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:53:02,157 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:53:02,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-23 01:53:02,157 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:53:02,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:53:02,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2033305335, now seen corresponding path program 1 times [2021-11-23 01:53:02,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:53:02,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945577382] [2021-11-23 01:53:02,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:53:02,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:53:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:53:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 01:53:02,208 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:53:02,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945577382] [2021-11-23 01:53:02,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945577382] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:53:02,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937814324] [2021-11-23 01:53:02,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:53:02,209 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:53:02,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:53:02,210 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:53:02,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 01:53:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:53:02,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 01:53:02,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:53:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-23 01:53:02,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 01:53:02,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937814324] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:53:02,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 01:53:02,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-23 01:53:02,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050827720] [2021-11-23 01:53:02,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:53:02,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:53:02,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:53:02,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:53:02,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 01:53:02,481 INFO L87 Difference]: Start difference. First operand 443 states and 598 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-23 01:53:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:53:02,559 INFO L93 Difference]: Finished difference Result 845 states and 1149 transitions. [2021-11-23 01:53:02,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:53:02,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 87 [2021-11-23 01:53:02,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:53:02,565 INFO L225 Difference]: With dead ends: 845 [2021-11-23 01:53:02,565 INFO L226 Difference]: Without dead ends: 522 [2021-11-23 01:53:02,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 01:53:02,567 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 59 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 01:53:02,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 92 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 01:53:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-11-23 01:53:02,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 507. [2021-11-23 01:53:02,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 357 states have (on average 1.2773109243697478) internal successors, (456), 362 states have internal predecessors, (456), 89 states have call successors, (89), 59 states have call predecessors, (89), 60 states have return successors, (117), 86 states have call predecessors, (117), 89 states have call successors, (117) [2021-11-23 01:53:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 662 transitions. [2021-11-23 01:53:02,619 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 662 transitions. Word has length 87 [2021-11-23 01:53:02,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:53:02,619 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 662 transitions. [2021-11-23 01:53:02,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-23 01:53:02,620 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 662 transitions. [2021-11-23 01:53:02,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 01:53:02,622 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:53:02,622 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:53:02,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 01:53:02,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-23 01:53:02,848 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:53:02,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:53:02,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1371971544, now seen corresponding path program 1 times [2021-11-23 01:53:02,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:53:02,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614589456] [2021-11-23 01:53:02,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:53:02,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:53:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:53:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-23 01:53:02,899 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:53:02,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614589456] [2021-11-23 01:53:02,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614589456] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:53:02,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490352713] [2021-11-23 01:53:02,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:53:02,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:53:02,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:53:02,904 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:53:02,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 01:53:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:53:03,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 01:53:03,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:53:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 01:53:03,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 01:53:03,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490352713] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:53:03,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 01:53:03,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-23 01:53:03,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419505741] [2021-11-23 01:53:03,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:53:03,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:53:03,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:53:03,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:53:03,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 01:53:03,183 INFO L87 Difference]: Start difference. First operand 507 states and 662 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-23 01:53:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:53:03,278 INFO L93 Difference]: Finished difference Result 973 states and 1276 transitions. [2021-11-23 01:53:03,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:53:03,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 87 [2021-11-23 01:53:03,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:53:03,284 INFO L225 Difference]: With dead ends: 973 [2021-11-23 01:53:03,284 INFO L226 Difference]: Without dead ends: 603 [2021-11-23 01:53:03,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 01:53:03,287 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 36 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 01:53:03,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 178 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 01:53:03,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2021-11-23 01:53:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 533. [2021-11-23 01:53:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 377 states have (on average 1.2811671087533156) internal successors, (483), 382 states have internal predecessors, (483), 92 states have call successors, (92), 62 states have call predecessors, (92), 63 states have return successors, (120), 89 states have call predecessors, (120), 92 states have call successors, (120) [2021-11-23 01:53:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 695 transitions. [2021-11-23 01:53:03,341 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 695 transitions. Word has length 87 [2021-11-23 01:53:03,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:53:03,342 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 695 transitions. [2021-11-23 01:53:03,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-23 01:53:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 695 transitions. [2021-11-23 01:53:03,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 01:53:03,345 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:53:03,345 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:53:03,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 01:53:03,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-23 01:53:03,565 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:53:03,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:53:03,565 INFO L85 PathProgramCache]: Analyzing trace with hash -584056763, now seen corresponding path program 2 times [2021-11-23 01:53:03,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:53:03,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468550934] [2021-11-23 01:53:03,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:53:03,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:53:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:53:03,628 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 01:53:03,629 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:53:03,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468550934] [2021-11-23 01:53:03,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468550934] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:53:03,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732960255] [2021-11-23 01:53:03,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 01:53:03,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:53:03,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:53:03,631 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:53:03,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 01:53:03,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 01:53:03,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 01:53:03,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 01:53:03,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:53:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 01:53:03,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 01:53:03,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732960255] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:53:03,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 01:53:03,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-23 01:53:03,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098290494] [2021-11-23 01:53:03,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:53:03,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:53:03,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:53:03,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:53:03,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-23 01:53:03,886 INFO L87 Difference]: Start difference. First operand 533 states and 695 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-23 01:53:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:53:03,982 INFO L93 Difference]: Finished difference Result 1036 states and 1393 transitions. [2021-11-23 01:53:03,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:53:03,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2021-11-23 01:53:03,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:53:03,988 INFO L225 Difference]: With dead ends: 1036 [2021-11-23 01:53:03,989 INFO L226 Difference]: Without dead ends: 640 [2021-11-23 01:53:03,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-23 01:53:03,992 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 58 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 01:53:03,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 180 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 01:53:03,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2021-11-23 01:53:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 620. [2021-11-23 01:53:04,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 442 states have (on average 1.262443438914027) internal successors, (558), 448 states have internal predecessors, (558), 105 states have call successors, (105), 72 states have call predecessors, (105), 72 states have return successors, (143), 100 states have call predecessors, (143), 105 states have call successors, (143) [2021-11-23 01:53:04,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 806 transitions. [2021-11-23 01:53:04,054 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 806 transitions. Word has length 87 [2021-11-23 01:53:04,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:53:04,054 INFO L470 AbstractCegarLoop]: Abstraction has 620 states and 806 transitions. [2021-11-23 01:53:04,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-23 01:53:04,055 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 806 transitions. [2021-11-23 01:53:04,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-23 01:53:04,057 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:53:04,057 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:53:04,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 01:53:04,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:53:04,271 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:53:04,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:53:04,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1856996029, now seen corresponding path program 1 times [2021-11-23 01:53:04,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:53:04,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161507540] [2021-11-23 01:53:04,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:53:04,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:53:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:53:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-23 01:53:04,334 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:53:04,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161507540] [2021-11-23 01:53:04,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161507540] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:53:04,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490329315] [2021-11-23 01:53:04,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:53:04,335 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:53:04,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:53:04,336 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:53:04,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 01:53:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:53:04,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 01:53:04,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:53:04,616 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 01:53:04,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 01:53:04,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490329315] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:53:04,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 01:53:04,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-23 01:53:04,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014207366] [2021-11-23 01:53:04,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:53:04,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:53:04,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:53:04,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:53:04,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-23 01:53:04,619 INFO L87 Difference]: Start difference. First operand 620 states and 806 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-23 01:53:04,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:53:04,730 INFO L93 Difference]: Finished difference Result 1467 states and 1905 transitions. [2021-11-23 01:53:04,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:53:04,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 88 [2021-11-23 01:53:04,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:53:04,737 INFO L225 Difference]: With dead ends: 1467 [2021-11-23 01:53:04,737 INFO L226 Difference]: Without dead ends: 854 [2021-11-23 01:53:04,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-23 01:53:04,741 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 33 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 01:53:04,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 155 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 01:53:04,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2021-11-23 01:53:04,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 685. [2021-11-23 01:53:04,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 491 states have (on average 1.264765784114053) internal successors, (621), 498 states have internal predecessors, (621), 113 states have call successors, (113), 80 states have call predecessors, (113), 80 states have return successors, (151), 107 states have call predecessors, (151), 113 states have call successors, (151) [2021-11-23 01:53:04,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 885 transitions. [2021-11-23 01:53:04,822 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 885 transitions. Word has length 88 [2021-11-23 01:53:04,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:53:04,823 INFO L470 AbstractCegarLoop]: Abstraction has 685 states and 885 transitions. [2021-11-23 01:53:04,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-23 01:53:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 885 transitions. [2021-11-23 01:53:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-23 01:53:04,826 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:53:04,826 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:53:04,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 01:53:05,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-23 01:53:05,040 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:53:05,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:53:05,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1002503226, now seen corresponding path program 1 times [2021-11-23 01:53:05,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:53:05,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685786984] [2021-11-23 01:53:05,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:53:05,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:53:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:53:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-23 01:53:05,126 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:53:05,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685786984] [2021-11-23 01:53:05,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685786984] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:53:05,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:53:05,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 01:53:05,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905078807] [2021-11-23 01:53:05,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:53:05,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 01:53:05,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:53:05,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 01:53:05,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 01:53:05,129 INFO L87 Difference]: Start difference. First operand 685 states and 885 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-23 01:53:05,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:53:05,362 INFO L93 Difference]: Finished difference Result 1656 states and 2112 transitions. [2021-11-23 01:53:05,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 01:53:05,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 89 [2021-11-23 01:53:05,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:53:05,371 INFO L225 Difference]: With dead ends: 1656 [2021-11-23 01:53:05,371 INFO L226 Difference]: Without dead ends: 1169 [2021-11-23 01:53:05,373 INFO L932 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 [2021-11-23 01:53:05,374 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 131 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 01:53:05,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 233 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:53:05,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2021-11-23 01:53:05,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1131. [2021-11-23 01:53:05,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 807 states have (on average 1.255266418835192) internal successors, (1013), 811 states have internal predecessors, (1013), 191 states have call successors, (191), 132 states have call predecessors, (191), 132 states have return successors, (227), 188 states have call predecessors, (227), 191 states have call successors, (227) [2021-11-23 01:53:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1431 transitions. [2021-11-23 01:53:05,508 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1431 transitions. Word has length 89 [2021-11-23 01:53:05,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:53:05,509 INFO L470 AbstractCegarLoop]: Abstraction has 1131 states and 1431 transitions. [2021-11-23 01:53:05,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-23 01:53:05,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1431 transitions. [2021-11-23 01:53:05,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-23 01:53:05,515 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:53:05,515 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:53:05,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-23 01:53:05,516 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:53:05,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:53:05,516 INFO L85 PathProgramCache]: Analyzing trace with hash -513844346, now seen corresponding path program 1 times [2021-11-23 01:53:05,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:53:05,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931253817] [2021-11-23 01:53:05,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:53:05,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:53:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:53:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-23 01:53:05,604 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:53:05,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931253817] [2021-11-23 01:53:05,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931253817] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:53:05,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634999790] [2021-11-23 01:53:05,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:53:05,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:53:05,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:53:05,606 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:53:05,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 01:53:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:53:05,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-23 01:53:05,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:53:05,998 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 50 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 01:53:05,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 01:53:06,338 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-23 01:53:06,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634999790] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 01:53:06,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1852974022] [2021-11-23 01:53:06,343 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2021-11-23 01:53:06,344 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 01:53:06,344 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 01:53:06,345 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 01:53:06,345 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 01:53:18,717 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 105 for LOIs [2021-11-23 01:53:18,761 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 58 for LOIs [2021-11-23 01:53:18,772 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 164 for LOIs [2021-11-23 01:53:18,824 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 104 for LOIs [2021-11-23 01:53:18,959 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 58 for LOIs [2021-11-23 01:53:19,239 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 180 for LOIs [2021-11-23 01:53:19,625 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 01:53:33,200 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '39310#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (<= 0 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~p_dw_st~0 0) (<= |ULTIMATE.start_eval2_~tmp~4#1| 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (not (= (+ ~local~0 1) ~token~0)) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2021-11-23 01:53:33,201 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 01:53:33,201 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 01:53:33,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 15 [2021-11-23 01:53:33,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428005793] [2021-11-23 01:53:33,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 01:53:33,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-23 01:53:33,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:53:33,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-23 01:53:33,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=2891, Unknown=0, NotChecked=0, Total=3192 [2021-11-23 01:53:33,205 INFO L87 Difference]: Start difference. First operand 1131 states and 1431 transitions. Second operand has 15 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 6 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 5 states have call predecessors, (30), 6 states have call successors, (30) [2021-11-23 01:53:36,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:53:36,029 INFO L93 Difference]: Finished difference Result 2946 states and 3877 transitions. [2021-11-23 01:53:36,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-11-23 01:53:36,032 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 6 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 5 states have call predecessors, (30), 6 states have call successors, (30) Word has length 98 [2021-11-23 01:53:36,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:53:36,047 INFO L225 Difference]: With dead ends: 2946 [2021-11-23 01:53:36,047 INFO L226 Difference]: Without dead ends: 1815 [2021-11-23 01:53:36,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 283 SyntacticMatches, 6 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7511 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=1658, Invalid=16164, Unknown=0, NotChecked=0, Total=17822 [2021-11-23 01:53:36,059 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 661 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-23 01:53:36,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [670 Valid, 1733 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-23 01:53:36,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2021-11-23 01:53:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 917. [2021-11-23 01:53:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 661 states have (on average 1.2223903177004538) internal successors, (808), 666 states have internal predecessors, (808), 145 states have call successors, (145), 110 states have call predecessors, (145), 110 states have return successors, (159), 141 states have call predecessors, (159), 145 states have call successors, (159) [2021-11-23 01:53:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1112 transitions. [2021-11-23 01:53:36,189 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1112 transitions. Word has length 98 [2021-11-23 01:53:36,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:53:36,190 INFO L470 AbstractCegarLoop]: Abstraction has 917 states and 1112 transitions. [2021-11-23 01:53:36,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 6 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 5 states have call predecessors, (30), 6 states have call successors, (30) [2021-11-23 01:53:36,190 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1112 transitions. [2021-11-23 01:53:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 01:53:36,193 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:53:36,194 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2021-11-23 01:53:36,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 01:53:36,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-23 01:53:36,408 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:53:36,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:53:36,409 INFO L85 PathProgramCache]: Analyzing trace with hash -820585036, now seen corresponding path program 1 times [2021-11-23 01:53:36,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:53:36,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803616489] [2021-11-23 01:53:36,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:53:36,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:53:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:53:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 01:53:36,720 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:53:36,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803616489] [2021-11-23 01:53:36,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803616489] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:53:36,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293779192] [2021-11-23 01:53:36,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:53:36,720 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:53:36,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:53:36,721 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:53:36,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 01:53:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:53:36,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-23 01:53:36,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:53:37,200 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-23 01:53:37,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 01:53:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-23 01:53:38,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293779192] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 01:53:38,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1112947046] [2021-11-23 01:53:38,098 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2021-11-23 01:53:38,098 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 01:53:38,099 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 01:53:38,099 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 01:53:38,099 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 01:53:47,276 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 151 for LOIs [2021-11-23 01:53:48,500 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 47 for LOIs [2021-11-23 01:53:48,507 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 155 for LOIs [2021-11-23 01:53:48,553 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 64 for LOIs [2021-11-23 01:53:48,623 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 47 for LOIs [2021-11-23 01:53:48,900 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 171 for LOIs [2021-11-23 01:53:49,874 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 01:54:05,868 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '45791#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 0) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (<= 0 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~p_dw_st~0 0) (<= |ULTIMATE.start_eval2_~tmp~4#1| 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (= ~a_t~0 0) (not (= (+ ~local~0 1) ~token~0)) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2021-11-23 01:54:05,868 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 01:54:05,868 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 01:54:05,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 12] total 32 [2021-11-23 01:54:05,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437156229] [2021-11-23 01:54:05,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 01:54:05,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 01:54:05,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:05,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 01:54:05,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=576, Invalid=5586, Unknown=0, NotChecked=0, Total=6162 [2021-11-23 01:54:05,879 INFO L87 Difference]: Start difference. First operand 917 states and 1112 transitions. Second operand has 32 states, 20 states have (on average 6.65) internal successors, (133), 25 states have internal predecessors, (133), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) [2021-11-23 01:54:11,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:11,139 INFO L93 Difference]: Finished difference Result 1992 states and 2475 transitions. [2021-11-23 01:54:11,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-11-23 01:54:11,140 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 20 states have (on average 6.65) internal successors, (133), 25 states have internal predecessors, (133), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) Word has length 101 [2021-11-23 01:54:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:11,149 INFO L225 Difference]: With dead ends: 1992 [2021-11-23 01:54:11,150 INFO L226 Difference]: Without dead ends: 1350 [2021-11-23 01:54:11,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9999 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=3006, Invalid=22754, Unknown=0, NotChecked=0, Total=25760 [2021-11-23 01:54:11,162 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 1886 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1894 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 3757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-23 01:54:11,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1894 Valid, 627 Invalid, 3757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-23 01:54:11,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2021-11-23 01:54:11,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1129. [2021-11-23 01:54:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 822 states have (on average 1.2080291970802919) internal successors, (993), 827 states have internal predecessors, (993), 171 states have call successors, (171), 135 states have call predecessors, (171), 135 states have return successors, (187), 167 states have call predecessors, (187), 171 states have call successors, (187) [2021-11-23 01:54:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1351 transitions. [2021-11-23 01:54:11,308 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1351 transitions. Word has length 101 [2021-11-23 01:54:11,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:11,308 INFO L470 AbstractCegarLoop]: Abstraction has 1129 states and 1351 transitions. [2021-11-23 01:54:11,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 20 states have (on average 6.65) internal successors, (133), 25 states have internal predecessors, (133), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) [2021-11-23 01:54:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1351 transitions. [2021-11-23 01:54:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-23 01:54:11,312 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:11,313 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2021-11-23 01:54:11,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-23 01:54:11,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:11,540 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:11,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:11,540 INFO L85 PathProgramCache]: Analyzing trace with hash 861626592, now seen corresponding path program 1 times [2021-11-23 01:54:11,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:11,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778194028] [2021-11-23 01:54:11,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:11,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 01:54:11,673 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:11,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778194028] [2021-11-23 01:54:11,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778194028] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:54:11,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103973239] [2021-11-23 01:54:11,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:11,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:11,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:54:11,676 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:54:11,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-23 01:54:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:11,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 01:54:11,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:54:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 01:54:11,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 01:54:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-11-23 01:54:12,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103973239] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 01:54:12,271 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-23 01:54:12,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 14 [2021-11-23 01:54:12,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136052379] [2021-11-23 01:54:12,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:12,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 01:54:12,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:12,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 01:54:12,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-11-23 01:54:12,273 INFO L87 Difference]: Start difference. First operand 1129 states and 1351 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-23 01:54:12,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:12,578 INFO L93 Difference]: Finished difference Result 2239 states and 2678 transitions. [2021-11-23 01:54:12,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 01:54:12,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 102 [2021-11-23 01:54:12,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:12,589 INFO L225 Difference]: With dead ends: 2239 [2021-11-23 01:54:12,589 INFO L226 Difference]: Without dead ends: 897 [2021-11-23 01:54:12,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-11-23 01:54:12,594 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 71 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 01:54:12,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 212 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 01:54:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-11-23 01:54:12,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 748. [2021-11-23 01:54:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 529 states have (on average 1.1512287334593572) internal successors, (609), 535 states have internal predecessors, (609), 126 states have call successors, (126), 96 states have call predecessors, (126), 92 states have return successors, (136), 117 states have call predecessors, (136), 126 states have call successors, (136) [2021-11-23 01:54:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 871 transitions. [2021-11-23 01:54:12,703 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 871 transitions. Word has length 102 [2021-11-23 01:54:12,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:12,704 INFO L470 AbstractCegarLoop]: Abstraction has 748 states and 871 transitions. [2021-11-23 01:54:12,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-23 01:54:12,704 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 871 transitions. [2021-11-23 01:54:12,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-23 01:54:12,708 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:12,708 INFO L514 BasicCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:54:12,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-23 01:54:12,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-11-23 01:54:12,928 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:12,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:12,928 INFO L85 PathProgramCache]: Analyzing trace with hash -984513642, now seen corresponding path program 1 times [2021-11-23 01:54:12,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:12,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087121628] [2021-11-23 01:54:12,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:12,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 61 proven. 39 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-11-23 01:54:13,037 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:13,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087121628] [2021-11-23 01:54:13,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087121628] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:54:13,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675480381] [2021-11-23 01:54:13,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:13,038 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:13,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:54:13,047 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:54:13,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 01:54:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:13,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-23 01:54:13,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:54:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 156 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-23 01:54:13,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 01:54:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 84 proven. 23 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-11-23 01:54:13,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675480381] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 01:54:13,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1738804412] [2021-11-23 01:54:13,933 INFO L159 IcfgInterpreter]: Started Sifa with 64 locations of interest [2021-11-23 01:54:13,933 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 01:54:13,934 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 01:54:13,934 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 01:54:13,935 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 01:54:23,561 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 151 for LOIs [2021-11-23 01:54:23,945 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 47 for LOIs [2021-11-23 01:54:23,951 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 155 for LOIs [2021-11-23 01:54:23,993 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 131 for LOIs [2021-11-23 01:54:24,573 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 47 for LOIs [2021-11-23 01:54:24,889 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 171 for LOIs [2021-11-23 01:54:25,229 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 01:54:39,817 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '56450#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 0) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (<= 0 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~p_dw_st~0 0) (<= |ULTIMATE.start_eval2_~tmp~4#1| 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (= ~a_t~0 0) (not (= (+ ~local~0 1) ~token~0)) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2021-11-23 01:54:39,817 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 01:54:39,818 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 01:54:39,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 13 [2021-11-23 01:54:39,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522434925] [2021-11-23 01:54:39,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 01:54:39,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-23 01:54:39,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:39,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-23 01:54:39,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=3430, Unknown=0, NotChecked=0, Total=3782 [2021-11-23 01:54:39,821 INFO L87 Difference]: Start difference. First operand 748 states and 871 transitions. Second operand has 13 states, 12 states have (on average 10.833333333333334) internal successors, (130), 12 states have internal predecessors, (130), 4 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (38), 5 states have call predecessors, (38), 4 states have call successors, (38) [2021-11-23 01:54:40,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:40,547 INFO L93 Difference]: Finished difference Result 907 states and 1051 transitions. [2021-11-23 01:54:40,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-23 01:54:40,548 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 10.833333333333334) internal successors, (130), 12 states have internal predecessors, (130), 4 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (38), 5 states have call predecessors, (38), 4 states have call successors, (38) Word has length 155 [2021-11-23 01:54:40,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:40,548 INFO L225 Difference]: With dead ends: 907 [2021-11-23 01:54:40,549 INFO L226 Difference]: Without dead ends: 0 [2021-11-23 01:54:40,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 408 SyntacticMatches, 11 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3070 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=574, Invalid=6398, Unknown=0, NotChecked=0, Total=6972 [2021-11-23 01:54:40,553 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 205 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 01:54:40,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 749 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 01:54:40,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-23 01:54:40,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-23 01:54:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 01:54:40,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-23 01:54:40,554 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 155 [2021-11-23 01:54:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:40,554 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-23 01:54:40,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 10.833333333333334) internal successors, (130), 12 states have internal predecessors, (130), 4 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (38), 5 states have call predecessors, (38), 4 states have call successors, (38) [2021-11-23 01:54:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-23 01:54:40,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-23 01:54:40,557 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-11-23 01:54:40,558 INFO L764 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-11-23 01:54:40,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-23 01:54:40,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:40,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-23 01:54:57,908 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 706 716) no Hoare annotation was computed. [2021-11-23 01:54:57,909 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 706 716) the Hoare annotation is: (let ((.cse23 (= ~p_dw_pc~0 0)) (.cse25 (= ~p_num_write~0 0)) (.cse21 (= ~c_num_read~0 0)) (.cse24 (= ~t1_i~0 1)) (.cse22 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse27 (= ~p_dw_st~0 0)) (.cse26 (= ~c_dr_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse0 (and .cse23 .cse25 .cse21 .cse24 .cse22 .cse19 .cse14 .cse27 .cse26 .cse20)) (.cse15 (not (= ~E_M~0 2))) (.cse16 (not (<= ~token~0 ~local~0))) (.cse17 (not (<= ~local~0 ~token~0))) (.cse18 (not (= ~E_1~0 1))) (.cse1 (not .cse27)) (.cse2 (not .cse26)) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not .cse25)) (.cse6 (not .cse24)) (.cse7 (not .cse23)) (.cse8 (not .cse22)) (.cse9 (not .cse21)) (.cse10 (not (= ~q_free~0 0))) (.cse11 (not .cse20)) (.cse12 (not (<= 2 ~E_1~0))) (.cse13 (not (= ~E_M~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (< ~local~0 ~token~0)) .cse11 .cse12 (not (<= ~token~0 (+ ~local~0 1))) .cse13) (or (not (= |old(~t1_st~0)| 0)) (not (= ~m_pc~0 ~t1_pc~0)) .cse1 (and .cse14 (= ~t1_st~0 0)) .cse15 .cse2 .cse3 .cse16 (not (= ~m_pc~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (or .cse0 .cse1 .cse15 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~m_pc~0 1) .cse9 .cse10 (and .cse19 (not (= ~m_st~0 0))) .cse11 .cse12 .cse13)))) [2021-11-23 01:54:57,909 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 706 716) no Hoare annotation was computed. [2021-11-23 01:54:57,909 INFO L854 garLoopResultBuilder]: At program point immediate_notify_threadsENTRY(lines 84 108) the Hoare annotation is: (or (not (= ~m_pc~0 ~t1_pc~0)) (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= |old(~p_dw_st~0)| 2)) (not (<= ~p_num_write~0 ~c_num_read~0)) (= ~m_pc~0 1) (= 2 ~p_dw_st~0) (not (= ~t1_st~0 0)) (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))) [2021-11-23 01:54:57,910 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2021-11-23 01:54:57,910 INFO L858 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2021-11-23 01:54:57,910 INFO L858 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2021-11-23 01:54:57,910 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2021-11-23 01:54:57,910 INFO L858 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2021-11-23 01:54:57,910 INFO L854 garLoopResultBuilder]: At program point L61(lines 49 63) the Hoare annotation is: (or (not (= ~m_pc~0 ~t1_pc~0)) (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= |old(~p_dw_st~0)| 2)) (not (<= ~p_num_write~0 ~c_num_read~0)) (= ~m_pc~0 1) (= 2 ~p_dw_st~0) (not (= ~t1_st~0 0)) (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))) [2021-11-23 01:54:57,911 INFO L858 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2021-11-23 01:54:57,911 INFO L861 garLoopResultBuilder]: At program point L80(lines 68 82) the Hoare annotation is: true [2021-11-23 01:54:57,911 INFO L858 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2021-11-23 01:54:57,911 INFO L854 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 625 652) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 0)) (.cse11 (= ~E_M~0 2))) (let ((.cse3 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse13 (and .cse11 (= ~E_1~0 2))) (.cse1 (not (= ~c_dr_pc~0 0))) (.cse14 (not (<= ~token~0 ~local~0))) (.cse15 (not (= 2 |old(~E_1~0)|))) (.cse4 (not (= 2 |old(~E_M~0)|))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse10 (not (= ~q_free~0 0))) (.cse16 (not (<= ~local~0 ~token~0))) (.cse17 (and (not (= ~m_st~0 |old(~E_M~0)|)) (not .cse2))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 2 |old(~E_1~0)|)) (= ~m_pc~0 1) .cse9 .cse10 (and (= ~E_1~0 |old(~E_1~0)|) .cse11) .cse12) (or .cse0 .cse13 .cse1 .cse14 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 .cse12) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse13 .cse1 .cse14 .cse15 (not (= ~m_pc~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 (not (= ~t1_st~0 0)) .cse12)))) [2021-11-23 01:54:57,911 INFO L858 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 625 652) no Hoare annotation was computed. [2021-11-23 01:54:57,912 INFO L854 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 681 705) the Hoare annotation is: (let ((.cse2 (= |old(~m_st~0)| 0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse37 (= ~t1_pc~0 1)) (.cse23 (= ~p_dw_pc~0 0)) (.cse36 (<= 2 ~E_1~0)) (.cse24 (= ~p_num_write~0 0)) (.cse25 (= ~c_num_read~0 0)) (.cse26 (= ~t1_i~0 1)) (.cse27 (= ~p_last_write~0 ~q_buf_0~0)) (.cse28 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= ~m_pc~0 1)) (.cse38 (= ~q_free~0 0)) (.cse30 (= ~p_dw_st~0 0)) (.cse31 (= ~c_dr_pc~0 0)) (.cse32 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse11 (and .cse37 .cse23 .cse36 .cse24 .cse25 .cse26 .cse27 .cse28 (not .cse8) .cse38 .cse30 (not (= ~m_st~0 0)) .cse31 .cse32)) (.cse22 (not (= ~E_1~0 1))) (.cse16 (not (= |old(~t1_st~0)| 0))) (.cse17 (not (= ~m_pc~0 ~t1_pc~0))) (.cse18 (and .cse29 (= ~t1_st~0 0))) (.cse15 (not (= ~E_M~0 2))) (.cse19 (not (<= ~token~0 ~local~0))) (.cse33 (and (not .cse2) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse20 (not (= ~m_pc~0 0))) (.cse34 (not (= ~E_1~0 2))) (.cse21 (not (<= ~local~0 ~token~0))) (.cse0 (not .cse30)) (.cse1 (not .cse31)) (.cse3 (not .cse37)) (.cse4 (not .cse24)) (.cse5 (not .cse26)) (.cse6 (not .cse23)) (.cse7 (not .cse27)) (.cse9 (not .cse25)) (.cse10 (not .cse38)) (.cse35 (and .cse37 .cse23 .cse36 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse38 .cse30 .cse31 .cse32)) (.cse12 (not .cse32)) (.cse13 (not .cse36)) (.cse14 (not (= ~E_M~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse16 .cse17 .cse0 .cse18 .cse15 .cse1 .cse2 .cse19 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse21 .cse22 .cse12) (or (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse0 .cse15 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse21 .cse22 .cse12) (or .cse0 .cse15 .cse1 .cse2 .cse19 .cse33 .cse3 .cse4 .cse34 .cse5 .cse6 .cse7 .cse9 .cse10 .cse21 .cse35 .cse12 .cse13) (or .cse16 .cse17 .cse0 .cse18 .cse15 .cse1 .cse19 .cse33 .cse20 .cse4 .cse34 .cse5 .cse6 .cse7 .cse9 .cse10 .cse21 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 (not (< ~local~0 ~token~0)) .cse35 .cse12 .cse13 (not (<= ~token~0 (+ ~local~0 1))) .cse14)))) [2021-11-23 01:54:57,912 INFO L858 garLoopResultBuilder]: For program point L494(lines 494 503) no Hoare annotation was computed. [2021-11-23 01:54:57,912 INFO L858 garLoopResultBuilder]: For program point L494-2(lines 494 503) no Hoare annotation was computed. [2021-11-23 01:54:57,912 INFO L858 garLoopResultBuilder]: For program point L513(lines 513 522) no Hoare annotation was computed. [2021-11-23 01:54:57,912 INFO L858 garLoopResultBuilder]: For program point L513-2(lines 513 522) no Hoare annotation was computed. [2021-11-23 01:54:57,912 INFO L858 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 681 705) no Hoare annotation was computed. [2021-11-23 01:54:57,912 INFO L854 garLoopResultBuilder]: At program point L505(lines 493 507) the Hoare annotation is: (let ((.cse19 (= ~m_pc~0 1)) (.cse6 (= |old(~m_st~0)| 0))) (let ((.cse36 (= ~m_st~0 |old(~m_st~0)|)) (.cse23 (= ~t1_pc~0 1)) (.cse24 (= ~p_dw_pc~0 0)) (.cse25 (<= 2 ~E_1~0)) (.cse26 (= ~p_num_write~0 0)) (.cse27 (= ~c_num_read~0 0)) (.cse28 (= ~t1_i~0 1)) (.cse29 (= ~p_last_write~0 ~q_buf_0~0)) (.cse30 (= |old(~t1_st~0)| ~t1_st~0)) (.cse39 (or (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse6)) (.cse31 (not .cse19)) (.cse32 (= ~q_free~0 0)) (.cse33 (= ~p_dw_st~0 0)) (.cse34 (= ~c_dr_pc~0 0)) (.cse35 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse22 (not (= ~E_M~0 1))) (.cse20 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse39 .cse31 .cse32 .cse33 (not (= ~m_st~0 0)) .cse34 .cse35)) (.cse21 (not .cse25)) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (and .cse39 .cse36 (= ~t1_st~0 0))) (.cse37 (and (not .cse6) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse8 (not (= ~m_pc~0 0))) (.cse38 (not (= ~E_1~0 2))) (.cse2 (not .cse33)) (.cse4 (not (= ~E_M~0 2))) (.cse5 (not .cse34)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse18 (not .cse23)) (.cse9 (not .cse26)) (.cse10 (not .cse28)) (.cse11 (not .cse24)) (.cse12 (not .cse29)) (.cse13 (not .cse27)) (.cse14 (not .cse32)) (.cse15 (not (<= ~local~0 ~token~0))) (.cse16 (not (= ~E_1~0 1))) (.cse17 (not .cse35))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse2 .cse5 .cse6 .cse18 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse14 .cse20 .cse17 .cse21 .cse22) (or .cse2 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) .cse5 .cse6 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse36 .cse32 (= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse33 .cse34 .cse35) .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (< ~local~0 ~token~0)) .cse17 .cse21 (not (<= ~token~0 (+ ~local~0 1))) .cse22) (or .cse2 .cse4 .cse5 .cse6 .cse18 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse14 .cse20 .cse17 .cse21) (or .cse2 .cse4 .cse5 .cse6 .cse7 .cse37 .cse18 .cse9 .cse38 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (= ~m_st~0 ~E_M~0) .cse29 .cse30 .cse39 .cse32 .cse33 .cse34 .cse35) .cse15 .cse17 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse37 .cse8 .cse9 .cse38 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (or (and .cse24 .cse26 .cse27 .cse28 .cse29 .cse30 .cse39 .cse36 .cse33 .cse34 .cse35) .cse2 .cse4 .cse5 .cse6 .cse7 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))))) [2021-11-23 01:54:57,912 INFO L858 garLoopResultBuilder]: For program point L495(lines 495 500) no Hoare annotation was computed. [2021-11-23 01:54:57,913 INFO L854 garLoopResultBuilder]: At program point L524(lines 512 526) the Hoare annotation is: (let ((.cse36 (= ~m_st~0 0)) (.cse3 (= |old(~m_st~0)| 0)) (.cse10 (= ~m_pc~0 1))) (let ((.cse23 (= ~m_st~0 |old(~m_st~0)|)) (.cse17 (= ~p_dw_pc~0 0)) (.cse35 (<= 2 ~E_1~0)) (.cse18 (= ~p_num_write~0 0)) (.cse30 (not (= ~m_pc~0 ~t1_pc~0))) (.cse19 (= ~c_num_read~0 0)) (.cse20 (= ~t1_i~0 1)) (.cse21 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (= |old(~t1_st~0)| ~t1_st~0)) (.cse38 (not .cse10)) (.cse37 (= ~q_free~0 0)) (.cse24 (or (and (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (not .cse36)) .cse3)) (.cse25 (= ~p_dw_st~0 0)) (.cse26 (= ~c_dr_pc~0 0)) (.cse27 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse5 (and .cse17 .cse35 .cse18 .cse30 .cse19 .cse20 .cse21 .cse22 .cse38 .cse37 .cse24 .cse25 .cse26 .cse27)) (.cse39 (not (= ~E_M~0 1))) (.cse29 (not (= |old(~t1_st~0)| 0))) (.cse31 (and .cse23 (= ~t1_st~0 0) .cse24 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0))) (.cse33 (not (= ~m_pc~0 0))) (.cse28 (not (= ~E_1~0 1))) (.cse0 (not .cse25)) (.cse1 (not (= ~E_M~0 2))) (.cse2 (not .cse26)) (.cse15 (not (<= ~token~0 ~local~0))) (.cse32 (and (not .cse3) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse4 (not (= ~t1_pc~0 1))) (.cse6 (not .cse18)) (.cse34 (not (= ~E_1~0 2))) (.cse7 (not .cse20)) (.cse8 (not .cse17)) (.cse9 (not .cse21)) (.cse11 (not .cse19)) (.cse12 (not .cse37)) (.cse16 (not (<= ~local~0 ~token~0))) (.cse13 (not .cse27)) (.cse14 (not .cse35))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse16 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) .cse28 .cse13) (or .cse29 .cse30 .cse0 .cse31 .cse1 .cse2 .cse15 .cse32 .cse33 .cse6 .cse34 .cse7 .cse8 .cse9 .cse11 .cse12 .cse16 .cse13) (or .cse0 (and .cse17 .cse35 .cse18 .cse19 .cse20 .cse21 .cse22 .cse36 .cse37 (= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse25 .cse26 .cse27) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 (and .cse17 .cse35 .cse18 .cse30 .cse19 .cse20 .cse21 .cse22 .cse38 .cse37 .cse25 .cse26 .cse27) .cse12 (not (< ~local~0 ~token~0)) .cse13 .cse14 (not (<= ~token~0 (+ ~local~0 1))) .cse39) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse39) (or .cse29 .cse30 .cse0 .cse31 .cse1 .cse2 .cse3 .cse15 .cse33 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse16 .cse28 .cse13) (or .cse0 (and .cse17 .cse35 .cse18 .cse19 .cse20 (= ~m_st~0 ~E_M~0) .cse21 .cse22 .cse37 .cse24 .cse25 .cse26 .cse27) .cse1 .cse2 .cse3 .cse15 .cse32 .cse4 .cse6 .cse34 .cse7 .cse8 .cse9 .cse11 .cse12 .cse16 .cse13 .cse14))))) [2021-11-23 01:54:57,913 INFO L858 garLoopResultBuilder]: For program point L514(lines 514 519) no Hoare annotation was computed. [2021-11-23 01:54:57,913 INFO L858 garLoopResultBuilder]: For program point update_channels2EXIT(lines 528 535) no Hoare annotation was computed. [2021-11-23 01:54:57,913 INFO L861 garLoopResultBuilder]: At program point update_channels2FINAL(lines 528 535) the Hoare annotation is: true [2021-11-23 01:54:57,913 INFO L854 garLoopResultBuilder]: At program point L812(line 812) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2021-11-23 01:54:57,914 INFO L854 garLoopResultBuilder]: At program point L581(line 581) the Hoare annotation is: (let ((.cse15 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 ~E_M~0)) (.cse16 (= ~t1_st~0 0)) (.cse20 (= ~m_pc~0 0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse19 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse17 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 (not .cse15) .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse17 .cse20 .cse10 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse7 (or .cse5 .cse21) .cse16 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse21) .cse9 .cse10 .cse11) (and .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 .cse21 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 (< ~local~0 ~token~0)))) [2021-11-23 01:54:57,914 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-23 01:54:57,914 INFO L858 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2021-11-23 01:54:57,914 INFO L858 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2021-11-23 01:54:57,914 INFO L858 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2021-11-23 01:54:57,914 INFO L858 garLoopResultBuilder]: For program point L830(lines 830 834) no Hoare annotation was computed. [2021-11-23 01:54:57,914 INFO L858 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2021-11-23 01:54:57,914 INFO L858 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2021-11-23 01:54:57,914 INFO L858 garLoopResultBuilder]: For program point L583(line 583) no Hoare annotation was computed. [2021-11-23 01:54:57,914 INFO L854 garLoopResultBuilder]: At program point L418(lines 413 452) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~p_dw_pc~0 0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (< ~local~0 ~token~0)) [2021-11-23 01:54:57,915 INFO L854 garLoopResultBuilder]: At program point L798-1(lines 795 835) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2021-11-23 01:54:57,915 INFO L854 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 1) (not (= ~m_pc~0 1)) (<= ~p_num_write~0 ~c_num_read~0) (= ~t1_st~0 0) (= 2 ~p_dw_st~0) (= ~c_last_read~0 ~p_last_write~0) (< ~c_num_read~0 (+ ~p_num_write~0 1))) [2021-11-23 01:54:57,915 INFO L858 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2021-11-23 01:54:57,915 INFO L858 garLoopResultBuilder]: For program point L815(line 815) no Hoare annotation was computed. [2021-11-23 01:54:57,915 INFO L854 garLoopResultBuilder]: At program point L204(lines 153 209) the Hoare annotation is: (and (= ~c_dr_st~0 2) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 1) (not (= ~m_pc~0 1)) (<= ~p_num_write~0 ~c_num_read~0) (= ~t1_st~0 0) (< ~c_num_read~0 (+ ~p_num_write~0 1))) [2021-11-23 01:54:57,915 INFO L854 garLoopResultBuilder]: At program point L469-1(lines 457 488) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0))) .cse4 (= ~m_st~0 ~E_M~0) .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 (= ~m_pc~0 0) .cse12 .cse13))) [2021-11-23 01:54:57,915 INFO L858 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2021-11-23 01:54:57,916 INFO L858 garLoopResultBuilder]: For program point L585-1(lines 580 618) no Hoare annotation was computed. [2021-11-23 01:54:57,916 INFO L858 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2021-11-23 01:54:57,916 INFO L854 garLoopResultBuilder]: At program point L817(lines 817 826) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2021-11-23 01:54:57,916 INFO L858 garLoopResultBuilder]: For program point L817-2(lines 817 826) no Hoare annotation was computed. [2021-11-23 01:54:57,916 INFO L854 garLoopResultBuilder]: At program point L619(lines 574 624) the Hoare annotation is: (let ((.cse16 (= ~m_st~0 0))) (let ((.cse14 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (or (= ~m_st~0 ~E_M~0) .cse16)) (.cse7 (= ~p_dw_st~0 0)) (.cse15 (not .cse16)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~E_M~0 2)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 (= ~t1_st~0 0) .cse7 .cse8 (= ~m_pc~0 0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (not (= ~m_pc~0 1)) .cse5 .cse7 .cse15 .cse8 .cse9 .cse10) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2021-11-23 01:54:57,917 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-23 01:54:57,917 INFO L854 garLoopResultBuilder]: At program point L256(line 256) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_st~0 0))) (or (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse3 (= 2 ~p_dw_st~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse4 .cse2 .cse3 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse4 .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse3 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2021-11-23 01:54:57,917 INFO L858 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2021-11-23 01:54:57,917 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2021-11-23 01:54:57,917 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2021-11-23 01:54:57,917 INFO L854 garLoopResultBuilder]: At program point L125-1(lines 113 150) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_st~0 0))) (or (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse3 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse4 .cse2 .cse3 (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse4 .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse3 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2021-11-23 01:54:57,918 INFO L854 garLoopResultBuilder]: At program point L604(lines 580 618) the Hoare annotation is: (let ((.cse15 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 ~E_M~0)) (.cse16 (= ~t1_st~0 0)) (.cse20 (= ~m_pc~0 0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse19 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse17 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 (not .cse15) .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse17 .cse20 .cse10 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse7 (or .cse5 .cse21) .cse16 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse21) .cse9 .cse10 .cse11) (and .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 .cse21 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 (< ~local~0 ~token~0)))) [2021-11-23 01:54:57,918 INFO L854 garLoopResultBuilder]: At program point L439-1(lines 413 452) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse2 (<= 2 ~E_1~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (= ~t1_st~0 0) .cse8 .cse9 .cse10 .cse11 (= ~m_pc~0 0) .cse12 .cse13 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)))) [2021-11-23 01:54:57,918 INFO L854 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (< ~c_num_read~0 ~p_num_write~0) (not (= ~m_pc~0 1)) (= ~q_free~0 0) (= ~t1_st~0 0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2021-11-23 01:54:57,918 INFO L858 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2021-11-23 01:54:57,918 INFO L854 garLoopResultBuilder]: At program point L390(line 390) the Hoare annotation is: false [2021-11-23 01:54:57,918 INFO L854 garLoopResultBuilder]: At program point L836(lines 783 841) the Hoare annotation is: (= ~p_dw_st~0 0) [2021-11-23 01:54:57,919 INFO L858 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2021-11-23 01:54:57,919 INFO L854 garLoopResultBuilder]: At program point L770(line 770) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2021-11-23 01:54:57,919 INFO L854 garLoopResultBuilder]: At program point L770-1(line 770) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2021-11-23 01:54:57,919 INFO L858 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2021-11-23 01:54:57,919 INFO L854 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_st~0 0))) (or (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse3 (= 2 ~p_dw_st~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse4 .cse2 .cse3 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse4 .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse3 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2021-11-23 01:54:57,919 INFO L854 garLoopResultBuilder]: At program point L308-1(line 308) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_st~0 0))) (or (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse3 (= 2 ~p_dw_st~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse4 .cse2 .cse3 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse4 .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse3 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2021-11-23 01:54:57,919 INFO L854 garLoopResultBuilder]: At program point L160(lines 160 164) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (< ~c_num_read~0 ~p_num_write~0) (not (= ~m_pc~0 1)) (= ~q_free~0 0) (= ~t1_st~0 0) (= 2 ~p_dw_st~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2021-11-23 01:54:57,919 INFO L854 garLoopResultBuilder]: At program point L127(lines 113 150) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (<= ~p_num_write~0 ~c_num_read~0) (= ~t1_st~0 0) (< ~c_num_read~0 (+ ~p_num_write~0 1))) [2021-11-23 01:54:57,919 INFO L858 garLoopResultBuilder]: For program point L854(lines 854 860) no Hoare annotation was computed. [2021-11-23 01:54:57,920 INFO L854 garLoopResultBuilder]: At program point L821(line 821) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2021-11-23 01:54:57,920 INFO L854 garLoopResultBuilder]: At program point L821-1(line 821) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2021-11-23 01:54:57,920 INFO L858 garLoopResultBuilder]: For program point L590(lines 580 618) no Hoare annotation was computed. [2021-11-23 01:54:57,920 INFO L858 garLoopResultBuilder]: For program point L458(lines 458 466) no Hoare annotation was computed. [2021-11-23 01:54:57,920 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2021-11-23 01:54:57,920 INFO L858 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2021-11-23 01:54:57,920 INFO L858 garLoopResultBuilder]: For program point L607(lines 607 614) no Hoare annotation was computed. [2021-11-23 01:54:57,921 INFO L854 garLoopResultBuilder]: At program point L806(line 806) the Hoare annotation is: (let ((.cse16 (= ~m_st~0 0))) (let ((.cse14 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (or (= ~m_st~0 ~E_M~0) .cse16)) (.cse7 (= ~p_dw_st~0 0)) (.cse15 (not .cse16)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~E_M~0 2)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 (= ~t1_st~0 0) .cse7 .cse8 (= ~m_pc~0 0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (not (= ~m_pc~0 1)) .cse5 .cse7 .cse15 .cse8 .cse9 .cse10) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2021-11-23 01:54:57,921 INFO L858 garLoopResultBuilder]: For program point L806-1(line 806) no Hoare annotation was computed. [2021-11-23 01:54:57,921 INFO L854 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2021-11-23 01:54:57,921 INFO L854 garLoopResultBuilder]: At program point L856(lines 856 859) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2021-11-23 01:54:57,921 INFO L861 garLoopResultBuilder]: At program point L344(lines 321 349) the Hoare annotation is: true [2021-11-23 01:54:57,921 INFO L854 garLoopResultBuilder]: At program point L146(lines 109 151) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (< ~c_num_read~0 ~p_num_write~0) (not (= ~m_pc~0 1)) (= ~q_free~0 0) (= ~t1_st~0 0) (= 2 ~p_dw_st~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2021-11-23 01:54:57,922 INFO L854 garLoopResultBuilder]: At program point L791(line 791) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2021-11-23 01:54:57,922 INFO L854 garLoopResultBuilder]: At program point L791-1(line 791) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2021-11-23 01:54:57,922 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2021-11-23 01:54:57,922 INFO L858 garLoopResultBuilder]: For program point L593(lines 593 600) no Hoare annotation was computed. [2021-11-23 01:54:57,922 INFO L854 garLoopResultBuilder]: At program point L461(lines 461 465) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse14 (= ~m_pc~0 ~t1_pc~0)) (.cse15 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse5 (= ~t1_i~0 1)) (.cse19 (= ~m_st~0 ~E_M~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 2)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse9 .cse7 .cse8 .cse10 .cse11 .cse15 .cse12 .cse13 .cse16 .cse17 .cse18) (and .cse1 .cse2 (not .cse14) .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse10 .cse11 .cse15 .cse12 .cse13 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17 .cse18))) [2021-11-23 01:54:57,923 INFO L854 garLoopResultBuilder]: At program point L296(lines 248 301) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_st~0 0))) (or (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse3 (= 2 ~p_dw_st~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse4 .cse2 .cse3 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse4 .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse3 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2021-11-23 01:54:57,923 INFO L854 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_st~0 0))) (or (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse3 (= 2 ~p_dw_st~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse4 .cse2 .cse3 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse4 .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse3 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2021-11-23 01:54:57,923 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2021-11-23 01:54:57,923 INFO L854 garLoopResultBuilder]: At program point L479(line 479) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~E_M~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 (+ ~local~0 1)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (< ~local~0 ~token~0) .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_pc~0 1)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-23 01:54:57,924 INFO L858 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2021-11-23 01:54:57,924 INFO L854 garLoopResultBuilder]: At program point L793(line 793) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~t1_st~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2021-11-23 01:54:57,924 INFO L854 garLoopResultBuilder]: At program point L793-1(line 793) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~t1_st~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2021-11-23 01:54:57,924 INFO L854 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (let ((.cse16 (= ~m_st~0 0))) (let ((.cse14 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (or (= ~m_st~0 ~E_M~0) .cse16)) (.cse7 (= ~p_dw_st~0 0)) (.cse15 (not .cse16)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~E_M~0 2)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 (= ~t1_st~0 0) .cse7 .cse8 (= ~m_pc~0 0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (not (= ~m_pc~0 1)) .cse5 .cse7 .cse15 .cse8 .cse9 .cse10) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2021-11-23 01:54:57,924 INFO L858 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2021-11-23 01:54:57,925 INFO L854 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_st~0 0))) (or (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse3 (= 2 ~p_dw_st~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse4 .cse2 .cse3 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse4 .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse3 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2021-11-23 01:54:57,925 INFO L854 garLoopResultBuilder]: At program point L810-1(line 810) the Hoare annotation is: (let ((.cse16 (= ~m_st~0 0))) (let ((.cse14 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (or (= ~m_st~0 ~E_M~0) .cse16)) (.cse7 (= ~p_dw_st~0 0)) (.cse15 (not .cse16)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~E_M~0 2)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 (= ~t1_st~0 0) .cse7 .cse8 (= ~m_pc~0 0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (not (= ~m_pc~0 1)) .cse5 .cse7 .cse15 .cse8 .cse9 .cse10) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2021-11-23 01:54:57,925 INFO L854 garLoopResultBuilder]: At program point L447(lines 410 453) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~E_M~0 2)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 (not (= ~m_pc~0 ~t1_pc~0)) .cse2 (= ~m_st~0 2) .cse3 .cse4 .cse5 (= ~t1_st~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 (= ~m_st~0 ~E_M~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-11-23 01:54:57,925 INFO L858 garLoopResultBuilder]: For program point L414(lines 414 422) no Hoare annotation was computed. [2021-11-23 01:54:57,926 INFO L854 garLoopResultBuilder]: At program point L794(line 794) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~t1_st~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2021-11-23 01:54:57,926 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2021-11-23 01:54:57,926 INFO L854 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~E_1~0 1)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= ~E_M~0 2)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 (= ~t1_st~0 0) .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse12 .cse13 .cse14) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-23 01:54:57,926 INFO L858 garLoopResultBuilder]: For program point L431-1(line 431) no Hoare annotation was computed. [2021-11-23 01:54:57,926 INFO L854 garLoopResultBuilder]: At program point L811(line 811) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2021-11-23 01:54:57,926 INFO L854 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2021-11-23 01:54:57,927 INFO L854 garLoopResultBuilder]: At program point L200-1(lines 156 208) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_st~0 0))) (or (and .cse0 .cse1 (= ~q_free~0 1) .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse3 (= ~c_last_read~0 ~p_last_write~0) (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse3 (= 2 ~p_dw_st~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2021-11-23 01:54:57,927 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 228 247) the Hoare annotation is: true [2021-11-23 01:54:57,927 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2021-11-23 01:54:57,927 INFO L861 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2021-11-23 01:54:57,927 INFO L858 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2021-11-23 01:54:57,928 INFO L858 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2021-11-23 01:54:57,928 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 554 573) the Hoare annotation is: true [2021-11-23 01:54:57,928 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 554 573) no Hoare annotation was computed. [2021-11-23 01:54:57,928 INFO L858 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 653 680) no Hoare annotation was computed. [2021-11-23 01:54:57,928 INFO L854 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 653 680) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 0)) (.cse11 (= ~E_M~0 2))) (let ((.cse3 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse13 (and .cse11 (= ~E_1~0 2))) (.cse1 (not (= ~c_dr_pc~0 0))) (.cse14 (not (<= ~token~0 ~local~0))) (.cse15 (not (= 2 |old(~E_1~0)|))) (.cse4 (not (= 2 |old(~E_M~0)|))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse10 (not (= ~q_free~0 0))) (.cse16 (not (<= ~local~0 ~token~0))) (.cse17 (and (not (= ~m_st~0 |old(~E_M~0)|)) (not .cse2))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 2 |old(~E_1~0)|)) (= ~m_pc~0 1) .cse9 .cse10 (and (= ~E_1~0 |old(~E_1~0)|) .cse11) .cse12) (or .cse0 .cse13 .cse1 .cse14 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 .cse12) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse13 .cse1 .cse14 .cse15 (not (= ~m_pc~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 (not (= ~t1_st~0 0)) .cse12)))) [2021-11-23 01:54:57,932 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:54:57,934 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 01:54:58,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:54:58 BoogieIcfgContainer [2021-11-23 01:54:58,039 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 01:54:58,040 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 01:54:58,040 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 01:54:58,040 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 01:54:58,041 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:41" (3/4) ... [2021-11-23 01:54:58,046 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-23 01:54:58,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-11-23 01:54:58,054 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2021-11-23 01:54:58,054 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2021-11-23 01:54:58,054 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2021-11-23 01:54:58,054 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2021-11-23 01:54:58,055 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2021-11-23 01:54:58,055 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2021-11-23 01:54:58,055 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2021-11-23 01:54:58,055 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2021-11-23 01:54:58,083 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 69 nodes and edges [2021-11-23 01:54:58,086 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2021-11-23 01:54:58,087 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-23 01:54:58,089 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-23 01:54:58,128 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) && ((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(E_M == 1))) && ((((((((((((((((!(p_dw_st == 0) || ((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || (((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || !(E_M == 1))) && ((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(local <= token)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(c_last_read == p_last_write))) && (((((((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && m_st == \old(m_st)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) || !(p_dw_st == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) [2021-11-23 01:54:58,139 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || (((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && (((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || ((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(E_1 == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((m_st == \old(m_st) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(c_last_read == p_last_write))) && ((((((((((((((((!(p_dw_st == 0) || ((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || ((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(q_free == 0)) || !(local < token)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || !(E_M == 1))) && ((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || (((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(E_M == 1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((m_st == \old(m_st) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(E_1 == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(p_dw_st == 0) || ((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_free == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) [2021-11-23 01:54:58,139 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && token <= local + 1) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && local < token)) || (((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) [2021-11-23 01:54:58,140 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) [2021-11-23 01:54:58,144 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(m_pc == t1_pc) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(\old(p_dw_st) == 2)) || !(p_num_write <= c_num_read)) || m_pc == 1) || 2 == p_dw_st) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write) [2021-11-23 01:54:58,246 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/witness.graphml [2021-11-23 01:54:58,247 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 01:54:58,248 INFO L158 Benchmark]: Toolchain (without parser) took 137982.11ms. Allocated memory was 86.0MB in the beginning and 824.2MB in the end (delta: 738.2MB). Free memory was 50.6MB in the beginning and 293.5MB in the end (delta: -242.9MB). Peak memory consumption was 496.3MB. Max. memory is 16.1GB. [2021-11-23 01:54:58,248 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 86.0MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 01:54:58,254 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.53ms. Allocated memory was 86.0MB in the beginning and 107.0MB in the end (delta: 21.0MB). Free memory was 50.4MB in the beginning and 78.5MB in the end (delta: -28.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-23 01:54:58,255 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.20ms. Allocated memory is still 107.0MB. Free memory was 78.5MB in the beginning and 75.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 01:54:58,255 INFO L158 Benchmark]: Boogie Preprocessor took 72.21ms. Allocated memory is still 107.0MB. Free memory was 75.8MB in the beginning and 73.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 01:54:58,256 INFO L158 Benchmark]: RCFGBuilder took 1010.25ms. Allocated memory is still 107.0MB. Free memory was 73.3MB in the beginning and 41.4MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2021-11-23 01:54:58,257 INFO L158 Benchmark]: TraceAbstraction took 136055.44ms. Allocated memory was 107.0MB in the beginning and 824.2MB in the end (delta: 717.2MB). Free memory was 41.0MB in the beginning and 305.1MB in the end (delta: -264.1MB). Peak memory consumption was 484.3MB. Max. memory is 16.1GB. [2021-11-23 01:54:58,260 INFO L158 Benchmark]: Witness Printer took 207.20ms. Allocated memory is still 824.2MB. Free memory was 305.1MB in the beginning and 293.5MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-23 01:54:58,267 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 86.0MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.53ms. Allocated memory was 86.0MB in the beginning and 107.0MB in the end (delta: 21.0MB). Free memory was 50.4MB in the beginning and 78.5MB in the end (delta: -28.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.20ms. Allocated memory is still 107.0MB. Free memory was 78.5MB in the beginning and 75.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.21ms. Allocated memory is still 107.0MB. Free memory was 75.8MB in the beginning and 73.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1010.25ms. Allocated memory is still 107.0MB. Free memory was 73.3MB in the beginning and 41.4MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 136055.44ms. Allocated memory was 107.0MB in the beginning and 824.2MB in the end (delta: 717.2MB). Free memory was 41.0MB in the beginning and 305.1MB in the end (delta: -264.1MB). Peak memory consumption was 484.3MB. Max. memory is 16.1GB. * Witness Printer took 207.20ms. Allocated memory is still 824.2MB. Free memory was 305.1MB in the beginning and 293.5MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 390]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 27]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 135.8s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4994 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4948 mSDsluCounter, 7639 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5402 mSDsCounter, 2195 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5836 IncrementalHoareTripleChecker+Invalid, 8031 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2195 mSolverCounterUnsat, 2949 mSDtfsCounter, 5836 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2142 GetRequests, 1654 SyntacticMatches, 23 SemanticMatches, 465 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21064 ImplicationChecksByTransitivity, 59.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1131occurred in iteration=17, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 1972 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 59 LocationsWithAnnotation, 2067 PreInvPairs, 2399 NumberOfFragments, 7676 HoareAnnotationTreeSize, 2067 FomulaSimplifications, 4807 FormulaSimplificationTreeSizeReduction, 3.3s HoareSimplificationTime, 59 FomulaSimplificationsInter, 236404 FormulaSimplificationTreeSizeReductionInter, 13.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2305 NumberOfCodeBlocks, 2270 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2774 ConstructedInterpolants, 0 QuantifiedInterpolants, 6119 SizeOfPredicates, 19 NumberOfNonLiveVariables, 3579 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 35 InterpolantComputations, 17 PerfectInterpolantSequences, 1623/1806 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && c_num_read < p_num_write + 1 - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && (m_st == E_M || m_st == 0)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || (((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2)) || (((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && (m_st == E_M || m_st == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) && ((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(E_M == 1))) && ((((((((((((((((!(p_dw_st == 0) || ((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || (((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || !(E_M == 1))) && ((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(local <= token)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(c_last_read == p_last_write))) && (((((((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && m_st == \old(m_st)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) || !(p_dw_st == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && local < token) || ((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2)) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && t1_st == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && !(tmp == 0)) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 783]: Loop Invariant Derived loop invariant: p_dw_st == 0 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && token <= local + 1) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && local < token)) || (((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2)) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && (m_st == E_M || m_st == 0)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2)) || ((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && token <= local + 1) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && local < token) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((!(m_pc == t1_pc) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(\old(p_dw_st) == 2)) || !(p_num_write <= c_num_read)) || m_pc == 1) || 2 == p_dw_st) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && local < token - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 770]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && (m_st == E_M || m_st == 0)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || (((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && (((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || ((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(E_1 == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((m_st == \old(m_st) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(c_last_read == p_last_write))) && ((((((((((((((((!(p_dw_st == 0) || ((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || ((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(q_free == 0)) || !(local < token)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || !(E_M == 1))) && ((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || (((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(E_M == 1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((m_st == \old(m_st) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(E_1 == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(p_dw_st == 0) || ((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_free == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) || ((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && c_num_read < p_num_write + 1) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((p_last_write == q_buf_0 && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) || (((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((p_last_write == q_buf_0 && m_pc == t1_pc) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && c_num_read < p_num_write + 1 - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) || ((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && c_num_read < p_num_write + 1) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && p_num_write <= c_num_read + 1) || (((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && c_num_read < p_num_write + 1) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 817]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && (m_st == E_M || m_st == 0)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) || ((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && c_num_read < p_num_write + 1) - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: ((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) || ((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && c_num_read < p_num_write + 1) - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || (((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 791]: Loop Invariant Derived loop invariant: (((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 856]: Loop Invariant Derived loop invariant: ((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 821]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && (m_st == E_M || m_st == 0)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) - InvariantResult [Line: 795]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && (m_st == E_M || m_st == 0)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) RESULT: Ultimate proved your program to be correct! [2021-11-23 01:54:58,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3cdf9f5-36cf-413d-8cf1-0bd3959a3c6e/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE