./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fd8f4494-02d9-40dc-bf18-fdd7d0db1c5d/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_fd8f4494-02d9-40dc-bf18-fdd7d0db1c5d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fd8f4494-02d9-40dc-bf18-fdd7d0db1c5d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fd8f4494-02d9-40dc-bf18-fdd7d0db1c5d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fd8f4494-02d9-40dc-bf18-fdd7d0db1c5d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fd8f4494-02d9-40dc-bf18-fdd7d0db1c5d/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 d5b7c0df935195a22e77705093925c69e6a38120 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:20:04,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:20:04,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:20:04,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:20:04,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:20:04,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:20:04,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:20:04,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:20:04,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:20:04,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:20:04,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:20:04,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:20:04,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:20:04,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:20:04,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:20:04,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:20:04,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:20:04,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:20:04,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:20:04,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:20:04,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:20:04,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:20:04,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:20:04,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:20:04,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:20:04,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:20:04,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:20:04,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:20:04,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:20:04,552 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:20:04,552 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:20:04,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:20:04,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:20:04,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:20:04,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:20:04,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:20:04,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:20:04,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:20:04,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:20:04,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:20:04,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:20:04,566 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fd8f4494-02d9-40dc-bf18-fdd7d0db1c5d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:20:04,605 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:20:04,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:20:04,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:20:04,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:20:04,607 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:20:04,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:20:04,608 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:20:04,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:20:04,609 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:20:04,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:20:04,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:20:04,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:20:04,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:20:04,610 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:20:04,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:20:04,610 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:20:04,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:20:04,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:20:04,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:20:04,612 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:20:04,612 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:20:04,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:20:04,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:20:04,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:20:04,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:20:04,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:20:04,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:20:04,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:20:04,614 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:20:04,614 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_fd8f4494-02d9-40dc-bf18-fdd7d0db1c5d/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_fd8f4494-02d9-40dc-bf18-fdd7d0db1c5d/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 -> d5b7c0df935195a22e77705093925c69e6a38120 [2020-11-28 03:20:04,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:20:04,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:20:04,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:20:04,965 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:20:04,967 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:20:04,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fd8f4494-02d9-40dc-bf18-fdd7d0db1c5d/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix045_tso.opt.i [2020-11-28 03:20:05,055 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd8f4494-02d9-40dc-bf18-fdd7d0db1c5d/bin/uautomizer/data/72ed352c6/fc1310b541014ba6b2933b89b2719df4/FLAG078115f28 [2020-11-28 03:20:05,690 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:20:05,690 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fd8f4494-02d9-40dc-bf18-fdd7d0db1c5d/sv-benchmarks/c/pthread-wmm/mix045_tso.opt.i [2020-11-28 03:20:05,710 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd8f4494-02d9-40dc-bf18-fdd7d0db1c5d/bin/uautomizer/data/72ed352c6/fc1310b541014ba6b2933b89b2719df4/FLAG078115f28 [2020-11-28 03:20:05,914 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fd8f4494-02d9-40dc-bf18-fdd7d0db1c5d/bin/uautomizer/data/72ed352c6/fc1310b541014ba6b2933b89b2719df4 [2020-11-28 03:20:05,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:20:05,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:20:05,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:20:05,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:20:05,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:20:05,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:20:05" (1/1) ... [2020-11-28 03:20:05,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@764efaf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:05, skipping insertion in model container [2020-11-28 03:20:05,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:20:05" (1/1) ... [2020-11-28 03:20:05,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:20:05,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:20:06,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:20:06,524 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:20:06,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:20:06,731 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:20:06,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:06 WrapperNode [2020-11-28 03:20:06,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:20:06,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:20:06,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:20:06,739 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:20:06,752 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:20:06" (1/1) ... [2020-11-28 03:20:06,777 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:20:06" (1/1) ... [2020-11-28 03:20:06,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:20:06,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:20:06,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:20:06,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:20:06,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:06" (1/1) ... [2020-11-28 03:20:06,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:06" (1/1) ... [2020-11-28 03:20:06,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:06" (1/1) ... [2020-11-28 03:20:06,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:06" (1/1) ... [2020-11-28 03:20:06,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:06" (1/1) ... [2020-11-28 03:20:06,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:06" (1/1) ... [2020-11-28 03:20:06,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:06" (1/1) ... [2020-11-28 03:20:06,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:20:06,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:20:06,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:20:06,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:20:06,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd8f4494-02d9-40dc-bf18-fdd7d0db1c5d/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:20:07,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 03:20:07,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 03:20:07,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:20:07,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 03:20:07,034 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 03:20:07,035 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 03:20:07,035 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 03:20:07,036 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 03:20:07,036 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 03:20:07,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 03:20:07,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:20:07,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 03:20:07,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:20:07,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:20:07,040 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:20:09,529 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:20:09,529 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 03:20:09,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:09 BoogieIcfgContainer [2020-11-28 03:20:09,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:20:09,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:20:09,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:20:09,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:20:09,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:20:05" (1/3) ... [2020-11-28 03:20:09,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589909da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:20:09, skipping insertion in model container [2020-11-28 03:20:09,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:06" (2/3) ... [2020-11-28 03:20:09,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589909da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:20:09, skipping insertion in model container [2020-11-28 03:20:09,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:09" (3/3) ... [2020-11-28 03:20:09,542 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_tso.opt.i [2020-11-28 03:20:09,554 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 03:20:09,555 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:20:09,560 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 03:20:09,561 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 03:20:09,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,599 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,599 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,602 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,602 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,603 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,604 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,609 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,610 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,616 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,617 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,618 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,621 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,622 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:20:09,624 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 03:20:09,637 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-28 03:20:09,661 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:20:09,661 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:20:09,661 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:20:09,661 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:20:09,661 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:20:09,662 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:20:09,662 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:20:09,662 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:20:09,676 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 03:20:09,678 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 104 transitions, 223 flow [2020-11-28 03:20:09,681 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 104 transitions, 223 flow [2020-11-28 03:20:09,683 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 111 places, 104 transitions, 223 flow [2020-11-28 03:20:09,757 INFO L129 PetriNetUnfolder]: 3/101 cut-off events. [2020-11-28 03:20:09,757 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 03:20:09,763 INFO L80 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 3/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2020-11-28 03:20:09,769 INFO L116 LiptonReduction]: Number of co-enabled transitions 1922 [2020-11-28 03:20:09,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:09,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:09,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:09,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:09,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:09,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:09,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:09,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:10,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:10,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:10,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:10,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:10,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:10,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-11-28 03:20:10,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:10,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:10,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:10,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-11-28 03:20:10,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:10,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:10,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:10,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:20:10,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-28 03:20:10,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-28 03:20:10,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,784 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-11-28 03:20:10,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:10,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:10,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:10,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:10,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:10,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:10,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:10,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:11,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:11,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-11-28 03:20:11,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:11,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:20:11,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:11,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:11,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:11,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:11,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:20:11,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:11,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:20:11,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:11,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:20:11,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-28 03:20:11,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-28 03:20:11,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-28 03:20:11,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:11,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:11,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:20:11,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:20:11,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-28 03:20:11,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:11,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:11,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:11,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:11,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:20:11,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:11,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:11,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:11,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:11,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:20:11,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:11,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:20:11,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:11,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:20:11,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-28 03:20:11,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-28 03:20:11,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-28 03:20:11,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:11,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:11,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:20:11,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:20:11,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-28 03:20:11,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:11,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:11,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:20:11,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:20:11,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-28 03:20:11,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:20:11,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:11,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:11,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:11,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:11,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:20:11,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:11,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:20:11,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:11,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:20:11,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-28 03:20:11,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-28 03:20:11,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-28 03:20:11,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:11,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:11,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:11,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:11,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:11,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:11,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:11,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:11,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:11,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:12,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:12,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:20:12,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:20:12,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-28 03:20:12,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:20:12,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:12,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:12,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:12,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:12,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:20:12,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:12,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:20:12,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:12,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:20:12,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-28 03:20:12,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-28 03:20:12,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-28 03:20:12,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-11-28 03:20:12,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:12,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:12,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:12,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:20:12,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-28 03:20:12,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-28 03:20:12,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:12,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:12,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:12,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:12,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:20:12,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:12,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:20:12,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-28 03:20:12,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-28 03:20:12,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:12,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:12,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-11-28 03:20:12,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:12,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:12,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:14,311 WARN L193 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-11-28 03:20:14,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-28 03:20:14,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:14,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:14,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:15,764 WARN L193 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-11-28 03:20:15,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:15,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:15,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:15,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:15,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 03:20:15,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:15,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 03:20:15,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:15,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:20:15,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:16,433 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-28 03:20:16,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:20:16,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:20:16,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:20:16,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:16,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:20:16,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:16,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-11-28 03:20:16,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:16,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:20:16,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:16,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:20:16,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:16,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:16,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:16,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:16,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:16,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:20:16,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:16,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:16,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:16,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:16,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:16,949 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-11-28 03:20:17,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:20:17,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:17,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:20:17,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:17,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:20:17,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:17,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-11-28 03:20:17,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:17,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:20:17,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:17,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:20:17,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:17,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:17,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:17,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:17,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:17,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:20:17,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:17,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:17,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:17,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-28 03:20:17,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:17,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:20:17,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:20:17,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-28 03:20:17,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:20:17,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:20:17,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:20:18,290 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-11-28 03:20:18,417 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-28 03:20:18,608 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-28 03:20:19,102 WARN L193 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-11-28 03:20:19,307 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-11-28 03:20:19,315 INFO L131 LiptonReduction]: Checked pairs total: 5459 [2020-11-28 03:20:19,315 INFO L133 LiptonReduction]: Total number of compositions: 93 [2020-11-28 03:20:19,321 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-11-28 03:20:19,387 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 890 states. [2020-11-28 03:20:19,390 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states. [2020-11-28 03:20:19,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-28 03:20:19,399 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:19,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:19,400 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:19,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:19,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1633841239, now seen corresponding path program 1 times [2020-11-28 03:20:19,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:19,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363953513] [2020-11-28 03:20:19,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:19,710 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:20:19,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363953513] [2020-11-28 03:20:19,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:19,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:20:19,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645845895] [2020-11-28 03:20:19,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:20:19,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:19,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:20:19,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:20:19,739 INFO L87 Difference]: Start difference. First operand 890 states. Second operand 3 states. [2020-11-28 03:20:19,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:19,855 INFO L93 Difference]: Finished difference Result 770 states and 2434 transitions. [2020-11-28 03:20:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:20:19,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-28 03:20:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:19,897 INFO L225 Difference]: With dead ends: 770 [2020-11-28 03:20:19,898 INFO L226 Difference]: Without dead ends: 650 [2020-11-28 03:20:19,899 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:20:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-11-28 03:20:20,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2020-11-28 03:20:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2020-11-28 03:20:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2020-11-28 03:20:20,047 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 7 [2020-11-28 03:20:20,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:20,048 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2020-11-28 03:20:20,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:20:20,048 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2020-11-28 03:20:20,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 03:20:20,052 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:20,052 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:20,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:20:20,053 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:20,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:20,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1097574933, now seen corresponding path program 1 times [2020-11-28 03:20:20,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:20,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516168713] [2020-11-28 03:20:20,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:20,306 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:20:20,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516168713] [2020-11-28 03:20:20,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:20,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:20:20,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79857509] [2020-11-28 03:20:20,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:20:20,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:20,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:20:20,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:20:20,312 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand 4 states. [2020-11-28 03:20:20,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:20,437 INFO L93 Difference]: Finished difference Result 766 states and 2300 transitions. [2020-11-28 03:20:20,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:20:20,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-28 03:20:20,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:20,446 INFO L225 Difference]: With dead ends: 766 [2020-11-28 03:20:20,446 INFO L226 Difference]: Without dead ends: 646 [2020-11-28 03:20:20,447 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:20:20,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-11-28 03:20:20,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2020-11-28 03:20:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2020-11-28 03:20:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 2012 transitions. [2020-11-28 03:20:20,489 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 2012 transitions. Word has length 10 [2020-11-28 03:20:20,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:20,490 INFO L481 AbstractCegarLoop]: Abstraction has 646 states and 2012 transitions. [2020-11-28 03:20:20,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:20:20,490 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 2012 transitions. [2020-11-28 03:20:20,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 03:20:20,500 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:20,500 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:20,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:20:20,501 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:20,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:20,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1173726375, now seen corresponding path program 1 times [2020-11-28 03:20:20,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:20,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475526537] [2020-11-28 03:20:20,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:20,669 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:20:20,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475526537] [2020-11-28 03:20:20,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:20,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:20:20,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307618759] [2020-11-28 03:20:20,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:20:20,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:20,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:20:20,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:20:20,671 INFO L87 Difference]: Start difference. First operand 646 states and 2012 transitions. Second operand 4 states. [2020-11-28 03:20:20,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:20,770 INFO L93 Difference]: Finished difference Result 718 states and 2156 transitions. [2020-11-28 03:20:20,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:20:20,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-28 03:20:20,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:20,778 INFO L225 Difference]: With dead ends: 718 [2020-11-28 03:20:20,779 INFO L226 Difference]: Without dead ends: 610 [2020-11-28 03:20:20,779 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:20:20,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-11-28 03:20:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2020-11-28 03:20:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2020-11-28 03:20:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1886 transitions. [2020-11-28 03:20:20,813 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1886 transitions. Word has length 11 [2020-11-28 03:20:20,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:20,814 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 1886 transitions. [2020-11-28 03:20:20,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:20:20,814 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1886 transitions. [2020-11-28 03:20:20,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 03:20:20,816 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:20,816 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:20,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 03:20:20,817 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:20,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:20,818 INFO L82 PathProgramCache]: Analyzing trace with hash 334864770, now seen corresponding path program 1 times [2020-11-28 03:20:20,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:20,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156783575] [2020-11-28 03:20:20,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:20,926 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:20:20,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156783575] [2020-11-28 03:20:20,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:20,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:20:20,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133162265] [2020-11-28 03:20:20,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:20:20,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:20,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:20:20,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:20:20,928 INFO L87 Difference]: Start difference. First operand 610 states and 1886 transitions. Second operand 4 states. [2020-11-28 03:20:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:20,967 INFO L93 Difference]: Finished difference Result 690 states and 2055 transitions. [2020-11-28 03:20:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:20:20,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-28 03:20:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:20,973 INFO L225 Difference]: With dead ends: 690 [2020-11-28 03:20:20,973 INFO L226 Difference]: Without dead ends: 590 [2020-11-28 03:20:20,973 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:20:20,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-11-28 03:20:20,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2020-11-28 03:20:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2020-11-28 03:20:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 1810 transitions. [2020-11-28 03:20:20,994 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 1810 transitions. Word has length 11 [2020-11-28 03:20:20,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:20,995 INFO L481 AbstractCegarLoop]: Abstraction has 590 states and 1810 transitions. [2020-11-28 03:20:20,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:20:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1810 transitions. [2020-11-28 03:20:20,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 03:20:20,996 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:20,996 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:20,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 03:20:20,997 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:20,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:20,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2025829932, now seen corresponding path program 1 times [2020-11-28 03:20:20,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:20,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301505629] [2020-11-28 03:20:20,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:21,155 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:20:21,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301505629] [2020-11-28 03:20:21,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:21,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:20:21,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8871248] [2020-11-28 03:20:21,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:20:21,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:21,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:20:21,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:20:21,157 INFO L87 Difference]: Start difference. First operand 590 states and 1810 transitions. Second operand 6 states. [2020-11-28 03:20:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:21,332 INFO L93 Difference]: Finished difference Result 676 states and 2005 transitions. [2020-11-28 03:20:21,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:20:21,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-11-28 03:20:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:21,342 INFO L225 Difference]: With dead ends: 676 [2020-11-28 03:20:21,342 INFO L226 Difference]: Without dead ends: 578 [2020-11-28 03:20:21,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:20:21,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-11-28 03:20:21,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 554. [2020-11-28 03:20:21,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2020-11-28 03:20:21,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1684 transitions. [2020-11-28 03:20:21,366 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1684 transitions. Word has length 12 [2020-11-28 03:20:21,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:21,367 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 1684 transitions. [2020-11-28 03:20:21,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:20:21,367 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1684 transitions. [2020-11-28 03:20:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 03:20:21,368 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:21,369 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:21,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 03:20:21,369 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:21,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:21,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1621705085, now seen corresponding path program 1 times [2020-11-28 03:20:21,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:21,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198357275] [2020-11-28 03:20:21,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:21,665 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:20:21,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198357275] [2020-11-28 03:20:21,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:21,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:20:21,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832851273] [2020-11-28 03:20:21,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:20:21,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:21,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:20:21,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:20:21,668 INFO L87 Difference]: Start difference. First operand 554 states and 1684 transitions. Second operand 6 states. [2020-11-28 03:20:21,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:21,807 INFO L93 Difference]: Finished difference Result 686 states and 2055 transitions. [2020-11-28 03:20:21,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:20:21,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-11-28 03:20:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:21,834 INFO L225 Difference]: With dead ends: 686 [2020-11-28 03:20:21,834 INFO L226 Difference]: Without dead ends: 614 [2020-11-28 03:20:21,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:20:21,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-11-28 03:20:21,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2020-11-28 03:20:21,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2020-11-28 03:20:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1873 transitions. [2020-11-28 03:20:21,856 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1873 transitions. Word has length 13 [2020-11-28 03:20:21,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:21,856 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 1873 transitions. [2020-11-28 03:20:21,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:20:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1873 transitions. [2020-11-28 03:20:21,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 03:20:21,857 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:21,858 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:21,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 03:20:21,858 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:21,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:21,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1625510645, now seen corresponding path program 2 times [2020-11-28 03:20:21,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:21,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433811530] [2020-11-28 03:20:21,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:22,077 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:20:22,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433811530] [2020-11-28 03:20:22,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:22,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:20:22,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186009225] [2020-11-28 03:20:22,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:20:22,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:22,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:20:22,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:20:22,080 INFO L87 Difference]: Start difference. First operand 614 states and 1873 transitions. Second operand 6 states. [2020-11-28 03:20:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:22,216 INFO L93 Difference]: Finished difference Result 662 states and 1959 transitions. [2020-11-28 03:20:22,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:20:22,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-11-28 03:20:22,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:22,224 INFO L225 Difference]: With dead ends: 662 [2020-11-28 03:20:22,224 INFO L226 Difference]: Without dead ends: 590 [2020-11-28 03:20:22,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:20:22,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-11-28 03:20:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2020-11-28 03:20:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2020-11-28 03:20:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 1785 transitions. [2020-11-28 03:20:22,249 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 1785 transitions. Word has length 13 [2020-11-28 03:20:22,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:22,250 INFO L481 AbstractCegarLoop]: Abstraction has 590 states and 1785 transitions. [2020-11-28 03:20:22,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:20:22,250 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1785 transitions. [2020-11-28 03:20:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 03:20:22,252 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:22,252 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:22,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 03:20:22,252 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:22,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:22,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1804994795, now seen corresponding path program 1 times [2020-11-28 03:20:22,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:22,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141129952] [2020-11-28 03:20:22,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:22,524 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:20:22,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141129952] [2020-11-28 03:20:22,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:22,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:20:22,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317811239] [2020-11-28 03:20:22,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:20:22,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:22,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:20:22,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:20:22,526 INFO L87 Difference]: Start difference. First operand 590 states and 1785 transitions. Second operand 7 states. [2020-11-28 03:20:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:22,748 INFO L93 Difference]: Finished difference Result 654 states and 1941 transitions. [2020-11-28 03:20:22,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:20:22,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-11-28 03:20:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:22,754 INFO L225 Difference]: With dead ends: 654 [2020-11-28 03:20:22,754 INFO L226 Difference]: Without dead ends: 606 [2020-11-28 03:20:22,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:20:22,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-11-28 03:20:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 570. [2020-11-28 03:20:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2020-11-28 03:20:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1706 transitions. [2020-11-28 03:20:22,780 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1706 transitions. Word has length 14 [2020-11-28 03:20:22,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:22,780 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 1706 transitions. [2020-11-28 03:20:22,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:20:22,780 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1706 transitions. [2020-11-28 03:20:22,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 03:20:22,781 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:22,782 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:22,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 03:20:22,782 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:22,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:22,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1801189235, now seen corresponding path program 2 times [2020-11-28 03:20:22,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:22,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483212268] [2020-11-28 03:20:22,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:23,046 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:20:23,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483212268] [2020-11-28 03:20:23,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:23,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:20:23,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212983756] [2020-11-28 03:20:23,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:20:23,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:23,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:20:23,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:20:23,048 INFO L87 Difference]: Start difference. First operand 570 states and 1706 transitions. Second operand 7 states. [2020-11-28 03:20:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:23,186 INFO L93 Difference]: Finished difference Result 666 states and 1974 transitions. [2020-11-28 03:20:23,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:20:23,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-11-28 03:20:23,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:23,193 INFO L225 Difference]: With dead ends: 666 [2020-11-28 03:20:23,193 INFO L226 Difference]: Without dead ends: 618 [2020-11-28 03:20:23,193 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:20:23,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-11-28 03:20:23,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 566. [2020-11-28 03:20:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2020-11-28 03:20:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1695 transitions. [2020-11-28 03:20:23,221 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 1695 transitions. Word has length 14 [2020-11-28 03:20:23,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:23,222 INFO L481 AbstractCegarLoop]: Abstraction has 566 states and 1695 transitions. [2020-11-28 03:20:23,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:20:23,222 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1695 transitions. [2020-11-28 03:20:23,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 03:20:23,223 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:23,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:23,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 03:20:23,224 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:23,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:23,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1148844569, now seen corresponding path program 3 times [2020-11-28 03:20:23,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:23,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576519554] [2020-11-28 03:20:23,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:23,453 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:20:23,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576519554] [2020-11-28 03:20:23,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:23,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:20:23,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889133785] [2020-11-28 03:20:23,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:20:23,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:23,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:20:23,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:20:23,455 INFO L87 Difference]: Start difference. First operand 566 states and 1695 transitions. Second operand 7 states. [2020-11-28 03:20:23,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:23,673 INFO L93 Difference]: Finished difference Result 646 states and 1887 transitions. [2020-11-28 03:20:23,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:20:23,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-11-28 03:20:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:23,685 INFO L225 Difference]: With dead ends: 646 [2020-11-28 03:20:23,685 INFO L226 Difference]: Without dead ends: 590 [2020-11-28 03:20:23,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2020-11-28 03:20:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-11-28 03:20:23,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 538. [2020-11-28 03:20:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2020-11-28 03:20:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1606 transitions. [2020-11-28 03:20:23,711 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1606 transitions. Word has length 14 [2020-11-28 03:20:23,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:23,711 INFO L481 AbstractCegarLoop]: Abstraction has 538 states and 1606 transitions. [2020-11-28 03:20:23,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:20:23,711 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1606 transitions. [2020-11-28 03:20:23,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 03:20:23,713 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:23,713 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:23,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 03:20:23,713 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:23,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:23,717 INFO L82 PathProgramCache]: Analyzing trace with hash -120329848, now seen corresponding path program 1 times [2020-11-28 03:20:23,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:23,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683917294] [2020-11-28 03:20:23,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:24,046 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:20:24,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683917294] [2020-11-28 03:20:24,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:24,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 03:20:24,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560882963] [2020-11-28 03:20:24,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-28 03:20:24,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:24,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 03:20:24,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:20:24,048 INFO L87 Difference]: Start difference. First operand 538 states and 1606 transitions. Second operand 8 states. [2020-11-28 03:20:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:24,403 INFO L93 Difference]: Finished difference Result 542 states and 1593 transitions. [2020-11-28 03:20:24,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:20:24,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-11-28 03:20:24,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:24,410 INFO L225 Difference]: With dead ends: 542 [2020-11-28 03:20:24,410 INFO L226 Difference]: Without dead ends: 510 [2020-11-28 03:20:24,410 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-28 03:20:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2020-11-28 03:20:24,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 506. [2020-11-28 03:20:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2020-11-28 03:20:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1502 transitions. [2020-11-28 03:20:24,439 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1502 transitions. Word has length 15 [2020-11-28 03:20:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:24,439 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 1502 transitions. [2020-11-28 03:20:24,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-28 03:20:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1502 transitions. [2020-11-28 03:20:24,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 03:20:24,441 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:24,442 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:24,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 03:20:24,442 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:24,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:24,442 INFO L82 PathProgramCache]: Analyzing trace with hash -680005476, now seen corresponding path program 1 times [2020-11-28 03:20:24,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:24,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408178150] [2020-11-28 03:20:24,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:24,524 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:20:24,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408178150] [2020-11-28 03:20:24,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:24,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:24,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161276417] [2020-11-28 03:20:24,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:20:24,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:24,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:20:24,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:20:24,527 INFO L87 Difference]: Start difference. First operand 506 states and 1502 transitions. Second operand 4 states. [2020-11-28 03:20:24,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:24,575 INFO L93 Difference]: Finished difference Result 488 states and 1285 transitions. [2020-11-28 03:20:24,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:20:24,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-28 03:20:24,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:24,579 INFO L225 Difference]: With dead ends: 488 [2020-11-28 03:20:24,580 INFO L226 Difference]: Without dead ends: 360 [2020-11-28 03:20:24,580 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:20:24,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2020-11-28 03:20:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2020-11-28 03:20:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-11-28 03:20:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 918 transitions. [2020-11-28 03:20:24,598 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 918 transitions. Word has length 15 [2020-11-28 03:20:24,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:24,598 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 918 transitions. [2020-11-28 03:20:24,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:20:24,599 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 918 transitions. [2020-11-28 03:20:24,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-28 03:20:24,600 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:24,600 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:20:24,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 03:20:24,600 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:24,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:24,601 INFO L82 PathProgramCache]: Analyzing trace with hash -2102562398, now seen corresponding path program 1 times [2020-11-28 03:20:24,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:24,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376970933] [2020-11-28 03:20:24,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:24,714 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:20:24,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376970933] [2020-11-28 03:20:24,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:24,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:20:24,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671058437] [2020-11-28 03:20:24,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:20:24,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:24,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:20:24,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:20:24,716 INFO L87 Difference]: Start difference. First operand 360 states and 918 transitions. Second operand 5 states. [2020-11-28 03:20:24,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:24,778 INFO L93 Difference]: Finished difference Result 289 states and 676 transitions. [2020-11-28 03:20:24,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:20:24,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-28 03:20:24,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:24,781 INFO L225 Difference]: With dead ends: 289 [2020-11-28 03:20:24,781 INFO L226 Difference]: Without dead ends: 224 [2020-11-28 03:20:24,782 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:20:24,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-11-28 03:20:24,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2020-11-28 03:20:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-11-28 03:20:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 510 transitions. [2020-11-28 03:20:24,790 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 510 transitions. Word has length 16 [2020-11-28 03:20:24,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:24,791 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 510 transitions. [2020-11-28 03:20:24,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:20:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 510 transitions. [2020-11-28 03:20:24,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-28 03:20:24,792 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:24,792 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:20:24,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 03:20:24,793 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:24,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:24,793 INFO L82 PathProgramCache]: Analyzing trace with hash -656693885, now seen corresponding path program 1 times [2020-11-28 03:20:24,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:24,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562236233] [2020-11-28 03:20:24,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:24,868 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:20:24,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562236233] [2020-11-28 03:20:24,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:24,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:20:24,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065414175] [2020-11-28 03:20:24,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:20:24,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:24,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:20:24,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:20:24,870 INFO L87 Difference]: Start difference. First operand 224 states and 510 transitions. Second operand 5 states. [2020-11-28 03:20:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:24,922 INFO L93 Difference]: Finished difference Result 303 states and 672 transitions. [2020-11-28 03:20:24,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:20:24,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-11-28 03:20:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:24,924 INFO L225 Difference]: With dead ends: 303 [2020-11-28 03:20:24,924 INFO L226 Difference]: Without dead ends: 137 [2020-11-28 03:20:24,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:20:24,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-28 03:20:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-11-28 03:20:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-11-28 03:20:24,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 276 transitions. [2020-11-28 03:20:24,929 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 276 transitions. Word has length 18 [2020-11-28 03:20:24,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:24,929 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 276 transitions. [2020-11-28 03:20:24,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:20:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 276 transitions. [2020-11-28 03:20:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-28 03:20:24,930 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:24,930 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:20:24,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 03:20:24,930 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:24,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:24,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1583508457, now seen corresponding path program 2 times [2020-11-28 03:20:24,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:24,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423390723] [2020-11-28 03:20:24,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:25,019 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:20:25,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423390723] [2020-11-28 03:20:25,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:25,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:20:25,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587695799] [2020-11-28 03:20:25,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:20:25,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:25,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:20:25,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:20:25,021 INFO L87 Difference]: Start difference. First operand 137 states and 276 transitions. Second operand 6 states. [2020-11-28 03:20:25,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:25,132 INFO L93 Difference]: Finished difference Result 194 states and 376 transitions. [2020-11-28 03:20:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:20:25,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-28 03:20:25,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:25,133 INFO L225 Difference]: With dead ends: 194 [2020-11-28 03:20:25,134 INFO L226 Difference]: Without dead ends: 139 [2020-11-28 03:20:25,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:20:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-28 03:20:25,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2020-11-28 03:20:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-11-28 03:20:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 248 transitions. [2020-11-28 03:20:25,139 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 248 transitions. Word has length 18 [2020-11-28 03:20:25,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:25,139 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 248 transitions. [2020-11-28 03:20:25,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:20:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 248 transitions. [2020-11-28 03:20:25,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-28 03:20:25,140 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:25,140 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:20:25,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-28 03:20:25,141 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:25,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:25,141 INFO L82 PathProgramCache]: Analyzing trace with hash -533573773, now seen corresponding path program 1 times [2020-11-28 03:20:25,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:25,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029101838] [2020-11-28 03:20:25,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:25,257 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:20:25,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029101838] [2020-11-28 03:20:25,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:25,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:20:25,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638608359] [2020-11-28 03:20:25,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:20:25,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:25,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:20:25,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:20:25,259 INFO L87 Difference]: Start difference. First operand 131 states and 248 transitions. Second operand 6 states. [2020-11-28 03:20:25,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:25,322 INFO L93 Difference]: Finished difference Result 108 states and 201 transitions. [2020-11-28 03:20:25,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:20:25,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-11-28 03:20:25,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:25,324 INFO L225 Difference]: With dead ends: 108 [2020-11-28 03:20:25,324 INFO L226 Difference]: Without dead ends: 53 [2020-11-28 03:20:25,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:20:25,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-28 03:20:25,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2020-11-28 03:20:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-11-28 03:20:25,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 82 transitions. [2020-11-28 03:20:25,326 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 82 transitions. Word has length 19 [2020-11-28 03:20:25,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:25,327 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 82 transitions. [2020-11-28 03:20:25,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:20:25,327 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 82 transitions. [2020-11-28 03:20:25,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-28 03:20:25,327 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:25,327 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] [2020-11-28 03:20:25,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-28 03:20:25,328 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:25,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:25,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1141617774, now seen corresponding path program 1 times [2020-11-28 03:20:25,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:25,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655282144] [2020-11-28 03:20:25,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:25,750 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 23 [2020-11-28 03:20:25,872 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 25 [2020-11-28 03:20:26,085 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:20:26,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655282144] [2020-11-28 03:20:26,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:26,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-28 03:20:26,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831735205] [2020-11-28 03:20:26,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-28 03:20:26,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:26,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 03:20:26,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:20:26,086 INFO L87 Difference]: Start difference. First operand 49 states and 82 transitions. Second operand 9 states. [2020-11-28 03:20:26,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:26,307 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2020-11-28 03:20:26,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:20:26,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-11-28 03:20:26,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:26,308 INFO L225 Difference]: With dead ends: 64 [2020-11-28 03:20:26,309 INFO L226 Difference]: Without dead ends: 37 [2020-11-28 03:20:26,309 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-28 03:20:26,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-28 03:20:26,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-28 03:20:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-28 03:20:26,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2020-11-28 03:20:26,315 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 22 [2020-11-28 03:20:26,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:26,316 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2020-11-28 03:20:26,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-28 03:20:26,316 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2020-11-28 03:20:26,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-28 03:20:26,316 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:26,316 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] [2020-11-28 03:20:26,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-28 03:20:26,317 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:26,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:26,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1834769304, now seen corresponding path program 2 times [2020-11-28 03:20:26,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:26,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65333748] [2020-11-28 03:20:26,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:26,383 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:26,440 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:26,505 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:26,507 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 03:20:26,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-28 03:20:26,535 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:20:26,535 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [779] [2020-11-28 03:20:26,537 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:20:26,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,538 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:20:26,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,538 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:20:26,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,539 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:20:26,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,539 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:20:26,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,540 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:20:26,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,540 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:20:26,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,541 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:20:26,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,541 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:20:26,542 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,542 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:20:26,542 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,543 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:20:26,543 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,543 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:20:26,543 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,544 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:20:26,544 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,544 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:20:26,544 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,544 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:20:26,544 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,545 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:20:26,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,551 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:20:26,551 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,551 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:20:26,551 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,552 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:20:26,552 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,552 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:20:26,552 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,552 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:20:26,552 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,553 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:20:26,553 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,553 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:20:26,553 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,553 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:20:26,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,554 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:20:26,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,555 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:20:26,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,555 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:20:26,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:20:26 BasicIcfg [2020-11-28 03:20:26,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:20:26,654 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:20:26,654 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:20:26,655 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:20:26,655 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:09" (3/4) ... [2020-11-28 03:20:26,658 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 03:20: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:20:26,669 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [779] [2020-11-28 03:20: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:20:26,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20: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:20:26,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,678 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:20:26,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,678 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:20:26,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,678 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:20:26,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,679 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:20:26,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,679 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:20:26,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:20:26,813 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fd8f4494-02d9-40dc-bf18-fdd7d0db1c5d/bin/uautomizer/witness.graphml [2020-11-28 03:20:26,814 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:20:26,816 INFO L168 Benchmark]: Toolchain (without parser) took 20896.38 ms. Allocated memory was 88.1 MB in the beginning and 331.4 MB in the end (delta: 243.3 MB). Free memory was 54.8 MB in the beginning and 208.7 MB in the end (delta: -153.9 MB). Peak memory consumption was 90.0 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:26,816 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 88.1 MB. Free memory was 46.9 MB in the beginning and 46.9 MB in the end (delta: 34.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:20:26,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.49 ms. Allocated memory is still 88.1 MB. Free memory was 54.6 MB in the beginning and 41.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:26,817 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.05 ms. Allocated memory is still 88.1 MB. Free memory was 41.3 MB in the beginning and 38.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:26,817 INFO L168 Benchmark]: Boogie Preprocessor took 74.24 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 38.2 MB in the beginning and 84.5 MB in the end (delta: -46.3 MB). Peak memory consumption was 6.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:26,818 INFO L168 Benchmark]: RCFGBuilder took 2609.72 ms. Allocated memory was 107.0 MB in the beginning and 138.4 MB in the end (delta: 31.5 MB). Free memory was 84.5 MB in the beginning and 104.0 MB in the end (delta: -19.4 MB). Peak memory consumption was 56.6 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:26,818 INFO L168 Benchmark]: TraceAbstraction took 17120.02 ms. Allocated memory was 138.4 MB in the beginning and 331.4 MB in the end (delta: 192.9 MB). Free memory was 104.0 MB in the beginning and 223.4 MB in the end (delta: -119.4 MB). Peak memory consumption was 72.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:26,819 INFO L168 Benchmark]: Witness Printer took 159.52 ms. Allocated memory is still 331.4 MB. Free memory was 223.4 MB in the beginning and 208.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:26,823 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.31 ms. Allocated memory is still 88.1 MB. Free memory was 46.9 MB in the beginning and 46.9 MB in the end (delta: 34.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 797.49 ms. Allocated memory is still 88.1 MB. Free memory was 54.6 MB in the beginning and 41.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 108.05 ms. Allocated memory is still 88.1 MB. Free memory was 41.3 MB in the beginning and 38.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 74.24 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 38.2 MB in the beginning and 84.5 MB in the end (delta: -46.3 MB). Peak memory consumption was 6.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2609.72 ms. Allocated memory was 107.0 MB in the beginning and 138.4 MB in the end (delta: 31.5 MB). Free memory was 84.5 MB in the beginning and 104.0 MB in the end (delta: -19.4 MB). Peak memory consumption was 56.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17120.02 ms. Allocated memory was 138.4 MB in the beginning and 331.4 MB in the end (delta: 192.9 MB). Free memory was 104.0 MB in the beginning and 223.4 MB in the end (delta: -119.4 MB). Peak memory consumption was 72.5 MB. Max. memory is 16.1 GB. * Witness Printer took 159.52 ms. Allocated memory is still 331.4 MB. Free memory was 223.4 MB in the beginning and 208.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1378 VarBasedMoverChecksPositive, 74 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 55 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 147 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.6s, 111 PlacesBefore, 37 PlacesAfterwards, 104 TransitionsBefore, 28 TransitionsAfterwards, 1922 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 5459 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1214; [L824] FCALL, FORK 0 pthread_create(&t1214, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1215; [L826] FCALL, FORK 0 pthread_create(&t1215, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1216; [L828] FCALL, FORK 0 pthread_create(&t1216, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L760] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L845] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L846] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L846] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L850] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L850] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix045_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 519 SDtfs, 540 SDslu, 1142 SDs, 0 SdLazy, 517 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=890occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 180 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 34182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...