./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix010_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1f53ec31-0128-4e62-9234-2d71f5100035/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1f53ec31-0128-4e62-9234-2d71f5100035/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1f53ec31-0128-4e62-9234-2d71f5100035/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1f53ec31-0128-4e62-9234-2d71f5100035/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix010_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1f53ec31-0128-4e62-9234-2d71f5100035/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1f53ec31-0128-4e62-9234-2d71f5100035/bin/utaipan --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 36586c86009e8ee4c47c830677c0da0337f416de .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-22 13:08:10,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-22 13:08:10,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-22 13:08:10,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-22 13:08:10,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-22 13:08:10,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-22 13:08:10,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-22 13:08:10,777 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-22 13:08:10,780 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-22 13:08:10,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-22 13:08:10,787 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-22 13:08:10,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-22 13:08:10,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-22 13:08:10,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-22 13:08:10,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-22 13:08:10,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-22 13:08:10,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-22 13:08:10,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-22 13:08:10,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-22 13:08:10,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-22 13:08:10,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-22 13:08:10,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-22 13:08:10,817 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-22 13:08:10,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-22 13:08:10,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-22 13:08:10,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-22 13:08:10,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-22 13:08:10,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-22 13:08:10,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-22 13:08:10,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-22 13:08:10,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-22 13:08:10,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-22 13:08:10,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-22 13:08:10,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-22 13:08:10,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-22 13:08:10,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-22 13:08:10,839 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-22 13:08:10,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-22 13:08:10,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-22 13:08:10,840 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-22 13:08:10,841 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-22 13:08:10,844 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1f53ec31-0128-4e62-9234-2d71f5100035/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-22 13:08:10,881 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-22 13:08:10,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-22 13:08:10,883 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-22 13:08:10,883 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-22 13:08:10,884 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-22 13:08:10,884 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-22 13:08:10,884 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-22 13:08:10,884 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-22 13:08:10,885 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-22 13:08:10,885 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-22 13:08:10,886 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-22 13:08:10,886 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-22 13:08:10,887 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-22 13:08:10,887 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-22 13:08:10,887 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-22 13:08:10,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-22 13:08:10,888 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-22 13:08:10,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-22 13:08:10,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-22 13:08:10,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-22 13:08:10,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-22 13:08:10,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-22 13:08:10,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-22 13:08:10,890 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-22 13:08:10,891 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-22 13:08:10,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-22 13:08:10,891 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-22 13:08:10,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-22 13:08:10,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-22 13:08:10,892 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-22 13:08:10,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-22 13:08:10,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-22 13:08:10,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-22 13:08:10,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-22 13:08:10,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-22 13:08:10,894 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-22 13:08:10,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-22 13:08:10,894 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-22 13:08:10,895 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-22 13:08:10,895 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-22 13:08:10,895 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-vcloud-master/worker/run_dir_1f53ec31-0128-4e62-9234-2d71f5100035/bin/utaipan/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-vcloud-master/worker/run_dir_1f53ec31-0128-4e62-9234-2d71f5100035/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(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 -> 36586c86009e8ee4c47c830677c0da0337f416de [2020-11-22 13:08:11,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-22 13:08:11,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-22 13:08:11,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-22 13:08:11,225 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-22 13:08:11,226 INFO L275 PluginConnector]: CDTParser initialized [2020-11-22 13:08:11,227 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1f53ec31-0128-4e62-9234-2d71f5100035/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix010_tso.opt.i [2020-11-22 13:08:11,301 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f53ec31-0128-4e62-9234-2d71f5100035/bin/utaipan/data/65e965d0a/50e9c6ad1ed0419dbcea0e6e19549d31/FLAGcc09c70e3 [2020-11-22 13:08:11,780 INFO L306 CDTParser]: Found 1 translation units. [2020-11-22 13:08:11,780 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1f53ec31-0128-4e62-9234-2d71f5100035/sv-benchmarks/c/pthread-wmm/mix010_tso.opt.i [2020-11-22 13:08:11,813 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f53ec31-0128-4e62-9234-2d71f5100035/bin/utaipan/data/65e965d0a/50e9c6ad1ed0419dbcea0e6e19549d31/FLAGcc09c70e3 [2020-11-22 13:08:12,095 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1f53ec31-0128-4e62-9234-2d71f5100035/bin/utaipan/data/65e965d0a/50e9c6ad1ed0419dbcea0e6e19549d31 [2020-11-22 13:08:12,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-22 13:08:12,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-22 13:08:12,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-22 13:08:12,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-22 13:08:12,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-22 13:08:12,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:08:12" (1/1) ... [2020-11-22 13:08:12,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@118ab07c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:12, skipping insertion in model container [2020-11-22 13:08:12,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:08:12" (1/1) ... [2020-11-22 13:08:12,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-22 13:08:12,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-22 13:08:12,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-22 13:08:12,666 INFO L203 MainTranslator]: Completed pre-run [2020-11-22 13:08:12,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-22 13:08:12,826 INFO L208 MainTranslator]: Completed translation [2020-11-22 13:08:12,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:12 WrapperNode [2020-11-22 13:08:12,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-22 13:08:12,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-22 13:08:12,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-22 13:08:12,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-22 13:08:12,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:12" (1/1) ... [2020-11-22 13:08:12,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:12" (1/1) ... [2020-11-22 13:08:12,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-22 13:08:12,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-22 13:08:12,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-22 13:08:12,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-22 13:08:12,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:12" (1/1) ... [2020-11-22 13:08:12,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:12" (1/1) ... [2020-11-22 13:08:12,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:12" (1/1) ... [2020-11-22 13:08:12,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:12" (1/1) ... [2020-11-22 13:08:12,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:12" (1/1) ... [2020-11-22 13:08:12,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:12" (1/1) ... [2020-11-22 13:08:12,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:12" (1/1) ... [2020-11-22 13:08:12,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-22 13:08:12,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-22 13:08:12,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-22 13:08:12,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-22 13:08:12,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f53ec31-0128-4e62-9234-2d71f5100035/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-22 13:08:13,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-22 13:08:13,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-22 13:08:13,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-22 13:08:13,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-22 13:08:13,075 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-22 13:08:13,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-22 13:08:13,075 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-22 13:08:13,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-22 13:08:13,076 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-22 13:08:13,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-22 13:08:13,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-22 13:08:13,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-22 13:08:13,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-22 13:08:13,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-22 13:08:13,078 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-22 13:08:16,241 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-22 13:08:16,242 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-22 13:08:16,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:08:16 BoogieIcfgContainer [2020-11-22 13:08:16,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-22 13:08:16,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-22 13:08:16,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-22 13:08:16,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-22 13:08:16,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:08:12" (1/3) ... [2020-11-22 13:08:16,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435a423a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:08:16, skipping insertion in model container [2020-11-22 13:08:16,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:12" (2/3) ... [2020-11-22 13:08:16,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435a423a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:08:16, skipping insertion in model container [2020-11-22 13:08:16,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:08:16" (3/3) ... [2020-11-22 13:08:16,253 INFO L111 eAbstractionObserver]: Analyzing ICFG mix010_tso.opt.i [2020-11-22 13:08:16,268 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-22 13:08:16,268 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-22 13:08:16,273 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-22 13:08:16,274 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-22 13:08:16,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,323 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,323 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,324 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,324 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,336 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,337 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,337 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,338 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,371 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,373 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,376 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,377 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,379 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 13:08:16,385 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-22 13:08:16,396 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-22 13:08:16,424 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-22 13:08:16,424 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-22 13:08:16,424 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-22 13:08:16,424 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-22 13:08:16,424 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-22 13:08:16,424 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-22 13:08:16,424 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-22 13:08:16,424 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-22 13:08:16,438 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-22 13:08:16,440 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 107 transitions, 229 flow [2020-11-22 13:08:16,443 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 107 transitions, 229 flow [2020-11-22 13:08:16,445 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 114 places, 107 transitions, 229 flow [2020-11-22 13:08:16,506 INFO L129 PetriNetUnfolder]: 3/104 cut-off events. [2020-11-22 13:08:16,507 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-22 13:08:16,511 INFO L80 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 3/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2020-11-22 13:08:16,516 INFO L116 LiptonReduction]: Number of co-enabled transitions 1934 [2020-11-22 13:08:17,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:17,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-22 13:08:17,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:08:17,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:17,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:17,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:17,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:17,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:17,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:17,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:17,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:17,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:17,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:08:17,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:17,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:17,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:17,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:17,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:17,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:17,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:17,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:17,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:17,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:17,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:08:17,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:17,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:08:17,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:17,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:17,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:17,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:17,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:17,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:08:17,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:17,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:08:17,776 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-22 13:08:17,909 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-22 13:08:17,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 13:08:17,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:18,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:18,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-22 13:08:18,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:08:18,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:18,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:18,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:18,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:18,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:18,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:18,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:18,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:18,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:18,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:08:18,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:18,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:18,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:18,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:18,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:18,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:18,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:18,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:18,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:18,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:18,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:08:18,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:18,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:08:18,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:18,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:18,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:18,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:18,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:18,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:08:18,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:18,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:08:18,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:18,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:18,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:18,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:18,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:18,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:18,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:18,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:18,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:08:18,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:18,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:18,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:18,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:18,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:18,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:18,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-22 13:08:18,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:08:18,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:18,635 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-22 13:08:19,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:19,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:19,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:19,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:19,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:19,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:19,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:19,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:19,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:19,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:19,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:19,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:19,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:19,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:08:19,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:19,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:08:19,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:19,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:19,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:19,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:19,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:19,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:19,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:19,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:19,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:08:19,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:19,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:19,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:19,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:19,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:19,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:19,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-22 13:08:19,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:08:19,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:19,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:19,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-22 13:08:19,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:08:19,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:19,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:19,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:19,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:19,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:19,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:19,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:19,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:19,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:19,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:08:19,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:19,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:19,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:19,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:19,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:19,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:19,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-22 13:08:19,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:08:19,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:19,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:19,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:19,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:19,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:19,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:19,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:19,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:19,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:19,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:08:19,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:19,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:19,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:19,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:19,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:19,927 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-22 13:08:20,046 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-22 13:08:20,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:08:20,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:20,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-22 13:08:20,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:20,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-22 13:08:20,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:20,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:20,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:20,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:20,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:20,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:20,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:20,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:20,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:20,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:20,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:20,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:20,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:20,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:20,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:08:20,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:20,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:08:20,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:20,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:20,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:20,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:20,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:20,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:20,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:20,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:20,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:08:20,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:20,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:20,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:20,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:20,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:20,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:20,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-22 13:08:20,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:08:20,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:20,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:08:20,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:20,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-22 13:08:20,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:20,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-22 13:08:20,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:20,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:20,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:20,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:20,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:20,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:20,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:08:20,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:20,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:08:20,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:20,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:20,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:20,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:20,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:20,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:20,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:20,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:20,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:20,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-22 13:08:20,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:08:20,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:20,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:20,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:20,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:20,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:20,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:20,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:20,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:20,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:20,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:08:20,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:20,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:20,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:20,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:20,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:21,224 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-11-22 13:08:21,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:21,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-22 13:08:21,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:08:21,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:21,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:21,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:21,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:21,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:21,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:21,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:21,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:21,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:21,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:08:21,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:21,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:21,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:21,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:21,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:21,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:21,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:21,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:21,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:21,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:21,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:21,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 13:08:21,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 13:08:21,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-22 13:08:21,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:21,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:21,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:21,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:21,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:21,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 13:08:21,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-22 13:08:21,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-22 13:08:21,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:21,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:21,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:21,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:21,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:21,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:21,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:21,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:21,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:21,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:21,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:21,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:21,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:21,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:21,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:08:21,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:21,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:08:21,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:21,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:21,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:21,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:21,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:21,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:08:21,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:21,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 13:08:21,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:21,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:21,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:21,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 13:08:21,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 13:08:21,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:21,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-22 13:08:21,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 13:08:22,613 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-11-22 13:08:22,838 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-11-22 13:08:23,359 WARN L193 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-22 13:08:23,561 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-22 13:08:23,620 INFO L131 LiptonReduction]: Checked pairs total: 4860 [2020-11-22 13:08:23,620 INFO L133 LiptonReduction]: Total number of compositions: 94 [2020-11-22 13:08:23,625 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-11-22 13:08:23,688 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 750 states. [2020-11-22 13:08:23,690 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states. [2020-11-22 13:08:23,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-22 13:08:23,697 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:08:23,697 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:08:23,698 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:08:23,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:08:23,703 INFO L82 PathProgramCache]: Analyzing trace with hash 752030810, now seen corresponding path program 1 times [2020-11-22 13:08:23,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:08:23,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243632542] [2020-11-22 13:08:23,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:08:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:08:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:08:24,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243632542] [2020-11-22 13:08:24,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:08:24,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-22 13:08:24,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142858738] [2020-11-22 13:08:24,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:08:24,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:08:24,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:08:24,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:08:24,052 INFO L87 Difference]: Start difference. First operand 750 states. Second operand 3 states. [2020-11-22 13:08:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:08:24,136 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-11-22 13:08:24,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:08:24,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-22 13:08:24,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:08:24,158 INFO L225 Difference]: With dead ends: 650 [2020-11-22 13:08:24,158 INFO L226 Difference]: Without dead ends: 530 [2020-11-22 13:08:24,159 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:08:24,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-11-22 13:08:24,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-11-22 13:08:24,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-11-22 13:08:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions. [2020-11-22 13:08:24,239 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 7 [2020-11-22 13:08:24,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:08:24,240 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions. [2020-11-22 13:08:24,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:08:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions. [2020-11-22 13:08:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-22 13:08:24,242 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:08:24,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:08:24,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-22 13:08:24,242 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:08:24,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:08:24,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1147137475, now seen corresponding path program 1 times [2020-11-22 13:08:24,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:08:24,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061376767] [2020-11-22 13:08:24,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:08:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:08:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:08:24,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061376767] [2020-11-22 13:08:24,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:08:24,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-22 13:08:24,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838888047] [2020-11-22 13:08:24,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:08:24,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:08:24,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:08:24,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:08:24,323 INFO L87 Difference]: Start difference. First operand 530 states and 1622 transitions. Second operand 3 states. [2020-11-22 13:08:24,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:08:24,339 INFO L93 Difference]: Finished difference Result 490 states and 1480 transitions. [2020-11-22 13:08:24,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:08:24,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-22 13:08:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:08:24,346 INFO L225 Difference]: With dead ends: 490 [2020-11-22 13:08:24,346 INFO L226 Difference]: Without dead ends: 490 [2020-11-22 13:08:24,346 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:08:24,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2020-11-22 13:08:24,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2020-11-22 13:08:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2020-11-22 13:08:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1480 transitions. [2020-11-22 13:08:24,374 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1480 transitions. Word has length 9 [2020-11-22 13:08:24,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:08:24,374 INFO L481 AbstractCegarLoop]: Abstraction has 490 states and 1480 transitions. [2020-11-22 13:08:24,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:08:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1480 transitions. [2020-11-22 13:08:24,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-22 13:08:24,377 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:08:24,377 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:08:24,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-22 13:08:24,378 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:08:24,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:08:24,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1407487786, now seen corresponding path program 1 times [2020-11-22 13:08:24,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:08:24,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522197279] [2020-11-22 13:08:24,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:08:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:08:24,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:08:24,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522197279] [2020-11-22 13:08:24,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:08:24,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-22 13:08:24,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857484339] [2020-11-22 13:08:24,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:08:24,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:08:24,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:08:24,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:08:24,459 INFO L87 Difference]: Start difference. First operand 490 states and 1480 transitions. Second operand 3 states. [2020-11-22 13:08:24,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:08:24,469 INFO L93 Difference]: Finished difference Result 458 states and 1368 transitions. [2020-11-22 13:08:24,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:08:24,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-22 13:08:24,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:08:24,474 INFO L225 Difference]: With dead ends: 458 [2020-11-22 13:08:24,474 INFO L226 Difference]: Without dead ends: 458 [2020-11-22 13:08:24,475 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:08:24,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-11-22 13:08:24,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2020-11-22 13:08:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-11-22 13:08:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1368 transitions. [2020-11-22 13:08:24,493 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1368 transitions. Word has length 11 [2020-11-22 13:08:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:08:24,493 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 1368 transitions. [2020-11-22 13:08:24,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:08:24,494 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1368 transitions. [2020-11-22 13:08:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-22 13:08:24,497 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:08:24,497 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:08:24,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-22 13:08:24,497 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:08:24,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:08:24,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1511864482, now seen corresponding path program 1 times [2020-11-22 13:08:24,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:08:24,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301041610] [2020-11-22 13:08:24,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:08:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:08:24,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:08:24,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301041610] [2020-11-22 13:08:24,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:08:24,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 13:08:24,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387515905] [2020-11-22 13:08:24,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 13:08:24,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:08:24,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 13:08:24,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 13:08:24,615 INFO L87 Difference]: Start difference. First operand 458 states and 1368 transitions. Second operand 4 states. [2020-11-22 13:08:24,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:08:24,656 INFO L93 Difference]: Finished difference Result 440 states and 1162 transitions. [2020-11-22 13:08:24,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-22 13:08:24,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-22 13:08:24,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:08:24,659 INFO L225 Difference]: With dead ends: 440 [2020-11-22 13:08:24,659 INFO L226 Difference]: Without dead ends: 320 [2020-11-22 13:08:24,660 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-22 13:08:24,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-11-22 13:08:24,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2020-11-22 13:08:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2020-11-22 13:08:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 816 transitions. [2020-11-22 13:08:24,670 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 816 transitions. Word has length 13 [2020-11-22 13:08:24,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:08:24,671 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 816 transitions. [2020-11-22 13:08:24,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 13:08:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 816 transitions. [2020-11-22 13:08:24,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-22 13:08:24,672 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:08:24,672 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:08:24,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-22 13:08:24,672 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:08:24,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:08:24,673 INFO L82 PathProgramCache]: Analyzing trace with hash -436809353, now seen corresponding path program 1 times [2020-11-22 13:08:24,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:08:24,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481005053] [2020-11-22 13:08:24,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:08:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:08:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:08:24,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481005053] [2020-11-22 13:08:24,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:08:24,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 13:08:24,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571661889] [2020-11-22 13:08:24,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 13:08:24,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:08:24,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 13:08:24,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-22 13:08:24,872 INFO L87 Difference]: Start difference. First operand 320 states and 816 transitions. Second operand 5 states. [2020-11-22 13:08:24,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:08:24,924 INFO L93 Difference]: Finished difference Result 265 states and 624 transitions. [2020-11-22 13:08:24,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 13:08:24,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-22 13:08:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:08:24,928 INFO L225 Difference]: With dead ends: 265 [2020-11-22 13:08:24,928 INFO L226 Difference]: Without dead ends: 205 [2020-11-22 13:08:24,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-22 13:08:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-11-22 13:08:24,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2020-11-22 13:08:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-11-22 13:08:24,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 471 transitions. [2020-11-22 13:08:24,934 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 471 transitions. Word has length 15 [2020-11-22 13:08:24,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:08:24,935 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 471 transitions. [2020-11-22 13:08:24,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 13:08:24,935 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 471 transitions. [2020-11-22 13:08:24,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-22 13:08:24,936 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:08:24,936 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:08:24,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-22 13:08:24,936 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:08:24,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:08:24,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1855195379, now seen corresponding path program 1 times [2020-11-22 13:08:24,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:08:24,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606801837] [2020-11-22 13:08:24,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:08:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:08:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:08:25,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606801837] [2020-11-22 13:08:25,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:08:25,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-22 13:08:25,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032139489] [2020-11-22 13:08:25,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 13:08:25,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:08:25,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 13:08:25,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 13:08:25,122 INFO L87 Difference]: Start difference. First operand 205 states and 471 transitions. Second operand 6 states. [2020-11-22 13:08:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:08:25,233 INFO L93 Difference]: Finished difference Result 186 states and 431 transitions. [2020-11-22 13:08:25,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 13:08:25,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-22 13:08:25,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:08:25,236 INFO L225 Difference]: With dead ends: 186 [2020-11-22 13:08:25,236 INFO L226 Difference]: Without dead ends: 173 [2020-11-22 13:08:25,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-22 13:08:25,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-11-22 13:08:25,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2020-11-22 13:08:25,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-11-22 13:08:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 407 transitions. [2020-11-22 13:08:25,245 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 407 transitions. Word has length 18 [2020-11-22 13:08:25,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:08:25,245 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 407 transitions. [2020-11-22 13:08:25,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 13:08:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 407 transitions. [2020-11-22 13:08:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-22 13:08:25,246 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:08:25,246 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:08:25,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-22 13:08:25,247 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:08:25,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:08:25,247 INFO L82 PathProgramCache]: Analyzing trace with hash -704031837, now seen corresponding path program 1 times [2020-11-22 13:08:25,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:08:25,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607591720] [2020-11-22 13:08:25,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:08:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:08:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:08:25,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607591720] [2020-11-22 13:08:25,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:08:25,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 13:08:25,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401723960] [2020-11-22 13:08:25,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 13:08:25,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:08:25,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 13:08:25,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 13:08:25,323 INFO L87 Difference]: Start difference. First operand 173 states and 407 transitions. Second operand 4 states. [2020-11-22 13:08:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:08:25,338 INFO L93 Difference]: Finished difference Result 220 states and 505 transitions. [2020-11-22 13:08:25,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-22 13:08:25,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-11-22 13:08:25,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:08:25,339 INFO L225 Difference]: With dead ends: 220 [2020-11-22 13:08:25,340 INFO L226 Difference]: Without dead ends: 92 [2020-11-22 13:08:25,340 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-22 13:08:25,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-22 13:08:25,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-11-22 13:08:25,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-22 13:08:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 185 transitions. [2020-11-22 13:08:25,342 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 185 transitions. Word has length 21 [2020-11-22 13:08:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:08:25,342 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 185 transitions. [2020-11-22 13:08:25,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 13:08:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 185 transitions. [2020-11-22 13:08:25,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-22 13:08:25,343 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:08:25,343 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:08:25,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-22 13:08:25,343 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:08:25,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:08:25,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1611026149, now seen corresponding path program 2 times [2020-11-22 13:08:25,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:08:25,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109805098] [2020-11-22 13:08:25,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:08:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:08:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:08:25,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109805098] [2020-11-22 13:08:25,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:08:25,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 13:08:25,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306609527] [2020-11-22 13:08:25,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 13:08:25,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:08:25,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 13:08:25,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 13:08:25,403 INFO L87 Difference]: Start difference. First operand 92 states and 185 transitions. Second operand 4 states. [2020-11-22 13:08:25,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:08:25,419 INFO L93 Difference]: Finished difference Result 118 states and 233 transitions. [2020-11-22 13:08:25,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-22 13:08:25,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-11-22 13:08:25,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:08:25,420 INFO L225 Difference]: With dead ends: 118 [2020-11-22 13:08:25,420 INFO L226 Difference]: Without dead ends: 48 [2020-11-22 13:08:25,420 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-22 13:08:25,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-11-22 13:08:25,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-11-22 13:08:25,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-11-22 13:08:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2020-11-22 13:08:25,422 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 21 [2020-11-22 13:08:25,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:08:25,422 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2020-11-22 13:08:25,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 13:08:25,422 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2020-11-22 13:08:25,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-22 13:08:25,422 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:08:25,422 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:08:25,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-22 13:08:25,423 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:08:25,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:08:25,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1296681401, now seen corresponding path program 3 times [2020-11-22 13:08:25,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:08:25,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188692588] [2020-11-22 13:08:25,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:08:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:08:25,817 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 31 [2020-11-22 13:08:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:08:25,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188692588] [2020-11-22 13:08:25,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:08:25,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-22 13:08:25,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320818774] [2020-11-22 13:08:25,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-22 13:08:25,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:08:25,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-22 13:08:25,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-22 13:08:25,938 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 7 states. [2020-11-22 13:08:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:08:26,110 INFO L93 Difference]: Finished difference Result 58 states and 95 transitions. [2020-11-22 13:08:26,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-22 13:08:26,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-11-22 13:08:26,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:08:26,111 INFO L225 Difference]: With dead ends: 58 [2020-11-22 13:08:26,111 INFO L226 Difference]: Without dead ends: 32 [2020-11-22 13:08:26,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-22 13:08:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-22 13:08:26,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-22 13:08:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-22 13:08:26,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2020-11-22 13:08:26,113 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 21 [2020-11-22 13:08:26,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:08:26,113 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-11-22 13:08:26,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-22 13:08:26,114 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2020-11-22 13:08:26,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-22 13:08:26,114 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:08:26,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:08:26,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-22 13:08:26,114 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:08:26,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:08:26,115 INFO L82 PathProgramCache]: Analyzing trace with hash -180105159, now seen corresponding path program 4 times [2020-11-22 13:08:26,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:08:26,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900331612] [2020-11-22 13:08:26,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:08:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-22 13:08:26,170 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-22 13:08:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-22 13:08:26,254 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-22 13:08:26,303 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-22 13:08:26,304 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-22 13:08:26,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-22 13:08:26,305 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-22 13:08:26,324 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1203] [1203] L3-->L869: Formula: (let ((.cse9 (= 0 (mod ~z$r_buff1_thd0~0_In-754043396 256))) (.cse8 (= (mod ~z$w_buff1_used~0_In-754043396 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd0~0_In-754043396 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In-754043396 256) 0))) (let ((.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse5 (or .cse6 .cse7))) (and (= ~z$r_buff1_thd0~0_Out-754043396 ~z$r_buff1_thd0~0_In-754043396) (or (and .cse0 (= ~z$w_buff1_used~0_Out-754043396 0) .cse1) (and (= ~z$w_buff1_used~0_Out-754043396 ~z$w_buff1_used~0_In-754043396) .cse2)) (or (and .cse3 .cse4 (= ~z$w_buff0_used~0_Out-754043396 0)) (and (= ~z$w_buff0_used~0_Out-754043396 ~z$w_buff0_used~0_In-754043396) .cse5)) (= ~z$r_buff0_thd0~0_In-754043396 ~z$r_buff0_thd0~0_Out-754043396) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-754043396 0)) (or (and .cse3 .cse4 (= ~z~0_Out-754043396 ~z$w_buff0~0_In-754043396)) (and (or (and .cse0 (= ~z$w_buff1~0_In-754043396 ~z~0_Out-754043396) .cse1) (and (= ~z~0_In-754043396 ~z~0_Out-754043396) .cse2)) .cse5))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-754043396, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-754043396, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-754043396, ~z$w_buff0~0=~z$w_buff0~0_In-754043396, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-754043396, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-754043396, ~z$w_buff1~0=~z$w_buff1~0_In-754043396, ~z~0=~z~0_In-754043396} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-754043396, ~z$w_buff0~0=~z$w_buff0~0_In-754043396, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-754043396, ~z$w_buff1~0=~z$w_buff1~0_In-754043396, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-754043396|, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-754043396|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-754043396|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-754043396|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-754043396, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-754043396|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-754043396|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-754043396, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-754043396, ~z~0=~z~0_Out-754043396} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite63, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2020-11-22 13:08:26,333 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,334 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [799] [2020-11-22 13:08:26,334 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,334 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,335 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,335 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,335 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,335 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,335 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,336 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,336 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,336 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,336 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,336 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,337 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,337 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,337 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,338 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,338 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,338 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,338 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,338 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,339 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,339 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,339 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,339 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,339 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,339 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,341 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,341 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,345 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,345 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,346 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,346 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,346 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,346 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,346 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,347 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,347 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,348 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,348 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,348 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,348 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,348 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,348 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,349 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,350 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,350 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,350 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,350 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,350 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,351 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,351 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,351 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,351 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,351 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,351 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,352 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:08:26 BasicIcfg [2020-11-22 13:08:26,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-22 13:08:26,447 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-22 13:08:26,447 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-22 13:08:26,447 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-22 13:08:26,448 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:08:16" (3/4) ... [2020-11-22 13:08:26,450 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-22 13:08:26,464 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1203] [1203] L3-->L869: Formula: (let ((.cse9 (= 0 (mod ~z$r_buff1_thd0~0_In-754043396 256))) (.cse8 (= (mod ~z$w_buff1_used~0_In-754043396 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd0~0_In-754043396 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In-754043396 256) 0))) (let ((.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse5 (or .cse6 .cse7))) (and (= ~z$r_buff1_thd0~0_Out-754043396 ~z$r_buff1_thd0~0_In-754043396) (or (and .cse0 (= ~z$w_buff1_used~0_Out-754043396 0) .cse1) (and (= ~z$w_buff1_used~0_Out-754043396 ~z$w_buff1_used~0_In-754043396) .cse2)) (or (and .cse3 .cse4 (= ~z$w_buff0_used~0_Out-754043396 0)) (and (= ~z$w_buff0_used~0_Out-754043396 ~z$w_buff0_used~0_In-754043396) .cse5)) (= ~z$r_buff0_thd0~0_In-754043396 ~z$r_buff0_thd0~0_Out-754043396) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-754043396 0)) (or (and .cse3 .cse4 (= ~z~0_Out-754043396 ~z$w_buff0~0_In-754043396)) (and (or (and .cse0 (= ~z$w_buff1~0_In-754043396 ~z~0_Out-754043396) .cse1) (and (= ~z~0_In-754043396 ~z~0_Out-754043396) .cse2)) .cse5))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-754043396, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-754043396, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-754043396, ~z$w_buff0~0=~z$w_buff0~0_In-754043396, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-754043396, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-754043396, ~z$w_buff1~0=~z$w_buff1~0_In-754043396, ~z~0=~z~0_In-754043396} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-754043396, ~z$w_buff0~0=~z$w_buff0~0_In-754043396, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-754043396, ~z$w_buff1~0=~z$w_buff1~0_In-754043396, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-754043396|, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-754043396|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-754043396|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-754043396|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-754043396, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-754043396|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-754043396|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-754043396, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-754043396, ~z~0=~z~0_Out-754043396} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite63, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2020-11-22 13:08:26,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,467 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [799] [2020-11-22 13:08:26,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,470 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,470 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,470 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,470 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,476 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,476 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,476 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,476 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 13:08:26,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 13:08:26,579 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1f53ec31-0128-4e62-9234-2d71f5100035/bin/utaipan/witness.graphml [2020-11-22 13:08:26,579 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-22 13:08:26,580 INFO L168 Benchmark]: Toolchain (without parser) took 14479.83 ms. Allocated memory was 107.0 MB in the beginning and 251.7 MB in the end (delta: 144.7 MB). Free memory was 72.7 MB in the beginning and 166.2 MB in the end (delta: -93.5 MB). Peak memory consumption was 51.6 MB. Max. memory is 16.1 GB. [2020-11-22 13:08:26,580 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 107.0 MB. Free memory was 81.8 MB in the beginning and 81.8 MB in the end (delta: 25.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-22 13:08:26,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.03 ms. Allocated memory is still 107.0 MB. Free memory was 72.5 MB in the beginning and 59.2 MB in the end (delta: 13.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-22 13:08:26,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.04 ms. Allocated memory is still 107.0 MB. Free memory was 59.2 MB in the beginning and 55.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-22 13:08:26,582 INFO L168 Benchmark]: Boogie Preprocessor took 62.18 ms. Allocated memory is still 107.0 MB. Free memory was 55.9 MB in the beginning and 53.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-22 13:08:26,582 INFO L168 Benchmark]: RCFGBuilder took 3260.16 ms. Allocated memory was 107.0 MB in the beginning and 132.1 MB in the end (delta: 25.2 MB). Free memory was 53.4 MB in the beginning and 84.0 MB in the end (delta: -30.5 MB). Peak memory consumption was 48.1 MB. Max. memory is 16.1 GB. [2020-11-22 13:08:26,582 INFO L168 Benchmark]: TraceAbstraction took 10201.34 ms. Allocated memory was 132.1 MB in the beginning and 251.7 MB in the end (delta: 119.5 MB). Free memory was 84.0 MB in the beginning and 187.1 MB in the end (delta: -103.2 MB). Peak memory consumption was 129.7 MB. Max. memory is 16.1 GB. [2020-11-22 13:08:26,583 INFO L168 Benchmark]: Witness Printer took 132.06 ms. Allocated memory is still 251.7 MB. Free memory was 187.1 MB in the beginning and 166.2 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-22 13:08:26,585 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.23 ms. Allocated memory is still 107.0 MB. Free memory was 81.8 MB in the beginning and 81.8 MB in the end (delta: 25.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 724.03 ms. Allocated memory is still 107.0 MB. Free memory was 72.5 MB in the beginning and 59.2 MB in the end (delta: 13.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 92.04 ms. Allocated memory is still 107.0 MB. Free memory was 59.2 MB in the beginning and 55.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 62.18 ms. Allocated memory is still 107.0 MB. Free memory was 55.9 MB in the beginning and 53.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3260.16 ms. Allocated memory was 107.0 MB in the beginning and 132.1 MB in the end (delta: 25.2 MB). Free memory was 53.4 MB in the beginning and 84.0 MB in the end (delta: -30.5 MB). Peak memory consumption was 48.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10201.34 ms. Allocated memory was 132.1 MB in the beginning and 251.7 MB in the end (delta: 119.5 MB). Free memory was 84.0 MB in the beginning and 187.1 MB in the end (delta: -103.2 MB). Peak memory consumption was 129.7 MB. Max. memory is 16.1 GB. * Witness Printer took 132.06 ms. Allocated memory is still 251.7 MB. Free memory was 187.1 MB in the beginning and 166.2 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1343 VarBasedMoverChecksPositive, 73 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 56 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.6s, 150 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.1s, 114 PlacesBefore, 36 PlacesAfterwards, 107 TransitionsBefore, 27 TransitionsAfterwards, 1934 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 94 TotalNumberOfCompositions, 4860 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t278; [L854] FCALL, FORK 0 pthread_create(&t278, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t279; [L856] FCALL, FORK 0 pthread_create(&t279, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 pthread_t t280; [L858] FCALL, FORK 0 pthread_create(&t280, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L818] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1 [L818] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L818] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L821] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L821] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L822] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L822] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L831] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L831] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L831] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix010_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 105 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.8s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 210 SDtfs, 256 SDslu, 300 SDs, 0 SdLazy, 100 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=750occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 12433 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...