./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix047_tso.oepc.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_bee87725-6999-4336-b057-cc26a87c70e3/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_bee87725-6999-4336-b057-cc26a87c70e3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bee87725-6999-4336-b057-cc26a87c70e3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bee87725-6999-4336-b057-cc26a87c70e3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix047_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bee87725-6999-4336-b057-cc26a87c70e3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bee87725-6999-4336-b057-cc26a87c70e3/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6853f704c95b380044bf08f96bb699335cdd562 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-28 03:10:00,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:10:00,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:10:00,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:10:00,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:10:00,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:10:00,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:10:00,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:10:00,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:10:00,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:10:00,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:10:00,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:10:00,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:10:00,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:10:00,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:10:00,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:10:00,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:10:00,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:10:00,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:10:00,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:10:00,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:10:00,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:10:00,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:10:00,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:10:00,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:10:00,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:10:00,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:10:00,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:10:00,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:10:00,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:10:00,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:10:00,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:10:00,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:10:00,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:10:00,904 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:10:00,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:10:00,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:10:00,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:10:00,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:10:00,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:10:00,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:10:00,910 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bee87725-6999-4336-b057-cc26a87c70e3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:10:00,938 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:10:00,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:10:00,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:10:00,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:10:00,941 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:10:00,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:10:00,942 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:10:00,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:10:00,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:10:00,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:10:00,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:10:00,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:10:00,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:10:00,944 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:10:00,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:10:00,945 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:10:00,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:10:00,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:10:00,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:10:00,946 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:10:00,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:10:00,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:10:00,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:10:00,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:10:00,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:10:00,949 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:10:00,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:10:00,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:10:00,950 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:10:00,950 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_bee87725-6999-4336-b057-cc26a87c70e3/bin/uautomizer/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_bee87725-6999-4336-b057-cc26a87c70e3/bin/uautomizer 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 -> Automizer 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 -> f6853f704c95b380044bf08f96bb699335cdd562 [2020-11-28 03:10:01,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:10:01,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:10:01,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:10:01,322 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:10:01,325 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:10:01,326 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bee87725-6999-4336-b057-cc26a87c70e3/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix047_tso.oepc.i [2020-11-28 03:10:01,411 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bee87725-6999-4336-b057-cc26a87c70e3/bin/uautomizer/data/8b0d061b8/f45690e9eb124d609a48b89deb985ba0/FLAG79ff701eb [2020-11-28 03:10:02,238 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:10:02,239 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bee87725-6999-4336-b057-cc26a87c70e3/sv-benchmarks/c/pthread-wmm/mix047_tso.oepc.i [2020-11-28 03:10:02,259 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bee87725-6999-4336-b057-cc26a87c70e3/bin/uautomizer/data/8b0d061b8/f45690e9eb124d609a48b89deb985ba0/FLAG79ff701eb [2020-11-28 03:10:02,444 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bee87725-6999-4336-b057-cc26a87c70e3/bin/uautomizer/data/8b0d061b8/f45690e9eb124d609a48b89deb985ba0 [2020-11-28 03:10:02,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:10:02,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:10:02,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:10:02,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:10:02,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:10:02,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:10:02" (1/1) ... [2020-11-28 03:10:02,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d0e5707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:02, skipping insertion in model container [2020-11-28 03:10:02,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:10:02" (1/1) ... [2020-11-28 03:10:02,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:10:02,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:10:03,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:10:03,090 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:10:03,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:10:03,351 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:10:03,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:03 WrapperNode [2020-11-28 03:10:03,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:10:03,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:10:03,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:10:03,354 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:10:03,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:03" (1/1) ... [2020-11-28 03:10:03,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:03" (1/1) ... [2020-11-28 03:10:03,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:10:03,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:10:03,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:10:03,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:10:03,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:03" (1/1) ... [2020-11-28 03:10:03,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:03" (1/1) ... [2020-11-28 03:10:03,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:03" (1/1) ... [2020-11-28 03:10:03,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:03" (1/1) ... [2020-11-28 03:10:03,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:03" (1/1) ... [2020-11-28 03:10:03,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:03" (1/1) ... [2020-11-28 03:10:03,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:03" (1/1) ... [2020-11-28 03:10:03,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:10:03,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:10:03,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:10:03,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:10:03,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bee87725-6999-4336-b057-cc26a87c70e3/bin/uautomizer/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-28 03:10:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 03:10:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 03:10:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:10:03,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 03:10:03,660 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 03:10:03,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 03:10:03,660 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 03:10:03,661 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 03:10:03,661 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 03:10:03,661 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 03:10:03,661 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-28 03:10:03,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-28 03:10:03,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:10:03,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 03:10:03,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:10:03,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:10:03,665 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-28 03:10:06,665 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:10:06,665 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 03:10:06,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:10:06 BoogieIcfgContainer [2020-11-28 03:10:06,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:10:06,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:10:06,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:10:06,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:10:06,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:10:02" (1/3) ... [2020-11-28 03:10:06,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3008ba8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:10:06, skipping insertion in model container [2020-11-28 03:10:06,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:03" (2/3) ... [2020-11-28 03:10:06,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3008ba8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:10:06, skipping insertion in model container [2020-11-28 03:10:06,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:10:06" (3/3) ... [2020-11-28 03:10:06,683 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_tso.oepc.i [2020-11-28 03:10:06,697 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 03:10:06,697 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:10:06,703 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 03:10:06,704 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 03:10:06,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,772 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,772 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,774 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,774 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,775 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,776 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,784 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,786 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,786 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,786 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,786 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,788 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,788 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,789 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,789 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,790 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,790 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,790 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,790 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,791 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,792 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,792 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,792 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,792 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,792 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,793 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,793 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,794 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,797 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,797 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,797 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,798 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,804 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,805 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,806 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,806 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,806 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,806 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,806 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,806 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,807 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,807 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,810 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,811 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,814 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,814 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:10:06,817 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 03:10:06,832 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-28 03:10:06,872 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:10:06,873 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:10:06,873 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:10:06,873 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:10:06,874 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:10:06,874 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:10:06,874 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:10:06,875 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:10:06,895 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 03:10:06,901 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 120 transitions, 260 flow [2020-11-28 03:10:06,905 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 120 transitions, 260 flow [2020-11-28 03:10:06,908 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 130 places, 120 transitions, 260 flow [2020-11-28 03:10:07,006 INFO L129 PetriNetUnfolder]: 3/116 cut-off events. [2020-11-28 03:10:07,006 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 03:10:07,011 INFO L80 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-11-28 03:10:07,016 INFO L116 LiptonReduction]: Number of co-enabled transitions 2830 [2020-11-28 03:10:07,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:10:07,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:07,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:07,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:07,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:07,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:10:07,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:10:07,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:10:07,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:07,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:07,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:07,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:07,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:07,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:10:07,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:10:07,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:10:07,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:10:07,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:07,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:07,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:07,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:07,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:10:07,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:10:07,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:10:07,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:10:07,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:07,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:07,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:07,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:07,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:10:07,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:10:07,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:10:07,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:07,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:07,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:07,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:07,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:07,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:10:07,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:10:07,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:10:07,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:10:07,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:07,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:07,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:07,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:07,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:10:07,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:10:07,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:10:08,383 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-28 03:10:08,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:08,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:08,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:08,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:08,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:08,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:10:08,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:10:08,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:10:08,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:08,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:08,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:08,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:08,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:08,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:10:08,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:10:08,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:10:08,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 03:10:08,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:08,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 03:10:08,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:09,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 03:10:09,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:09,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 03:10:09,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:09,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:10:09,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:09,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 03:10:09,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:09,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 03:10:09,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:09,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 03:10:09,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:09,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 03:10:09,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:09,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 03:10:09,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:09,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 03:10:09,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:09,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 03:10:09,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:09,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 03:10:09,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:10,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 03:10:10,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:10,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 03:10:10,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:10,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 03:10:10,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:10,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 03:10:10,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:10,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:10:10,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:10,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-11-28 03:10:10,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:10,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 03:10:10,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:10,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:10:10,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:10,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:10:10,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:10,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:10:10,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:10,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 03:10:10,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:10,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 03:10:10,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:10,973 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-11-28 03:10:11,088 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-28 03:10:11,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 03:10:11,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:11,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 03:10:11,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:11,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:10:11,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:11,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:10:11,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:11,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:10:11,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:11,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-11-28 03:10:11,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:11,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 03:10:11,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:12,622 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 232 DAG size of output: 191 [2020-11-28 03:10:12,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-11-28 03:10:12,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:12,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 03:10:12,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:13,599 WARN L193 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 129 [2020-11-28 03:10:13,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 03:10:13,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:13,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-28 03:10:13,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:13,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:13,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:13,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:13,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:13,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 03:10:13,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:13,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 03:10:13,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:13,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 03:10:13,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:13,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 03:10:13,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:13,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 03:10:13,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:13,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 03:10:13,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:10:13,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 03:10:13,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:14,038 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-11-28 03:10:14,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 03:10:14,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:10:14,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 03:10:14,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:14,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 03:10:14,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:14,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-28 03:10:14,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:14,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:14,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:14,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:14,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:14,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 03:10:14,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:14,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 03:10:14,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:14,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 03:10:14,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:14,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 03:10:14,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:14,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 03:10:14,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:14,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 03:10:14,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:10:14,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 03:10:14,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:14,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 03:10:14,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:14,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-28 03:10:14,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:14,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:14,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:14,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:14,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:14,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 03:10:14,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:14,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 03:10:14,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:14,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 03:10:14,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:14,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 03:10:14,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:14,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 03:10:14,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:14,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 03:10:14,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:14,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-28 03:10:14,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:14,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:14,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:14,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:10:14,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:10:14,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 03:10:14,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:14,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 03:10:14,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:14,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 03:10:14,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:14,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 03:10:14,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:14,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 03:10:14,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:14,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 03:10:14,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:10:14,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 03:10:14,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:10:15,427 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-28 03:10:15,561 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-28 03:10:16,135 WARN L193 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-28 03:10:16,356 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-28 03:10:16,361 INFO L131 LiptonReduction]: Checked pairs total: 7608 [2020-11-28 03:10:16,362 INFO L133 LiptonReduction]: Total number of compositions: 104 [2020-11-28 03:10:16,368 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-11-28 03:10:16,743 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states. [2020-11-28 03:10:16,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states. [2020-11-28 03:10:16,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-28 03:10:16,756 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:16,757 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:16,757 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:16,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:16,764 INFO L82 PathProgramCache]: Analyzing trace with hash -634987665, now seen corresponding path program 1 times [2020-11-28 03:10:16,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:16,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581427375] [2020-11-28 03:10:16,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:17,167 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-28 03:10:17,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581427375] [2020-11-28 03:10:17,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:17,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:10:17,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548012127] [2020-11-28 03:10:17,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:10:17,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:17,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:17,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:17,193 INFO L87 Difference]: Start difference. First operand 3562 states. Second operand 3 states. [2020-11-28 03:10:17,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:17,385 INFO L93 Difference]: Finished difference Result 3082 states and 12048 transitions. [2020-11-28 03:10:17,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:17,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-28 03:10:17,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:17,458 INFO L225 Difference]: With dead ends: 3082 [2020-11-28 03:10:17,458 INFO L226 Difference]: Without dead ends: 2602 [2020-11-28 03:10:17,460 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-28 03:10:17,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-11-28 03:10:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-11-28 03:10:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-11-28 03:10:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-11-28 03:10:17,748 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-11-28 03:10:17,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:17,750 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-11-28 03:10:17,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:10:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-11-28 03:10:17,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 03:10:17,762 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:17,762 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:17,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:10:17,763 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:17,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:17,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1880009126, now seen corresponding path program 1 times [2020-11-28 03:10:17,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:17,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100407226] [2020-11-28 03:10:17,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:17,987 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-28 03:10:17,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100407226] [2020-11-28 03:10:17,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:17,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:10:17,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097852686] [2020-11-28 03:10:17,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:10:17,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:17,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:10:17,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:10:17,990 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-11-28 03:10:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:18,101 INFO L93 Difference]: Finished difference Result 2986 states and 11176 transitions. [2020-11-28 03:10:18,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:10:18,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-28 03:10:18,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:18,136 INFO L225 Difference]: With dead ends: 2986 [2020-11-28 03:10:18,136 INFO L226 Difference]: Without dead ends: 2506 [2020-11-28 03:10:18,137 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-28 03:10:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2020-11-28 03:10:18,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2506. [2020-11-28 03:10:18,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2020-11-28 03:10:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 9624 transitions. [2020-11-28 03:10:18,283 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 9624 transitions. Word has length 12 [2020-11-28 03:10:18,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:18,283 INFO L481 AbstractCegarLoop]: Abstraction has 2506 states and 9624 transitions. [2020-11-28 03:10:18,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:10:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 9624 transitions. [2020-11-28 03:10:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 03:10:18,286 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:18,286 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:18,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:10:18,287 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:18,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:18,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1847258469, now seen corresponding path program 1 times [2020-11-28 03:10:18,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:18,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611500266] [2020-11-28 03:10:18,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:18,484 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-28 03:10:18,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611500266] [2020-11-28 03:10:18,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:18,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:10:18,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942199939] [2020-11-28 03:10:18,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:10:18,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:18,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:10:18,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:10:18,487 INFO L87 Difference]: Start difference. First operand 2506 states and 9624 transitions. Second operand 4 states. [2020-11-28 03:10:18,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:18,694 INFO L93 Difference]: Finished difference Result 2874 states and 10740 transitions. [2020-11-28 03:10:18,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:10:18,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-28 03:10:18,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:18,728 INFO L225 Difference]: With dead ends: 2874 [2020-11-28 03:10:18,728 INFO L226 Difference]: Without dead ends: 2490 [2020-11-28 03:10:18,728 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-28 03:10:18,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2490 states. [2020-11-28 03:10:18,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2490 to 2490. [2020-11-28 03:10:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2490 states. [2020-11-28 03:10:18,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 9548 transitions. [2020-11-28 03:10:18,857 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 9548 transitions. Word has length 13 [2020-11-28 03:10:18,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:18,858 INFO L481 AbstractCegarLoop]: Abstraction has 2490 states and 9548 transitions. [2020-11-28 03:10:18,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:10:18,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 9548 transitions. [2020-11-28 03:10:18,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 03:10:18,862 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:18,862 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:18,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 03:10:18,863 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:18,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:18,864 INFO L82 PathProgramCache]: Analyzing trace with hash 968523464, now seen corresponding path program 1 times [2020-11-28 03:10:18,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:18,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572351346] [2020-11-28 03:10:18,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:18,980 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-28 03:10:18,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572351346] [2020-11-28 03:10:18,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:18,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:10:18,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495145722] [2020-11-28 03:10:18,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:10:18,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:18,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:10:18,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:10:18,982 INFO L87 Difference]: Start difference. First operand 2490 states and 9548 transitions. Second operand 4 states. [2020-11-28 03:10:19,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:19,065 INFO L93 Difference]: Finished difference Result 2642 states and 9838 transitions. [2020-11-28 03:10:19,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:10:19,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-28 03:10:19,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:19,092 INFO L225 Difference]: With dead ends: 2642 [2020-11-28 03:10:19,092 INFO L226 Difference]: Without dead ends: 2218 [2020-11-28 03:10:19,093 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-28 03:10:19,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2020-11-28 03:10:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2020-11-28 03:10:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2020-11-28 03:10:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 8400 transitions. [2020-11-28 03:10:19,202 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 8400 transitions. Word has length 14 [2020-11-28 03:10:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:19,203 INFO L481 AbstractCegarLoop]: Abstraction has 2218 states and 8400 transitions. [2020-11-28 03:10:19,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:10:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 8400 transitions. [2020-11-28 03:10:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 03:10:19,207 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:19,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:19,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 03:10:19,208 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:19,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:19,208 INFO L82 PathProgramCache]: Analyzing trace with hash -40609003, now seen corresponding path program 1 times [2020-11-28 03:10:19,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:19,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558610843] [2020-11-28 03:10:19,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:19,391 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-28 03:10:19,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558610843] [2020-11-28 03:10:19,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:19,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:10:19,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390318486] [2020-11-28 03:10:19,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:10:19,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:19,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:10:19,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:10:19,393 INFO L87 Difference]: Start difference. First operand 2218 states and 8400 transitions. Second operand 6 states. [2020-11-28 03:10:19,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:19,573 INFO L93 Difference]: Finished difference Result 2466 states and 9132 transitions. [2020-11-28 03:10:19,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:10:19,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-28 03:10:19,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:19,601 INFO L225 Difference]: With dead ends: 2466 [2020-11-28 03:10:19,601 INFO L226 Difference]: Without dead ends: 2210 [2020-11-28 03:10:19,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:10:19,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2020-11-28 03:10:19,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2210. [2020-11-28 03:10:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2210 states. [2020-11-28 03:10:19,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 2210 states and 8360 transitions. [2020-11-28 03:10:19,749 INFO L78 Accepts]: Start accepts. Automaton has 2210 states and 8360 transitions. Word has length 15 [2020-11-28 03:10:19,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:19,749 INFO L481 AbstractCegarLoop]: Abstraction has 2210 states and 8360 transitions. [2020-11-28 03:10:19,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:10:19,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 8360 transitions. [2020-11-28 03:10:19,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-28 03:10:19,754 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:19,754 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:19,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 03:10:19,755 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:19,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:19,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1351266717, now seen corresponding path program 1 times [2020-11-28 03:10:19,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:19,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851273146] [2020-11-28 03:10:19,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:19,984 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-28 03:10:19,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851273146] [2020-11-28 03:10:19,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:19,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:10:19,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693770231] [2020-11-28 03:10:19,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:10:19,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:19,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:10:19,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:10:19,987 INFO L87 Difference]: Start difference. First operand 2210 states and 8360 transitions. Second operand 6 states. [2020-11-28 03:10:20,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:20,209 INFO L93 Difference]: Finished difference Result 2794 states and 10476 transitions. [2020-11-28 03:10:20,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:10:20,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-28 03:10:20,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:20,248 INFO L225 Difference]: With dead ends: 2794 [2020-11-28 03:10:20,248 INFO L226 Difference]: Without dead ends: 2570 [2020-11-28 03:10:20,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:10:20,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2020-11-28 03:10:20,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2450. [2020-11-28 03:10:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2020-11-28 03:10:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 9312 transitions. [2020-11-28 03:10:20,360 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 9312 transitions. Word has length 16 [2020-11-28 03:10:20,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:20,360 INFO L481 AbstractCegarLoop]: Abstraction has 2450 states and 9312 transitions. [2020-11-28 03:10:20,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:10:20,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 9312 transitions. [2020-11-28 03:10:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-28 03:10:20,365 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:20,365 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:20,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 03:10:20,365 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:20,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:20,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1258925188, now seen corresponding path program 1 times [2020-11-28 03:10:20,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:20,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070956746] [2020-11-28 03:10:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:20,495 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-28 03:10:20,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070956746] [2020-11-28 03:10:20,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:20,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:10:20,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153541589] [2020-11-28 03:10:20,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:10:20,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:20,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:10:20,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:10:20,498 INFO L87 Difference]: Start difference. First operand 2450 states and 9312 transitions. Second operand 6 states. [2020-11-28 03:10:20,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:20,701 INFO L93 Difference]: Finished difference Result 2850 states and 10612 transitions. [2020-11-28 03:10:20,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:10:20,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-28 03:10:20,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:20,726 INFO L225 Difference]: With dead ends: 2850 [2020-11-28 03:10:20,726 INFO L226 Difference]: Without dead ends: 2594 [2020-11-28 03:10:20,727 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:10:20,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2020-11-28 03:10:20,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2546. [2020-11-28 03:10:20,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2546 states. [2020-11-28 03:10:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 9648 transitions. [2020-11-28 03:10:20,846 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 9648 transitions. Word has length 16 [2020-11-28 03:10:20,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:20,846 INFO L481 AbstractCegarLoop]: Abstraction has 2546 states and 9648 transitions. [2020-11-28 03:10:20,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:10:20,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 9648 transitions. [2020-11-28 03:10:20,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-28 03:10:20,855 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:20,855 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:20,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 03:10:20,856 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:20,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:20,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1580287431, now seen corresponding path program 2 times [2020-11-28 03:10:20,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:20,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675167972] [2020-11-28 03:10:20,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:21,009 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-28 03:10:21,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675167972] [2020-11-28 03:10:21,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:21,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:10:21,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768481685] [2020-11-28 03:10:21,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:10:21,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:21,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:10:21,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:10:21,012 INFO L87 Difference]: Start difference. First operand 2546 states and 9648 transitions. Second operand 7 states. [2020-11-28 03:10:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:21,265 INFO L93 Difference]: Finished difference Result 2740 states and 10188 transitions. [2020-11-28 03:10:21,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-28 03:10:21,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-11-28 03:10:21,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:21,281 INFO L225 Difference]: With dead ends: 2740 [2020-11-28 03:10:21,282 INFO L226 Difference]: Without dead ends: 2508 [2020-11-28 03:10:21,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-11-28 03:10:21,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2020-11-28 03:10:21,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2490. [2020-11-28 03:10:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2490 states. [2020-11-28 03:10:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 9400 transitions. [2020-11-28 03:10:21,399 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 9400 transitions. Word has length 16 [2020-11-28 03:10:21,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:21,399 INFO L481 AbstractCegarLoop]: Abstraction has 2490 states and 9400 transitions. [2020-11-28 03:10:21,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:10:21,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 9400 transitions. [2020-11-28 03:10:21,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-28 03:10:21,405 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:21,406 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:21,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 03:10:21,406 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:21,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:21,407 INFO L82 PathProgramCache]: Analyzing trace with hash 203635924, now seen corresponding path program 2 times [2020-11-28 03:10:21,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:21,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923459000] [2020-11-28 03:10:21,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:21,627 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-28 03:10:21,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923459000] [2020-11-28 03:10:21,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:21,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:10:21,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736588745] [2020-11-28 03:10:21,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:10:21,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:21,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:10:21,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:10:21,630 INFO L87 Difference]: Start difference. First operand 2490 states and 9400 transitions. Second operand 6 states. [2020-11-28 03:10:21,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:21,817 INFO L93 Difference]: Finished difference Result 2658 states and 9812 transitions. [2020-11-28 03:10:21,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:10:21,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-28 03:10:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:21,836 INFO L225 Difference]: With dead ends: 2658 [2020-11-28 03:10:21,836 INFO L226 Difference]: Without dead ends: 2402 [2020-11-28 03:10:21,837 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:10:21,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2020-11-28 03:10:21,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 2306. [2020-11-28 03:10:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2020-11-28 03:10:21,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 8680 transitions. [2020-11-28 03:10:21,962 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 8680 transitions. Word has length 16 [2020-11-28 03:10:21,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:21,962 INFO L481 AbstractCegarLoop]: Abstraction has 2306 states and 8680 transitions. [2020-11-28 03:10:21,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:10:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 8680 transitions. [2020-11-28 03:10:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 03:10:21,970 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:21,970 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:21,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 03:10:21,971 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:21,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:21,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1744224010, now seen corresponding path program 1 times [2020-11-28 03:10:21,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:21,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843972444] [2020-11-28 03:10:21,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:22,135 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-28 03:10:22,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843972444] [2020-11-28 03:10:22,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:22,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:10:22,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747418908] [2020-11-28 03:10:22,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:10:22,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:22,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:10:22,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:10:22,138 INFO L87 Difference]: Start difference. First operand 2306 states and 8680 transitions. Second operand 7 states. [2020-11-28 03:10:22,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:22,354 INFO L93 Difference]: Finished difference Result 2538 states and 9410 transitions. [2020-11-28 03:10:22,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:10:22,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-11-28 03:10:22,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:22,371 INFO L225 Difference]: With dead ends: 2538 [2020-11-28 03:10:22,371 INFO L226 Difference]: Without dead ends: 2370 [2020-11-28 03:10:22,372 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:10:22,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2020-11-28 03:10:22,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 2226. [2020-11-28 03:10:22,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2226 states. [2020-11-28 03:10:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 8304 transitions. [2020-11-28 03:10:22,471 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 8304 transitions. Word has length 17 [2020-11-28 03:10:22,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:22,472 INFO L481 AbstractCegarLoop]: Abstraction has 2226 states and 8304 transitions. [2020-11-28 03:10:22,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:10:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 8304 transitions. [2020-11-28 03:10:22,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 03:10:22,478 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:22,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:22,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 03:10:22,479 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:22,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:22,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1026933636, now seen corresponding path program 2 times [2020-11-28 03:10:22,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:22,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171484468] [2020-11-28 03:10:22,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:22,698 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-28 03:10:22,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171484468] [2020-11-28 03:10:22,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:22,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:10:22,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909360783] [2020-11-28 03:10:22,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:10:22,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:22,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:10:22,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:10:22,700 INFO L87 Difference]: Start difference. First operand 2226 states and 8304 transitions. Second operand 7 states. [2020-11-28 03:10:22,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:22,960 INFO L93 Difference]: Finished difference Result 2682 states and 9838 transitions. [2020-11-28 03:10:22,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:10:22,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-11-28 03:10:22,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:22,978 INFO L225 Difference]: With dead ends: 2682 [2020-11-28 03:10:22,978 INFO L226 Difference]: Without dead ends: 2458 [2020-11-28 03:10:22,979 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:10:22,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2458 states. [2020-11-28 03:10:23,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2458 to 2394. [2020-11-28 03:10:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2394 states. [2020-11-28 03:10:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 8888 transitions. [2020-11-28 03:10:23,083 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 8888 transitions. Word has length 17 [2020-11-28 03:10:23,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:23,083 INFO L481 AbstractCegarLoop]: Abstraction has 2394 states and 8888 transitions. [2020-11-28 03:10:23,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:10:23,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 8888 transitions. [2020-11-28 03:10:23,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-28 03:10:23,091 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:23,091 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-28 03:10:23,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 03:10:23,092 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:23,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:23,092 INFO L82 PathProgramCache]: Analyzing trace with hash -27657637, now seen corresponding path program 1 times [2020-11-28 03:10:23,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:23,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578382547] [2020-11-28 03:10:23,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:23,423 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-28 03:10:23,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578382547] [2020-11-28 03:10:23,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:23,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 03:10:23,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343828798] [2020-11-28 03:10:23,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-28 03:10:23,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:23,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 03:10:23,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:10:23,425 INFO L87 Difference]: Start difference. First operand 2394 states and 8888 transitions. Second operand 8 states. [2020-11-28 03:10:23,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:23,631 INFO L93 Difference]: Finished difference Result 3354 states and 12220 transitions. [2020-11-28 03:10:23,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:10:23,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-11-28 03:10:23,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:23,647 INFO L225 Difference]: With dead ends: 3354 [2020-11-28 03:10:23,647 INFO L226 Difference]: Without dead ends: 2898 [2020-11-28 03:10:23,647 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-11-28 03:10:23,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-11-28 03:10:23,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2442. [2020-11-28 03:10:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2020-11-28 03:10:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9040 transitions. [2020-11-28 03:10:23,756 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 9040 transitions. Word has length 18 [2020-11-28 03:10:23,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:23,756 INFO L481 AbstractCegarLoop]: Abstraction has 2442 states and 9040 transitions. [2020-11-28 03:10:23,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-28 03:10:23,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 9040 transitions. [2020-11-28 03:10:23,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-28 03:10:23,764 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:23,765 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-28 03:10:23,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 03:10:23,765 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:23,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:23,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1306898107, now seen corresponding path program 1 times [2020-11-28 03:10:23,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:23,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457645166] [2020-11-28 03:10:23,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:23,831 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-28 03:10:23,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457645166] [2020-11-28 03:10:23,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:23,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:10:23,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041579377] [2020-11-28 03:10:23,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:10:23,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:23,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:10:23,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:10:23,833 INFO L87 Difference]: Start difference. First operand 2442 states and 9040 transitions. Second operand 4 states. [2020-11-28 03:10:23,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:23,876 INFO L93 Difference]: Finished difference Result 2522 states and 8500 transitions. [2020-11-28 03:10:23,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:10:23,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-11-28 03:10:23,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:23,888 INFO L225 Difference]: With dead ends: 2522 [2020-11-28 03:10:23,888 INFO L226 Difference]: Without dead ends: 1898 [2020-11-28 03:10:23,888 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-28 03:10:23,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-11-28 03:10:23,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2020-11-28 03:10:23,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-11-28 03:10:24,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 6338 transitions. [2020-11-28 03:10:24,008 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 6338 transitions. Word has length 18 [2020-11-28 03:10:24,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:24,009 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 6338 transitions. [2020-11-28 03:10:24,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:10:24,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 6338 transitions. [2020-11-28 03:10:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-28 03:10:24,015 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:24,015 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:24,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 03:10:24,016 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:24,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:24,017 INFO L82 PathProgramCache]: Analyzing trace with hash -467514533, now seen corresponding path program 1 times [2020-11-28 03:10:24,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:24,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157745048] [2020-11-28 03:10:24,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:24,097 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-28 03:10:24,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157745048] [2020-11-28 03:10:24,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:24,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:10:24,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255614404] [2020-11-28 03:10:24,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:10:24,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:24,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:10:24,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:10:24,099 INFO L87 Difference]: Start difference. First operand 1898 states and 6338 transitions. Second operand 5 states. [2020-11-28 03:10:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:24,165 INFO L93 Difference]: Finished difference Result 1602 states and 4889 transitions. [2020-11-28 03:10:24,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:10:24,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-11-28 03:10:24,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:24,172 INFO L225 Difference]: With dead ends: 1602 [2020-11-28 03:10:24,172 INFO L226 Difference]: Without dead ends: 1212 [2020-11-28 03:10:24,173 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-28 03:10:24,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-11-28 03:10:24,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2020-11-28 03:10:24,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2020-11-28 03:10:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 3624 transitions. [2020-11-28 03:10:24,218 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 3624 transitions. Word has length 19 [2020-11-28 03:10:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:24,219 INFO L481 AbstractCegarLoop]: Abstraction has 1212 states and 3624 transitions. [2020-11-28 03:10:24,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:10:24,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 3624 transitions. [2020-11-28 03:10:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-28 03:10:24,223 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:24,224 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] [2020-11-28 03:10:24,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 03:10:24,224 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:24,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:24,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1857918314, now seen corresponding path program 1 times [2020-11-28 03:10:24,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:24,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746383081] [2020-11-28 03:10:24,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:24,303 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-28 03:10:24,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746383081] [2020-11-28 03:10:24,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:24,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:10:24,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696345920] [2020-11-28 03:10:24,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:10:24,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:24,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:10:24,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:10:24,305 INFO L87 Difference]: Start difference. First operand 1212 states and 3624 transitions. Second operand 4 states. [2020-11-28 03:10:24,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:24,347 INFO L93 Difference]: Finished difference Result 1809 states and 5226 transitions. [2020-11-28 03:10:24,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:10:24,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-28 03:10:24,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:24,352 INFO L225 Difference]: With dead ends: 1809 [2020-11-28 03:10:24,352 INFO L226 Difference]: Without dead ends: 1240 [2020-11-28 03:10:24,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:10:24,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2020-11-28 03:10:24,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1200. [2020-11-28 03:10:24,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2020-11-28 03:10:24,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 3396 transitions. [2020-11-28 03:10:24,392 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 3396 transitions. Word has length 20 [2020-11-28 03:10:24,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:24,392 INFO L481 AbstractCegarLoop]: Abstraction has 1200 states and 3396 transitions. [2020-11-28 03:10:24,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:10:24,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 3396 transitions. [2020-11-28 03:10:24,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 03:10:24,400 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:24,400 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-28 03:10:24,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-28 03:10:24,401 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:24,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:24,401 INFO L82 PathProgramCache]: Analyzing trace with hash -21138615, now seen corresponding path program 1 times [2020-11-28 03:10:24,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:24,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311803447] [2020-11-28 03:10:24,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:24,511 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-28 03:10:24,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311803447] [2020-11-28 03:10:24,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:24,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:10:24,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586123838] [2020-11-28 03:10:24,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:10:24,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:24,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:10:24,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:10:24,513 INFO L87 Difference]: Start difference. First operand 1200 states and 3396 transitions. Second operand 7 states. [2020-11-28 03:10:24,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:24,610 INFO L93 Difference]: Finished difference Result 1909 states and 5295 transitions. [2020-11-28 03:10:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:10:24,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-11-28 03:10:24,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:24,615 INFO L225 Difference]: With dead ends: 1909 [2020-11-28 03:10:24,615 INFO L226 Difference]: Without dead ends: 1274 [2020-11-28 03:10:24,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:10:24,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2020-11-28 03:10:24,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1218. [2020-11-28 03:10:24,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2020-11-28 03:10:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 3321 transitions. [2020-11-28 03:10:24,655 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 3321 transitions. Word has length 21 [2020-11-28 03:10:24,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:24,655 INFO L481 AbstractCegarLoop]: Abstraction has 1218 states and 3321 transitions. [2020-11-28 03:10:24,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:10:24,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 3321 transitions. [2020-11-28 03:10:24,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 03:10:24,659 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:24,659 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-28 03:10:24,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-28 03:10:24,660 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:24,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:24,661 INFO L82 PathProgramCache]: Analyzing trace with hash 567766542, now seen corresponding path program 1 times [2020-11-28 03:10:24,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:24,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144034715] [2020-11-28 03:10:24,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:24,867 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-28 03:10:24,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144034715] [2020-11-28 03:10:24,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:24,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-28 03:10:24,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192481225] [2020-11-28 03:10:24,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-28 03:10:24,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:24,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 03:10:24,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:10:24,869 INFO L87 Difference]: Start difference. First operand 1218 states and 3321 transitions. Second operand 9 states. [2020-11-28 03:10:25,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:25,068 INFO L93 Difference]: Finished difference Result 1422 states and 3760 transitions. [2020-11-28 03:10:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 03:10:25,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-11-28 03:10:25,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:25,072 INFO L225 Difference]: With dead ends: 1422 [2020-11-28 03:10:25,072 INFO L226 Difference]: Without dead ends: 1317 [2020-11-28 03:10:25,074 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-28 03:10:25,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2020-11-28 03:10:25,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1297. [2020-11-28 03:10:25,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1297 states. [2020-11-28 03:10:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 3504 transitions. [2020-11-28 03:10:25,130 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 3504 transitions. Word has length 21 [2020-11-28 03:10:25,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:25,130 INFO L481 AbstractCegarLoop]: Abstraction has 1297 states and 3504 transitions. [2020-11-28 03:10:25,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-28 03:10:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 3504 transitions. [2020-11-28 03:10:25,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 03:10:25,134 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:25,134 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-28 03:10:25,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-28 03:10:25,135 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:25,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:25,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1481408638, now seen corresponding path program 2 times [2020-11-28 03:10:25,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:25,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103651889] [2020-11-28 03:10:25,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:25,260 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-28 03:10:25,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103651889] [2020-11-28 03:10:25,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:25,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:10:25,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454598225] [2020-11-28 03:10:25,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:10:25,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:25,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:10:25,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:10:25,262 INFO L87 Difference]: Start difference. First operand 1297 states and 3504 transitions. Second operand 6 states. [2020-11-28 03:10:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:25,340 INFO L93 Difference]: Finished difference Result 1746 states and 4522 transitions. [2020-11-28 03:10:25,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:10:25,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-11-28 03:10:25,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:25,343 INFO L225 Difference]: With dead ends: 1746 [2020-11-28 03:10:25,343 INFO L226 Difference]: Without dead ends: 1178 [2020-11-28 03:10:25,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:10:25,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-11-28 03:10:25,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1102. [2020-11-28 03:10:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2020-11-28 03:10:25,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 2812 transitions. [2020-11-28 03:10:25,375 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 2812 transitions. Word has length 21 [2020-11-28 03:10:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:25,377 INFO L481 AbstractCegarLoop]: Abstraction has 1102 states and 2812 transitions. [2020-11-28 03:10:25,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:10:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 2812 transitions. [2020-11-28 03:10:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 03:10:25,380 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:25,381 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-28 03:10:25,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-28 03:10:25,381 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:25,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:25,382 INFO L82 PathProgramCache]: Analyzing trace with hash -652683463, now seen corresponding path program 1 times [2020-11-28 03:10:25,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:25,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913516531] [2020-11-28 03:10:25,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:25,472 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-28 03:10:25,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913516531] [2020-11-28 03:10:25,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:25,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:10:25,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512276840] [2020-11-28 03:10:25,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:10:25,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:25,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:10:25,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:10:25,474 INFO L87 Difference]: Start difference. First operand 1102 states and 2812 transitions. Second operand 6 states. [2020-11-28 03:10:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:25,559 INFO L93 Difference]: Finished difference Result 934 states and 2318 transitions. [2020-11-28 03:10:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:10:25,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-11-28 03:10:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:25,561 INFO L225 Difference]: With dead ends: 934 [2020-11-28 03:10:25,561 INFO L226 Difference]: Without dead ends: 635 [2020-11-28 03:10:25,562 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-28 03:10:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-11-28 03:10:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 545. [2020-11-28 03:10:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2020-11-28 03:10:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 1289 transitions. [2020-11-28 03:10:25,578 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 1289 transitions. Word has length 21 [2020-11-28 03:10:25,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:25,578 INFO L481 AbstractCegarLoop]: Abstraction has 545 states and 1289 transitions. [2020-11-28 03:10:25,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:10:25,579 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 1289 transitions. [2020-11-28 03:10:25,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-28 03:10:25,581 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:25,581 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, 1, 1, 1] [2020-11-28 03:10:25,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-28 03:10:25,581 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:25,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:25,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1413421509, now seen corresponding path program 1 times [2020-11-28 03:10:25,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:25,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652745120] [2020-11-28 03:10:25,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:25,874 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-28 03:10:25,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652745120] [2020-11-28 03:10:25,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:25,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 03:10:25,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851564409] [2020-11-28 03:10:25,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-28 03:10:25,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:25,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 03:10:25,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:10:25,876 INFO L87 Difference]: Start difference. First operand 545 states and 1289 transitions. Second operand 8 states. [2020-11-28 03:10:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:26,050 INFO L93 Difference]: Finished difference Result 635 states and 1526 transitions. [2020-11-28 03:10:26,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:10:26,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-11-28 03:10:26,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:26,051 INFO L225 Difference]: With dead ends: 635 [2020-11-28 03:10:26,051 INFO L226 Difference]: Without dead ends: 528 [2020-11-28 03:10:26,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-28 03:10:26,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-11-28 03:10:26,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 438. [2020-11-28 03:10:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-11-28 03:10:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1048 transitions. [2020-11-28 03:10:26,066 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1048 transitions. Word has length 24 [2020-11-28 03:10:26,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:26,066 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 1048 transitions. [2020-11-28 03:10:26,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-28 03:10:26,066 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1048 transitions. [2020-11-28 03:10:26,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-28 03:10:26,068 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:26,068 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, 1, 1, 1] [2020-11-28 03:10:26,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-28 03:10:26,068 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:26,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:26,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1487437972, now seen corresponding path program 1 times [2020-11-28 03:10:26,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:26,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485355289] [2020-11-28 03:10:26,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:26,174 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-28 03:10:26,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485355289] [2020-11-28 03:10:26,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:26,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:10:26,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988433807] [2020-11-28 03:10:26,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:10:26,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:26,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:10:26,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:10:26,177 INFO L87 Difference]: Start difference. First operand 438 states and 1048 transitions. Second operand 6 states. [2020-11-28 03:10:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:26,249 INFO L93 Difference]: Finished difference Result 619 states and 1437 transitions. [2020-11-28 03:10:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:10:26,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-11-28 03:10:26,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:26,250 INFO L225 Difference]: With dead ends: 619 [2020-11-28 03:10:26,250 INFO L226 Difference]: Without dead ends: 322 [2020-11-28 03:10:26,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:10:26,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-11-28 03:10:26,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2020-11-28 03:10:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-11-28 03:10:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 700 transitions. [2020-11-28 03:10:26,259 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 700 transitions. Word has length 24 [2020-11-28 03:10:26,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:26,260 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 700 transitions. [2020-11-28 03:10:26,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:10:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 700 transitions. [2020-11-28 03:10:26,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-28 03:10:26,262 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:26,263 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, 1, 1, 1] [2020-11-28 03:10:26,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-28 03:10:26,263 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:26,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:26,264 INFO L82 PathProgramCache]: Analyzing trace with hash -2083782188, now seen corresponding path program 2 times [2020-11-28 03:10:26,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:26,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103029238] [2020-11-28 03:10:26,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:26,353 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-28 03:10:26,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103029238] [2020-11-28 03:10:26,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:26,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 03:10:26,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292385113] [2020-11-28 03:10:26,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:10:26,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:26,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:10:26,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:10:26,354 INFO L87 Difference]: Start difference. First operand 322 states and 700 transitions. Second operand 7 states. [2020-11-28 03:10:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:26,457 INFO L93 Difference]: Finished difference Result 293 states and 643 transitions. [2020-11-28 03:10:26,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:10:26,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-11-28 03:10:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:26,458 INFO L225 Difference]: With dead ends: 293 [2020-11-28 03:10:26,458 INFO L226 Difference]: Without dead ends: 65 [2020-11-28 03:10:26,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-11-28 03:10:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-28 03:10:26,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-11-28 03:10:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-28 03:10:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2020-11-28 03:10:26,461 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 24 [2020-11-28 03:10:26,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:26,461 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2020-11-28 03:10:26,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:10:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2020-11-28 03:10:26,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 03:10:26,462 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:26,462 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, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:26,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-28 03:10:26,463 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:26,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:26,463 INFO L82 PathProgramCache]: Analyzing trace with hash 773461534, now seen corresponding path program 1 times [2020-11-28 03:10:26,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:26,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105326959] [2020-11-28 03:10:26,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:26,527 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:26,574 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:26,618 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:10:26,618 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 03:10:26,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-28 03:10:26,660 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-28 03:10:26,660 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,660 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-28 03:10:26,661 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [799] [2020-11-28 03:10:26,663 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-28 03:10:26,663 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,663 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-28 03:10:26,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,664 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-28 03:10:26,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,664 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-28 03:10:26,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,665 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-28 03:10:26,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,665 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-28 03:10:26,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,666 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-28 03:10:26,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,666 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-28 03:10:26,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,667 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-28 03:10:26,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,667 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-28 03:10:26,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,668 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-28 03:10:26,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,668 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-28 03:10:26,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,669 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-28 03:10:26,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,669 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-28 03:10:26,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,670 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-28 03:10:26,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,670 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-28 03:10:26,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,671 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-28 03:10:26,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,671 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-28 03:10:26,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,672 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-28 03:10:26,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,672 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-28 03:10:26,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,673 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-28 03:10:26,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,673 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-28 03:10:26,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,673 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-28 03:10:26,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,674 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-28 03:10:26,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,674 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-28 03:10:26,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,675 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-28 03:10:26,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,675 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-28 03:10:26,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,676 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-28 03:10:26,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,676 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-28 03:10:26,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,676 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-28 03:10:26,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,677 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-28 03:10:26,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:10:26 BasicIcfg [2020-11-28 03:10:26,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:10:26,766 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:10:26,766 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:10:26,766 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:10:26,767 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:10:06" (3/4) ... [2020-11-28 03:10:26,769 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 03:10:26,798 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-28 03:10:26,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,799 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-28 03:10:26,799 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [799] [2020-11-28 03:10:26,800 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-28 03:10:26,800 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,801 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-28 03:10:26,801 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,801 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-28 03:10:26,801 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,801 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-28 03:10:26,801 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,801 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-28 03:10:26,802 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,802 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-28 03:10:26,802 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,802 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-28 03:10:26,803 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,803 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-28 03:10:26,803 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,803 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-28 03:10:26,803 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,803 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-28 03:10:26,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,804 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-28 03:10:26,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,804 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-28 03:10:26,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,805 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-28 03:10:26,805 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,805 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-28 03:10:26,805 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,805 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-28 03:10:26,805 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,806 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-28 03:10:26,806 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,806 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-28 03:10:26,806 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,806 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-28 03:10:26,807 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,807 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-28 03:10:26,807 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,807 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-28 03:10:26,807 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,807 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-28 03:10:26,808 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,808 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-28 03:10:26,808 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,808 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-28 03:10:26,808 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,808 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-28 03:10:26,809 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,809 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-28 03:10:26,809 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,809 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-28 03:10:26,809 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,809 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-28 03:10:26,810 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,810 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-28 03:10:26,810 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,810 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-28 03:10:26,810 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,810 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-28 03:10:26,811 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,811 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-28 03:10:26,811 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:10:26,914 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bee87725-6999-4336-b057-cc26a87c70e3/bin/uautomizer/witness.graphml [2020-11-28 03:10:26,915 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:10:26,916 INFO L168 Benchmark]: Toolchain (without parser) took 24467.31 ms. Allocated memory was 107.0 MB in the beginning and 465.6 MB in the end (delta: 358.6 MB). Free memory was 76.5 MB in the beginning and 349.5 MB in the end (delta: -273.0 MB). Peak memory consumption was 85.8 MB. Max. memory is 16.1 GB. [2020-11-28 03:10:26,917 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 107.0 MB. Free memory was 66.3 MB in the beginning and 66.3 MB in the end (delta: 43.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:10:26,917 INFO L168 Benchmark]: CACSL2BoogieTranslator took 901.69 ms. Allocated memory is still 107.0 MB. Free memory was 76.1 MB in the beginning and 59.2 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-28 03:10:26,918 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.15 ms. Allocated memory is still 107.0 MB. Free memory was 59.2 MB in the beginning and 56.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-28 03:10:26,918 INFO L168 Benchmark]: Boogie Preprocessor took 59.44 ms. Allocated memory is still 107.0 MB. Free memory was 56.2 MB in the beginning and 54.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:10:26,918 INFO L168 Benchmark]: RCFGBuilder took 3124.76 ms. Allocated memory was 107.0 MB in the beginning and 140.5 MB in the end (delta: 33.6 MB). Free memory was 53.7 MB in the beginning and 67.1 MB in the end (delta: -13.4 MB). Peak memory consumption was 52.8 MB. Max. memory is 16.1 GB. [2020-11-28 03:10:26,919 INFO L168 Benchmark]: TraceAbstraction took 20092.44 ms. Allocated memory was 140.5 MB in the beginning and 465.6 MB in the end (delta: 325.1 MB). Free memory was 67.1 MB in the beginning and 370.5 MB in the end (delta: -303.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 16.1 GB. [2020-11-28 03:10:26,919 INFO L168 Benchmark]: Witness Printer took 149.29 ms. Allocated memory is still 465.6 MB. Free memory was 370.5 MB in the beginning and 349.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-28 03:10:26,922 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.25 ms. Allocated memory is still 107.0 MB. Free memory was 66.3 MB in the beginning and 66.3 MB in the end (delta: 43.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 901.69 ms. Allocated memory is still 107.0 MB. Free memory was 76.1 MB in the beginning and 59.2 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 129.15 ms. Allocated memory is still 107.0 MB. Free memory was 59.2 MB in the beginning and 56.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 59.44 ms. Allocated memory is still 107.0 MB. Free memory was 56.2 MB in the beginning and 54.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3124.76 ms. Allocated memory was 107.0 MB in the beginning and 140.5 MB in the end (delta: 33.6 MB). Free memory was 53.7 MB in the beginning and 67.1 MB in the end (delta: -13.4 MB). Peak memory consumption was 52.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20092.44 ms. Allocated memory was 140.5 MB in the beginning and 465.6 MB in the end (delta: 325.1 MB). Free memory was 67.1 MB in the beginning and 370.5 MB in the end (delta: -303.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 16.1 GB. * Witness Printer took 149.29 ms. Allocated memory is still 465.6 MB. Free memory was 370.5 MB in the beginning and 349.5 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 1891 VarBasedMoverChecksPositive, 92 VarBasedMoverChecksNegative, 30 SemBasedMoverChecksPositive, 62 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 203 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.4s, 130 PlacesBefore, 46 PlacesAfterwards, 120 TransitionsBefore, 34 TransitionsAfterwards, 2830 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 7608 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1273; [L845] FCALL, FORK 0 pthread_create(&t1273, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L846] 0 pthread_t t1274; [L847] FCALL, FORK 0 pthread_create(&t1274, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L848] 0 pthread_t t1275; [L849] FCALL, FORK 0 pthread_create(&t1275, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L850] 0 pthread_t t1276; [L851] FCALL, FORK 0 pthread_create(&t1276, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L18] COND TRUE 4 !expression [L17] COND FALSE 4 !(0) [L17] 4 __assert_fail ("0", "mix047_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L765] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L780] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 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) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] 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) [L786] 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) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 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 [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 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 [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L873] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix047_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.7s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.8s, HoareTripleCheckerStatistics: 910 SDtfs, 1197 SDslu, 2064 SDs, 0 SdLazy, 725 SolverSat, 209 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred 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: 1.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 1318 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 419 NumberOfCodeBlocks, 419 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 370 ConstructedInterpolants, 0 QuantifiedInterpolants, 47322 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...