./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe017_rmo.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_c7ab2e27-7230-4c81-8175-c481cbfda2be/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_c7ab2e27-7230-4c81-8175-c481cbfda2be/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c7ab2e27-7230-4c81-8175-c481cbfda2be/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c7ab2e27-7230-4c81-8175-c481cbfda2be/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe017_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c7ab2e27-7230-4c81-8175-c481cbfda2be/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c7ab2e27-7230-4c81-8175-c481cbfda2be/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 c88a7004d637e9a93226ab5afffb63cbef8fe722 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:57,080 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:20:57,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:20:57,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:20:57,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:20:57,138 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:20:57,141 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:20:57,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:20:57,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:20:57,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:20:57,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:20:57,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:20:57,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:20:57,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:20:57,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:20:57,171 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:20:57,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:20:57,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:20:57,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:20:57,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:20:57,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:20:57,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:20:57,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:20:57,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:20:57,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:20:57,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:20:57,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:20:57,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:20:57,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:20:57,212 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:20:57,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:20:57,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:20:57,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:20:57,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:20:57,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:20:57,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:20:57,221 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:20:57,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:20:57,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:20:57,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:20:57,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:20:57,231 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c7ab2e27-7230-4c81-8175-c481cbfda2be/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:20:57,277 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:20:57,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:20:57,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:20:57,280 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:20:57,280 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:20:57,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:20:57,281 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:20:57,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:20:57,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:20:57,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:20:57,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:20:57,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:20:57,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:20:57,283 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:20:57,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:20:57,284 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:20:57,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:20:57,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:20:57,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:20:57,285 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:20:57,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:20:57,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:20:57,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:20:57,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:20:57,286 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:20:57,286 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:20:57,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:20:57,287 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:20:57,287 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:20:57,287 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_c7ab2e27-7230-4c81-8175-c481cbfda2be/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_c7ab2e27-7230-4c81-8175-c481cbfda2be/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 -> c88a7004d637e9a93226ab5afffb63cbef8fe722 [2020-11-28 03:20:57,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:20:57,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:20:57,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:20:57,670 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:20:57,671 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:20:57,672 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c7ab2e27-7230-4c81-8175-c481cbfda2be/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe017_rmo.opt.i [2020-11-28 03:20:57,756 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c7ab2e27-7230-4c81-8175-c481cbfda2be/bin/uautomizer/data/81cf11311/66b42472d01443a7afb462255a5f18e7/FLAG7be8ee223 [2020-11-28 03:20:58,325 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:20:58,326 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c7ab2e27-7230-4c81-8175-c481cbfda2be/sv-benchmarks/c/pthread-wmm/safe017_rmo.opt.i [2020-11-28 03:20:58,351 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c7ab2e27-7230-4c81-8175-c481cbfda2be/bin/uautomizer/data/81cf11311/66b42472d01443a7afb462255a5f18e7/FLAG7be8ee223 [2020-11-28 03:20:58,614 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c7ab2e27-7230-4c81-8175-c481cbfda2be/bin/uautomizer/data/81cf11311/66b42472d01443a7afb462255a5f18e7 [2020-11-28 03:20:58,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:20:58,617 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:20:58,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:20:58,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:20:58,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:20:58,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:20:58" (1/1) ... [2020-11-28 03:20:58,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54853802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:58, skipping insertion in model container [2020-11-28 03:20:58,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:20:58" (1/1) ... [2020-11-28 03:20:58,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:20:58,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:20:59,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:20:59,136 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:20:59,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:20:59,267 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:20:59,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:59 WrapperNode [2020-11-28 03:20:59,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:20:59,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:20:59,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:20:59,270 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:20:59,277 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:59" (1/1) ... [2020-11-28 03:20:59,295 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:59" (1/1) ... [2020-11-28 03:20:59,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:20:59,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:20:59,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:20:59,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:20:59,336 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:59" (1/1) ... [2020-11-28 03:20:59,337 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:59" (1/1) ... [2020-11-28 03:20:59,341 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:59" (1/1) ... [2020-11-28 03:20:59,342 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:59" (1/1) ... [2020-11-28 03:20:59,352 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:59" (1/1) ... [2020-11-28 03:20:59,355 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:59" (1/1) ... [2020-11-28 03:20:59,369 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:59" (1/1) ... [2020-11-28 03:20:59,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:20:59,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:20:59,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:20:59,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:20:59,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7ab2e27-7230-4c81-8175-c481cbfda2be/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:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 03:20:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 03:20:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:20:59,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 03:20:59,500 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 03:20:59,500 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 03:20:59,501 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 03:20:59,501 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 03:20:59,501 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 03:20:59,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 03:20:59,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:20:59,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 03:20:59,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:20:59,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:20:59,505 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:21:02,259 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:21:02,259 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 03:21:02,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:21:02 BoogieIcfgContainer [2020-11-28 03:21:02,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:21:02,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:21:02,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:21:02,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:21:02,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:20:58" (1/3) ... [2020-11-28 03:21:02,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a79753e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:21:02, skipping insertion in model container [2020-11-28 03:21:02,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:59" (2/3) ... [2020-11-28 03:21:02,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a79753e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:21:02, skipping insertion in model container [2020-11-28 03:21:02,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:21:02" (3/3) ... [2020-11-28 03:21:02,273 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_rmo.opt.i [2020-11-28 03:21:02,286 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 03:21:02,286 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:21:02,292 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 03:21:02,293 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 03:21:02,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,342 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,342 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,344 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,348 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,348 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,352 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,352 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,358 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,360 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,360 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,362 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,363 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,366 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,366 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:21:02,370 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 03:21:02,383 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-28 03:21:02,405 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:21:02,406 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:21:02,406 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:21:02,406 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:21:02,406 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:21:02,407 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:21:02,407 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:21:02,407 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:21:02,419 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 03:21:02,421 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 99 transitions, 213 flow [2020-11-28 03:21:02,425 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 99 transitions, 213 flow [2020-11-28 03:21:02,427 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 106 places, 99 transitions, 213 flow [2020-11-28 03:21:02,490 INFO L129 PetriNetUnfolder]: 3/96 cut-off events. [2020-11-28 03:21:02,490 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 03:21:02,495 INFO L80 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 3/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-11-28 03:21:02,501 INFO L116 LiptonReduction]: Number of co-enabled transitions 1770 [2020-11-28 03:21:02,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:21:02,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:02,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:02,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:02,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:02,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:21:02,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:21:02,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:03,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:03,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:03,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:03,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:03,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:03,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:03,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:03,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:03,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:03,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:21:03,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:21:03,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:21:03,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:21:03,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:03,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:21:03,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:03,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:03,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:03,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:03,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:03,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:03,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:03,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:03,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:03,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:03,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:03,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:21:03,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:21:03,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:21:03,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:21:03,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:03,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:03,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:21:03,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:21:03,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,763 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-28 03:21:03,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:21:03,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:03,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:03,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:03,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:21:03,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:21:03,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:04,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:04,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:04,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:04,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:21:04,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:21:04,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:21:04,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:21:04,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:04,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:21:04,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:04,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-11-28 03:21:04,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:04,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:04,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:04,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:04,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:04,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:04,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:21:04,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:21:04,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:21:04,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:21:04,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:04,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:04,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:21:04,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:21:04,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:21:04,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:04,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:21:04,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:04,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:04,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:04,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:04,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:04,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:21:04,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:21:04,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:21:04,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:21:04,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:04,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:04,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:21:04,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:21:04,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:21:04,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:04,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:04,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:21:04,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:21:04,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:04,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:04,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:04,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:04,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:04,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:21:04,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:21:04,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:04,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:21:04,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-11-28 03:21:05,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:05,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:21:05,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:05,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:21:05,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-28 03:21:05,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-28 03:21:05,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:21:05,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:05,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:21:05,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:05,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:21:05,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:05,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:21:05,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:05,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:21:05,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:05,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:21:05,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:05,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:21:05,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:05,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-11-28 03:21:05,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:05,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:21:05,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:05,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:05,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:07,185 WARN L193 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-11-28 03:21:07,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-11-28 03:21:07,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:07,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 03:21:07,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:08,267 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 142 DAG size of output: 121 [2020-11-28 03:21:08,722 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-28 03:21:08,854 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 03:21:09,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-28 03:21:09,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:09,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:09,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-28 03:21:09,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:09,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-28 03:21:09,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-28 03:21:09,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:09,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-28 03:21:09,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:09,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:09,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:09,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:09,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:09,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:10,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:21:10,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:10,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:21:10,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:10,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:10,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:10,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:10,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:10,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:10,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:10,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:10,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:10,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-28 03:21:10,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:10,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:10,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 03:21:10,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:10,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:10,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:10,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:10,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:10,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:10,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:10,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:21:10,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:10,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:21:10,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:10,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:10,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:10,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:21:10,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:10,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:21:10,680 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-28 03:21:10,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:21:10,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:10,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:21:10,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:10,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:10,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:10,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:10,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:11,563 WARN L193 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-11-28 03:21:11,848 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-28 03:21:11,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 6, 3, 6, 3, 2, 1] term [2020-11-28 03:21:11,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:11,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 6, 3, 6, 3, 2, 1] term [2020-11-28 03:21:11,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:11,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 2, 2, 1] term [2020-11-28 03:21:11,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:11,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 3, 2, 1] term [2020-11-28 03:21:11,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:11,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:11,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:11,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:11,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:11,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 6, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:11,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:11,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:11,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:11,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 6, 3, 6, 3, 2, 1] term [2020-11-28 03:21:11,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:11,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 6, 3, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:11,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:11,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 6, 3, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:11,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:12,097 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-28 03:21:12,244 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-28 03:21:13,302 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-11-28 03:21:13,777 WARN L193 SmtUtils]: Spent 472.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-11-28 03:21:13,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 03:21:13,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:13,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 03:21:13,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:13,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 03:21:13,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:13,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:21:13,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:13,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:13,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:13,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:13,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:13,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:13,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:13,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:13,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:13,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 03:21:13,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:13,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:13,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:13,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:13,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:14,458 WARN L193 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-11-28 03:21:14,669 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-28 03:21:14,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 03:21:14,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:21:14,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 03:21:14,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:14,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 03:21:14,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:14,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:21:14,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:14,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:14,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:14,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:14,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:14,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:14,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:14,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:14,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:14,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 03:21:14,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:14,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:14,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:14,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:14,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:14,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:14,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:14,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:14,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:14,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:14,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:14,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:14,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:14,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:14,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:14,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:14,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:14,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:14,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:21:14,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:14,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:21:14,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:14,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:14,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:14,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:14,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:14,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:21:14,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:14,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:21:14,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:14,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:14,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:14,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:14,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:14,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:14,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:14,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:15,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:15,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:15,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:15,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:15,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:15,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:15,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:15,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:15,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:15,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:15,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:15,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:15,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:15,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:21:15,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:15,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:21:15,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:15,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:15,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:15,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:15,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:15,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:21:15,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:15,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:21:15,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:15,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:15,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:15,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:21:15,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:21:15,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:15,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:21:15,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:21:15,245 INFO L131 LiptonReduction]: Checked pairs total: 4794 [2020-11-28 03:21:15,246 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-11-28 03:21:15,251 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2020-11-28 03:21:15,312 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 662 states. [2020-11-28 03:21:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states. [2020-11-28 03:21:15,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-28 03:21:15,321 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:15,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-28 03:21:15,323 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:15,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:15,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1087337, now seen corresponding path program 1 times [2020-11-28 03:21:15,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:15,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748209531] [2020-11-28 03:21:15,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:15,666 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:21:15,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748209531] [2020-11-28 03:21:15,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:15,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:21:15,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484117532] [2020-11-28 03:21:15,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:21:15,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:15,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:21:15,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:21:15,694 INFO L87 Difference]: Start difference. First operand 662 states. Second operand 3 states. [2020-11-28 03:21:15,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:15,853 INFO L93 Difference]: Finished difference Result 552 states and 1697 transitions. [2020-11-28 03:21:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:21:15,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-28 03:21:15,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:15,888 INFO L225 Difference]: With dead ends: 552 [2020-11-28 03:21:15,890 INFO L226 Difference]: Without dead ends: 452 [2020-11-28 03:21:15,892 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:21:15,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-11-28 03:21:16,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-11-28 03:21:16,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-11-28 03:21:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1362 transitions. [2020-11-28 03:21:16,027 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1362 transitions. Word has length 3 [2020-11-28 03:21:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:16,028 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1362 transitions. [2020-11-28 03:21:16,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:21:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1362 transitions. [2020-11-28 03:21:16,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-28 03:21:16,030 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:16,030 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:16,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:21:16,031 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:16,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:16,035 INFO L82 PathProgramCache]: Analyzing trace with hash 153095369, now seen corresponding path program 1 times [2020-11-28 03:21:16,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:16,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727818082] [2020-11-28 03:21:16,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:16,225 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:21:16,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727818082] [2020-11-28 03:21:16,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:16,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:21:16,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283775771] [2020-11-28 03:21:16,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:21:16,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:16,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:21:16,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:21:16,228 INFO L87 Difference]: Start difference. First operand 452 states and 1362 transitions. Second operand 3 states. [2020-11-28 03:21:16,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:16,287 INFO L93 Difference]: Finished difference Result 448 states and 1347 transitions. [2020-11-28 03:21:16,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:21:16,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-28 03:21:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:16,297 INFO L225 Difference]: With dead ends: 448 [2020-11-28 03:21:16,297 INFO L226 Difference]: Without dead ends: 448 [2020-11-28 03:21:16,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:21:16,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-11-28 03:21:16,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2020-11-28 03:21:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2020-11-28 03:21:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1347 transitions. [2020-11-28 03:21:16,325 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1347 transitions. Word has length 9 [2020-11-28 03:21:16,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:16,326 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 1347 transitions. [2020-11-28 03:21:16,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:21:16,326 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1347 transitions. [2020-11-28 03:21:16,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 03:21:16,331 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:16,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:16,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:21:16,331 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:16,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:16,332 INFO L82 PathProgramCache]: Analyzing trace with hash 528518820, now seen corresponding path program 1 times [2020-11-28 03:21:16,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:16,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971805090] [2020-11-28 03:21:16,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:16,647 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:21:16,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971805090] [2020-11-28 03:21:16,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:16,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:21:16,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512316792] [2020-11-28 03:21:16,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:21:16,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:16,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:21:16,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:21:16,649 INFO L87 Difference]: Start difference. First operand 448 states and 1347 transitions. Second operand 5 states. [2020-11-28 03:21:16,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:16,776 INFO L93 Difference]: Finished difference Result 452 states and 1361 transitions. [2020-11-28 03:21:16,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:21:16,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-11-28 03:21:16,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:16,783 INFO L225 Difference]: With dead ends: 452 [2020-11-28 03:21:16,783 INFO L226 Difference]: Without dead ends: 452 [2020-11-28 03:21:16,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:21:16,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-11-28 03:21:16,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-11-28 03:21:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-11-28 03:21:16,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1361 transitions. [2020-11-28 03:21:16,806 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1361 transitions. Word has length 10 [2020-11-28 03:21:16,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:16,806 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1361 transitions. [2020-11-28 03:21:16,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:21:16,807 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1361 transitions. [2020-11-28 03:21:16,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 03:21:16,815 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:16,815 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:16,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 03:21:16,815 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:16,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:16,816 INFO L82 PathProgramCache]: Analyzing trace with hash 450921755, now seen corresponding path program 1 times [2020-11-28 03:21:16,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:16,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924458299] [2020-11-28 03:21:16,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:16,967 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:21:16,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924458299] [2020-11-28 03:21:16,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:16,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:21:16,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954534774] [2020-11-28 03:21:16,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:21:16,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:16,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:21:16,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:21:16,970 INFO L87 Difference]: Start difference. First operand 452 states and 1361 transitions. Second operand 3 states. [2020-11-28 03:21:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:17,026 INFO L93 Difference]: Finished difference Result 448 states and 1346 transitions. [2020-11-28 03:21:17,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:21:17,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-28 03:21:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:17,032 INFO L225 Difference]: With dead ends: 448 [2020-11-28 03:21:17,032 INFO L226 Difference]: Without dead ends: 448 [2020-11-28 03:21:17,032 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:21:17,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-11-28 03:21:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2020-11-28 03:21:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2020-11-28 03:21:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1346 transitions. [2020-11-28 03:21:17,052 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1346 transitions. Word has length 10 [2020-11-28 03:21:17,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:17,053 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 1346 transitions. [2020-11-28 03:21:17,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:21:17,053 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1346 transitions. [2020-11-28 03:21:17,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 03:21:17,054 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:17,054 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:17,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 03:21:17,055 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:17,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:17,055 INFO L82 PathProgramCache]: Analyzing trace with hash 450988436, now seen corresponding path program 2 times [2020-11-28 03:21:17,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:17,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574413335] [2020-11-28 03:21:17,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:17,165 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:21:17,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574413335] [2020-11-28 03:21:17,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:17,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:21:17,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596039034] [2020-11-28 03:21:17,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:21:17,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:17,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:21:17,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:21:17,168 INFO L87 Difference]: Start difference. First operand 448 states and 1346 transitions. Second operand 3 states. [2020-11-28 03:21:17,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:17,189 INFO L93 Difference]: Finished difference Result 432 states and 1290 transitions. [2020-11-28 03:21:17,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:21:17,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-28 03:21:17,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:17,196 INFO L225 Difference]: With dead ends: 432 [2020-11-28 03:21:17,197 INFO L226 Difference]: Without dead ends: 432 [2020-11-28 03:21:17,197 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:21:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-11-28 03:21:17,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 431. [2020-11-28 03:21:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-11-28 03:21:17,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1287 transitions. [2020-11-28 03:21:17,218 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1287 transitions. Word has length 10 [2020-11-28 03:21:17,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:17,218 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 1287 transitions. [2020-11-28 03:21:17,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:21:17,218 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1287 transitions. [2020-11-28 03:21:17,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 03:21:17,220 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:17,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:17,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 03:21:17,220 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:17,221 INFO L82 PathProgramCache]: Analyzing trace with hash -795853152, now seen corresponding path program 1 times [2020-11-28 03:21:17,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:17,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620034978] [2020-11-28 03:21:17,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:17,296 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:21:17,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620034978] [2020-11-28 03:21:17,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:17,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:21:17,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488431679] [2020-11-28 03:21:17,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:21:17,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:17,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:21:17,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:21:17,298 INFO L87 Difference]: Start difference. First operand 431 states and 1287 transitions. Second operand 4 states. [2020-11-28 03:21:17,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:17,394 INFO L93 Difference]: Finished difference Result 427 states and 1272 transitions. [2020-11-28 03:21:17,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:21:17,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-28 03:21:17,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:17,400 INFO L225 Difference]: With dead ends: 427 [2020-11-28 03:21:17,400 INFO L226 Difference]: Without dead ends: 427 [2020-11-28 03:21:17,400 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:21:17,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-11-28 03:21:17,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 424. [2020-11-28 03:21:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-11-28 03:21:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1261 transitions. [2020-11-28 03:21:17,418 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1261 transitions. Word has length 11 [2020-11-28 03:21:17,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:17,419 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 1261 transitions. [2020-11-28 03:21:17,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:21:17,419 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1261 transitions. [2020-11-28 03:21:17,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 03:21:17,420 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:17,420 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:17,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 03:21:17,420 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:17,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:17,421 INFO L82 PathProgramCache]: Analyzing trace with hash 308607583, now seen corresponding path program 1 times [2020-11-28 03:21:17,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:17,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149980055] [2020-11-28 03:21:17,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:17,512 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:21:17,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149980055] [2020-11-28 03:21:17,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:17,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:21:17,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453365542] [2020-11-28 03:21:17,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:21:17,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:17,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:21:17,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:21:17,514 INFO L87 Difference]: Start difference. First operand 424 states and 1261 transitions. Second operand 3 states. [2020-11-28 03:21:17,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:17,556 INFO L93 Difference]: Finished difference Result 421 states and 1250 transitions. [2020-11-28 03:21:17,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:21:17,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-28 03:21:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:17,562 INFO L225 Difference]: With dead ends: 421 [2020-11-28 03:21:17,562 INFO L226 Difference]: Without dead ends: 421 [2020-11-28 03:21:17,562 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 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:21:17,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-11-28 03:21:17,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-11-28 03:21:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-11-28 03:21:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1250 transitions. [2020-11-28 03:21:17,581 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1250 transitions. Word has length 11 [2020-11-28 03:21:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:17,581 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 1250 transitions. [2020-11-28 03:21:17,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:21:17,582 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1250 transitions. [2020-11-28 03:21:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 03:21:17,583 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:17,583 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:17,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 03:21:17,583 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:17,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:17,584 INFO L82 PathProgramCache]: Analyzing trace with hash 313291130, now seen corresponding path program 1 times [2020-11-28 03:21:17,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:17,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212072854] [2020-11-28 03:21:17,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:17,732 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:21:17,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212072854] [2020-11-28 03:21:17,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:17,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:21:17,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398999098] [2020-11-28 03:21:17,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:21:17,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:17,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:21:17,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:21:17,734 INFO L87 Difference]: Start difference. First operand 421 states and 1250 transitions. Second operand 5 states. [2020-11-28 03:21:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:17,802 INFO L93 Difference]: Finished difference Result 418 states and 1238 transitions. [2020-11-28 03:21:17,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:21:17,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-28 03:21:17,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:17,808 INFO L225 Difference]: With dead ends: 418 [2020-11-28 03:21:17,808 INFO L226 Difference]: Without dead ends: 418 [2020-11-28 03:21:17,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:21:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-11-28 03:21:17,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2020-11-28 03:21:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-28 03:21:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1238 transitions. [2020-11-28 03:21:17,827 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1238 transitions. Word has length 12 [2020-11-28 03:21:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:17,827 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 1238 transitions. [2020-11-28 03:21:17,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:21:17,828 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1238 transitions. [2020-11-28 03:21:17,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 03:21:17,829 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:17,829 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:17,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 03:21:17,830 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:17,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:17,830 INFO L82 PathProgramCache]: Analyzing trace with hash 976819639, now seen corresponding path program 1 times [2020-11-28 03:21:17,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:17,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741877958] [2020-11-28 03:21:17,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:17,996 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:21:17,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741877958] [2020-11-28 03:21:17,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:17,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:21:17,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23748972] [2020-11-28 03:21:17,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:21:17,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:17,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:21:17,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:21:17,998 INFO L87 Difference]: Start difference. First operand 418 states and 1238 transitions. Second operand 5 states. [2020-11-28 03:21:18,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:18,119 INFO L93 Difference]: Finished difference Result 417 states and 1233 transitions. [2020-11-28 03:21:18,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:21:18,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-28 03:21:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:18,124 INFO L225 Difference]: With dead ends: 417 [2020-11-28 03:21:18,124 INFO L226 Difference]: Without dead ends: 417 [2020-11-28 03:21:18,125 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:21:18,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-11-28 03:21:18,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 409. [2020-11-28 03:21:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-11-28 03:21:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1208 transitions. [2020-11-28 03:21:18,142 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1208 transitions. Word has length 12 [2020-11-28 03:21:18,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:18,142 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 1208 transitions. [2020-11-28 03:21:18,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:21:18,142 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1208 transitions. [2020-11-28 03:21:18,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 03:21:18,144 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:18,144 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:18,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 03:21:18,144 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:18,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:18,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1088485586, now seen corresponding path program 1 times [2020-11-28 03:21:18,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:18,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004639417] [2020-11-28 03:21:18,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:18,317 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:21:18,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004639417] [2020-11-28 03:21:18,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:18,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:21:18,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133420421] [2020-11-28 03:21:18,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:21:18,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:18,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:21:18,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:21:18,319 INFO L87 Difference]: Start difference. First operand 409 states and 1208 transitions. Second operand 5 states. [2020-11-28 03:21:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:18,488 INFO L93 Difference]: Finished difference Result 483 states and 1439 transitions. [2020-11-28 03:21:18,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:21:18,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-28 03:21:18,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:18,494 INFO L225 Difference]: With dead ends: 483 [2020-11-28 03:21:18,494 INFO L226 Difference]: Without dead ends: 483 [2020-11-28 03:21:18,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:21:18,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2020-11-28 03:21:18,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 473. [2020-11-28 03:21:18,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2020-11-28 03:21:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1410 transitions. [2020-11-28 03:21:18,514 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1410 transitions. Word has length 13 [2020-11-28 03:21:18,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:18,514 INFO L481 AbstractCegarLoop]: Abstraction has 473 states and 1410 transitions. [2020-11-28 03:21:18,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:21:18,514 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1410 transitions. [2020-11-28 03:21:18,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 03:21:18,516 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:18,516 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:18,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 03:21:18,516 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:18,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:18,517 INFO L82 PathProgramCache]: Analyzing trace with hash -313686143, now seen corresponding path program 1 times [2020-11-28 03:21:18,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:18,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575657162] [2020-11-28 03:21:18,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:18,569 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:21:18,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575657162] [2020-11-28 03:21:18,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:18,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:21:18,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663635162] [2020-11-28 03:21:18,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:21:18,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:18,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:21:18,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:21:18,571 INFO L87 Difference]: Start difference. First operand 473 states and 1410 transitions. Second operand 3 states. [2020-11-28 03:21:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:18,593 INFO L93 Difference]: Finished difference Result 663 states and 1906 transitions. [2020-11-28 03:21:18,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:21:18,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-11-28 03:21:18,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:18,599 INFO L225 Difference]: With dead ends: 663 [2020-11-28 03:21:18,599 INFO L226 Difference]: Without dead ends: 483 [2020-11-28 03:21:18,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:21:18,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2020-11-28 03:21:18,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 450. [2020-11-28 03:21:18,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-11-28 03:21:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1257 transitions. [2020-11-28 03:21:18,617 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1257 transitions. Word has length 13 [2020-11-28 03:21:18,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:18,617 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1257 transitions. [2020-11-28 03:21:18,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:21:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1257 transitions. [2020-11-28 03:21:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 03:21:18,619 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:18,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:18,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 03:21:18,620 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:18,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:18,620 INFO L82 PathProgramCache]: Analyzing trace with hash 410716624, now seen corresponding path program 2 times [2020-11-28 03:21:18,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:18,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343456628] [2020-11-28 03:21:18,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:18,817 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:21:18,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343456628] [2020-11-28 03:21:18,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:18,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:21:18,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923825625] [2020-11-28 03:21:18,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:21:18,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:18,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:21:18,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:21:18,819 INFO L87 Difference]: Start difference. First operand 450 states and 1257 transitions. Second operand 6 states. [2020-11-28 03:21:18,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:18,963 INFO L93 Difference]: Finished difference Result 454 states and 1263 transitions. [2020-11-28 03:21:18,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:21:18,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-11-28 03:21:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:18,969 INFO L225 Difference]: With dead ends: 454 [2020-11-28 03:21:18,969 INFO L226 Difference]: Without dead ends: 454 [2020-11-28 03:21:18,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:21:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2020-11-28 03:21:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2020-11-28 03:21:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2020-11-28 03:21:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1263 transitions. [2020-11-28 03:21:18,987 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1263 transitions. Word has length 13 [2020-11-28 03:21:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:18,987 INFO L481 AbstractCegarLoop]: Abstraction has 454 states and 1263 transitions. [2020-11-28 03:21:18,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:21:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1263 transitions. [2020-11-28 03:21:18,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 03:21:18,989 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:18,989 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:18,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 03:21:18,990 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:18,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:18,990 INFO L82 PathProgramCache]: Analyzing trace with hash 216590530, now seen corresponding path program 1 times [2020-11-28 03:21:18,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:18,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387838093] [2020-11-28 03:21:18,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:19,109 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:21:19,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387838093] [2020-11-28 03:21:19,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:19,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:21:19,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937017541] [2020-11-28 03:21:19,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:21:19,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:19,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:21:19,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:21:19,111 INFO L87 Difference]: Start difference. First operand 454 states and 1263 transitions. Second operand 5 states. [2020-11-28 03:21:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:19,239 INFO L93 Difference]: Finished difference Result 472 states and 1312 transitions. [2020-11-28 03:21:19,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:21:19,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-28 03:21:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:19,248 INFO L225 Difference]: With dead ends: 472 [2020-11-28 03:21:19,248 INFO L226 Difference]: Without dead ends: 472 [2020-11-28 03:21:19,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:21:19,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2020-11-28 03:21:19,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 454. [2020-11-28 03:21:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2020-11-28 03:21:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1258 transitions. [2020-11-28 03:21:19,282 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1258 transitions. Word has length 13 [2020-11-28 03:21:19,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:19,283 INFO L481 AbstractCegarLoop]: Abstraction has 454 states and 1258 transitions. [2020-11-28 03:21:19,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:21:19,283 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1258 transitions. [2020-11-28 03:21:19,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 03:21:19,284 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:19,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:19,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 03:21:19,285 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:19,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:19,286 INFO L82 PathProgramCache]: Analyzing trace with hash 216637030, now seen corresponding path program 2 times [2020-11-28 03:21:19,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:19,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598275493] [2020-11-28 03:21:19,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:19,417 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:21:19,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598275493] [2020-11-28 03:21:19,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:19,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:21:19,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664678741] [2020-11-28 03:21:19,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:21:19,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:19,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:21:19,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:21:19,419 INFO L87 Difference]: Start difference. First operand 454 states and 1258 transitions. Second operand 6 states. [2020-11-28 03:21:19,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:19,642 INFO L93 Difference]: Finished difference Result 502 states and 1371 transitions. [2020-11-28 03:21:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:21:19,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-11-28 03:21:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:19,649 INFO L225 Difference]: With dead ends: 502 [2020-11-28 03:21:19,649 INFO L226 Difference]: Without dead ends: 478 [2020-11-28 03:21:19,650 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:21:19,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-11-28 03:21:19,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 436. [2020-11-28 03:21:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-11-28 03:21:19,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1208 transitions. [2020-11-28 03:21:19,673 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1208 transitions. Word has length 13 [2020-11-28 03:21:19,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:19,673 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 1208 transitions. [2020-11-28 03:21:19,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:21:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1208 transitions. [2020-11-28 03:21:19,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 03:21:19,675 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:19,675 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:19,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 03:21:19,675 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:19,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:19,676 INFO L82 PathProgramCache]: Analyzing trace with hash 219119944, now seen corresponding path program 3 times [2020-11-28 03:21:19,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:19,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360178685] [2020-11-28 03:21:19,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:19,835 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:21:19,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360178685] [2020-11-28 03:21:19,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:19,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:21:19,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045255645] [2020-11-28 03:21:19,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:21:19,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:19,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:21:19,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:21:19,837 INFO L87 Difference]: Start difference. First operand 436 states and 1208 transitions. Second operand 6 states. [2020-11-28 03:21:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:19,963 INFO L93 Difference]: Finished difference Result 432 states and 1194 transitions. [2020-11-28 03:21:19,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:21:19,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-11-28 03:21:19,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:19,968 INFO L225 Difference]: With dead ends: 432 [2020-11-28 03:21:19,969 INFO L226 Difference]: Without dead ends: 432 [2020-11-28 03:21:19,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:21:19,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-11-28 03:21:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-11-28 03:21:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-11-28 03:21:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1194 transitions. [2020-11-28 03:21:19,989 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1194 transitions. Word has length 13 [2020-11-28 03:21:19,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:19,990 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 1194 transitions. [2020-11-28 03:21:19,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:21:19,990 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1194 transitions. [2020-11-28 03:21:19,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 03:21:19,992 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:19,992 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:19,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-28 03:21:19,996 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:19,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:19,999 INFO L82 PathProgramCache]: Analyzing trace with hash 422472500, now seen corresponding path program 1 times [2020-11-28 03:21:20,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:20,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106780269] [2020-11-28 03:21:20,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:20,188 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:21:20,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106780269] [2020-11-28 03:21:20,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:20,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:21:20,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485100021] [2020-11-28 03:21:20,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:21:20,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:20,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:21:20,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:21:20,190 INFO L87 Difference]: Start difference. First operand 432 states and 1194 transitions. Second operand 6 states. [2020-11-28 03:21:20,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:20,315 INFO L93 Difference]: Finished difference Result 458 states and 1263 transitions. [2020-11-28 03:21:20,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:21:20,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-11-28 03:21:20,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:20,320 INFO L225 Difference]: With dead ends: 458 [2020-11-28 03:21:20,322 INFO L226 Difference]: Without dead ends: 458 [2020-11-28 03:21:20,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:21:20,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-11-28 03:21:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 424. [2020-11-28 03:21:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-11-28 03:21:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1180 transitions. [2020-11-28 03:21:20,346 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1180 transitions. Word has length 14 [2020-11-28 03:21:20,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:20,346 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 1180 transitions. [2020-11-28 03:21:20,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:21:20,347 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1180 transitions. [2020-11-28 03:21:20,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 03:21:20,348 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:20,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:20,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-28 03:21:20,349 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:20,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:20,349 INFO L82 PathProgramCache]: Analyzing trace with hash 422479227, now seen corresponding path program 1 times [2020-11-28 03:21:20,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:20,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623745074] [2020-11-28 03:21:20,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:20,548 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:21:20,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623745074] [2020-11-28 03:21:20,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:20,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:21:20,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595331870] [2020-11-28 03:21:20,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:21:20,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:20,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:21:20,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:21:20,550 INFO L87 Difference]: Start difference. First operand 424 states and 1180 transitions. Second operand 7 states. [2020-11-28 03:21:20,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:20,692 INFO L93 Difference]: Finished difference Result 574 states and 1556 transitions. [2020-11-28 03:21:20,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:21:20,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-11-28 03:21:20,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:20,698 INFO L225 Difference]: With dead ends: 574 [2020-11-28 03:21:20,698 INFO L226 Difference]: Without dead ends: 504 [2020-11-28 03:21:20,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:21:20,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2020-11-28 03:21:20,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 462. [2020-11-28 03:21:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2020-11-28 03:21:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1268 transitions. [2020-11-28 03:21:20,718 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1268 transitions. Word has length 14 [2020-11-28 03:21:20,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:20,718 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 1268 transitions. [2020-11-28 03:21:20,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:21:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1268 transitions. [2020-11-28 03:21:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 03:21:20,720 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:20,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:20,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-28 03:21:20,721 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:20,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:20,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1132759919, now seen corresponding path program 1 times [2020-11-28 03:21:20,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:20,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986240224] [2020-11-28 03:21:20,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:20,807 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:21:20,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986240224] [2020-11-28 03:21:20,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:20,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:21:20,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343299205] [2020-11-28 03:21:20,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:21:20,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:20,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:21:20,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:21:20,809 INFO L87 Difference]: Start difference. First operand 462 states and 1268 transitions. Second operand 5 states. [2020-11-28 03:21:20,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:20,871 INFO L93 Difference]: Finished difference Result 735 states and 1988 transitions. [2020-11-28 03:21:20,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:21:20,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-28 03:21:20,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:20,877 INFO L225 Difference]: With dead ends: 735 [2020-11-28 03:21:20,877 INFO L226 Difference]: Without dead ends: 411 [2020-11-28 03:21:20,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:21:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2020-11-28 03:21:20,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2020-11-28 03:21:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2020-11-28 03:21:20,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1088 transitions. [2020-11-28 03:21:20,894 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1088 transitions. Word has length 14 [2020-11-28 03:21:20,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:20,894 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 1088 transitions. [2020-11-28 03:21:20,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:21:20,894 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1088 transitions. [2020-11-28 03:21:20,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 03:21:20,896 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:20,896 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:20,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-28 03:21:20,896 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:20,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:20,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1854000029, now seen corresponding path program 2 times [2020-11-28 03:21:20,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:20,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939635308] [2020-11-28 03:21:20,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:21,001 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:21:21,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939635308] [2020-11-28 03:21:21,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:21,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:21:21,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463362353] [2020-11-28 03:21:21,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:21:21,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:21,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:21:21,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:21:21,003 INFO L87 Difference]: Start difference. First operand 411 states and 1088 transitions. Second operand 4 states. [2020-11-28 03:21:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:21,049 INFO L93 Difference]: Finished difference Result 414 states and 967 transitions. [2020-11-28 03:21:21,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:21:21,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-28 03:21:21,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:21,053 INFO L225 Difference]: With dead ends: 414 [2020-11-28 03:21:21,053 INFO L226 Difference]: Without dead ends: 305 [2020-11-28 03:21:21,053 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:21:21,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-11-28 03:21:21,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2020-11-28 03:21:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2020-11-28 03:21:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 699 transitions. [2020-11-28 03:21:21,065 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 699 transitions. Word has length 14 [2020-11-28 03:21:21,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:21,065 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 699 transitions. [2020-11-28 03:21:21,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:21:21,066 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 699 transitions. [2020-11-28 03:21:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 03:21:21,067 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:21,067 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:21,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-28 03:21:21,067 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:21,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:21,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1637663200, now seen corresponding path program 1 times [2020-11-28 03:21:21,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:21,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867936754] [2020-11-28 03:21:21,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:21,193 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:21:21,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867936754] [2020-11-28 03:21:21,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:21,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:21:21,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963076919] [2020-11-28 03:21:21,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:21:21,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:21,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:21:21,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:21:21,195 INFO L87 Difference]: Start difference. First operand 305 states and 699 transitions. Second operand 5 states. [2020-11-28 03:21:21,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:21,257 INFO L93 Difference]: Finished difference Result 257 states and 534 transitions. [2020-11-28 03:21:21,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:21:21,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-28 03:21:21,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:21,260 INFO L225 Difference]: With dead ends: 257 [2020-11-28 03:21:21,260 INFO L226 Difference]: Without dead ends: 196 [2020-11-28 03:21:21,261 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:21:21,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-11-28 03:21:21,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2020-11-28 03:21:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-11-28 03:21:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 390 transitions. [2020-11-28 03:21:21,267 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 390 transitions. Word has length 15 [2020-11-28 03:21:21,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:21,267 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 390 transitions. [2020-11-28 03:21:21,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:21:21,267 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 390 transitions. [2020-11-28 03:21:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 03:21:21,269 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:21,269 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:21,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-28 03:21:21,269 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:21,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:21,270 INFO L82 PathProgramCache]: Analyzing trace with hash 70390188, now seen corresponding path program 1 times [2020-11-28 03:21:21,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:21,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119002384] [2020-11-28 03:21:21,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:21,474 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:21:21,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119002384] [2020-11-28 03:21:21,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:21,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:21:21,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491091417] [2020-11-28 03:21:21,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:21:21,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:21,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:21:21,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:21:21,476 INFO L87 Difference]: Start difference. First operand 193 states and 390 transitions. Second operand 7 states. [2020-11-28 03:21:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:21,597 INFO L93 Difference]: Finished difference Result 210 states and 414 transitions. [2020-11-28 03:21:21,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:21:21,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-11-28 03:21:21,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:21,600 INFO L225 Difference]: With dead ends: 210 [2020-11-28 03:21:21,600 INFO L226 Difference]: Without dead ends: 140 [2020-11-28 03:21:21,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:21:21,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-11-28 03:21:21,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 129. [2020-11-28 03:21:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-11-28 03:21:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 262 transitions. [2020-11-28 03:21:21,604 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 262 transitions. Word has length 17 [2020-11-28 03:21:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:21,605 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 262 transitions. [2020-11-28 03:21:21,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:21:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 262 transitions. [2020-11-28 03:21:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 03:21:21,610 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:21,611 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:21,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-28 03:21:21,611 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:21,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:21,612 INFO L82 PathProgramCache]: Analyzing trace with hash 630847422, now seen corresponding path program 1 times [2020-11-28 03:21:21,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:21,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769894933] [2020-11-28 03:21:21,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:21:21,752 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:21:21,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769894933] [2020-11-28 03:21:21,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:21:21,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:21:21,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294891809] [2020-11-28 03:21:21,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:21:21,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:21:21,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:21:21,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:21:21,754 INFO L87 Difference]: Start difference. First operand 129 states and 262 transitions. Second operand 6 states. [2020-11-28 03:21:21,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:21:21,869 INFO L93 Difference]: Finished difference Result 115 states and 233 transitions. [2020-11-28 03:21:21,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:21:21,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-11-28 03:21:21,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:21:21,871 INFO L225 Difference]: With dead ends: 115 [2020-11-28 03:21:21,871 INFO L226 Difference]: Without dead ends: 69 [2020-11-28 03:21:21,872 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:21:21,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-28 03:21:21,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-11-28 03:21:21,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-28 03:21:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 128 transitions. [2020-11-28 03:21:21,875 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 128 transitions. Word has length 17 [2020-11-28 03:21:21,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:21:21,875 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 128 transitions. [2020-11-28 03:21:21,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:21:21,875 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 128 transitions. [2020-11-28 03:21:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-28 03:21:21,876 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:21:21,876 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:21:21,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-28 03:21:21,877 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:21:21,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:21:21,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1828977790, now seen corresponding path program 1 times [2020-11-28 03:21:21,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:21:21,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653690958] [2020-11-28 03:21:21,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:21:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:21:21,941 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:21:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:21:22,007 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:21:22,067 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:21:22,068 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 03:21:22,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-28 03:21:22,069 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-28 03:21:22,089 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1053] [1053] L2-->L829: Formula: (let ((.cse7 (= (mod ~y$r_buff0_thd0~0_In-860455389 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In-860455389 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-860455389 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-860455389 256) 0))) (let ((.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out-860455389 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-860455389|) (= ~y$r_buff0_thd0~0_In-860455389 ~y$r_buff0_thd0~0_Out-860455389) (= ~y$r_buff1_thd0~0_Out-860455389 ~y$r_buff1_thd0~0_In-860455389) (or (and .cse0 (= ~y$w_buff1_used~0_Out-860455389 ~y$w_buff1_used~0_In-860455389)) (and (= ~y$w_buff1_used~0_Out-860455389 0) .cse1 .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-860455389 0)) (or (and .cse3 (or (and .cse1 (= ~y~0_Out-860455389 ~y$w_buff1~0_In-860455389) .cse2) (and .cse0 (= ~y~0_Out-860455389 ~y~0_In-860455389)))) (and .cse4 (= ~y~0_Out-860455389 ~y$w_buff0~0_In-860455389) .cse5)) (or (and .cse4 .cse5 (= ~y$w_buff0_used~0_Out-860455389 0)) (and (= ~y$w_buff0_used~0_Out-860455389 ~y$w_buff0_used~0_In-860455389) .cse3))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-860455389|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-860455389, ~y$w_buff1~0=~y$w_buff1~0_In-860455389, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-860455389, ~y$w_buff0~0=~y$w_buff0~0_In-860455389, ~y~0=~y~0_In-860455389, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-860455389, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-860455389} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-860455389, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-860455389|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-860455389|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-860455389|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-860455389|, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-860455389|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-860455389|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-860455389|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-860455389, ~y$w_buff1~0=~y$w_buff1~0_In-860455389, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-860455389, ~y$w_buff0~0=~y$w_buff0~0_In-860455389, ~y~0=~y~0_Out-860455389, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-860455389, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-860455389} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-11-28 03:21:22,094 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:21:22,095 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [738] [2020-11-28 03:21:22,101 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:21:22,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,101 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:21:22,102 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,102 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:21:22,102 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,103 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:21:22,103 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,103 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:21:22,103 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,105 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:21:22,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,105 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:21:22,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,105 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:21:22,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,106 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:21:22,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,107 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:21:22,107 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,108 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:21:22,108 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,108 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:21:22,108 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,108 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:21:22,109 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,109 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:21:22,109 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,109 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:21:22,109 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,110 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:21:22,111 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,116 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:21:22,116 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,117 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:21:22,117 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,117 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:21:22,117 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,118 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:21:22,118 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,118 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:21:22,118 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,118 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:21:22,119 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,119 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:21:22,119 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,119 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:21:22,119 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,120 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:21:22,120 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,120 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:21:22,120 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,120 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:21:22,121 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,121 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:21:22,121 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:21:22 BasicIcfg [2020-11-28 03:21:22,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:21:22,215 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:21:22,215 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:21:22,215 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:21:22,216 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:21:02" (3/4) ... [2020-11-28 03:21:22,218 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 03:21:22,231 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1053] [1053] L2-->L829: Formula: (let ((.cse7 (= (mod ~y$r_buff0_thd0~0_In-860455389 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In-860455389 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-860455389 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-860455389 256) 0))) (let ((.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out-860455389 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-860455389|) (= ~y$r_buff0_thd0~0_In-860455389 ~y$r_buff0_thd0~0_Out-860455389) (= ~y$r_buff1_thd0~0_Out-860455389 ~y$r_buff1_thd0~0_In-860455389) (or (and .cse0 (= ~y$w_buff1_used~0_Out-860455389 ~y$w_buff1_used~0_In-860455389)) (and (= ~y$w_buff1_used~0_Out-860455389 0) .cse1 .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-860455389 0)) (or (and .cse3 (or (and .cse1 (= ~y~0_Out-860455389 ~y$w_buff1~0_In-860455389) .cse2) (and .cse0 (= ~y~0_Out-860455389 ~y~0_In-860455389)))) (and .cse4 (= ~y~0_Out-860455389 ~y$w_buff0~0_In-860455389) .cse5)) (or (and .cse4 .cse5 (= ~y$w_buff0_used~0_Out-860455389 0)) (and (= ~y$w_buff0_used~0_Out-860455389 ~y$w_buff0_used~0_In-860455389) .cse3))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-860455389|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-860455389, ~y$w_buff1~0=~y$w_buff1~0_In-860455389, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-860455389, ~y$w_buff0~0=~y$w_buff0~0_In-860455389, ~y~0=~y~0_In-860455389, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-860455389, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-860455389} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-860455389, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-860455389|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-860455389|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-860455389|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-860455389|, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-860455389|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-860455389|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-860455389|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-860455389, ~y$w_buff1~0=~y$w_buff1~0_In-860455389, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-860455389, ~y$w_buff0~0=~y$w_buff0~0_In-860455389, ~y~0=~y~0_Out-860455389, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-860455389, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-860455389} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-11-28 03:21:22,236 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:21:22,237 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [738] [2020-11-28 03:21:22,238 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:21:22,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,238 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:21:22,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,239 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:21:22,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,239 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:21:22,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,239 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:21:22,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,240 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:21:22,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,240 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:21:22,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,241 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:21:22,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,241 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:21:22,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,241 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:21:22,242 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,242 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:21:22,242 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,242 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:21:22,242 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,243 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:21:22,243 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,243 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:21:22,243 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,243 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:21:22,243 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,244 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:21:22,244 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,244 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:21:22,245 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,245 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:21:22,245 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,245 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:21:22,245 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,245 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:21:22,246 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,246 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:21:22,246 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,246 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:21:22,246 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,247 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:21:22,247 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,247 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:21:22,247 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,247 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:21:22,247 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,248 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:21:22,248 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,248 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:21:22,248 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,248 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:21:22,248 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:21:22,345 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c7ab2e27-7230-4c81-8175-c481cbfda2be/bin/uautomizer/witness.graphml [2020-11-28 03:21:22,345 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:21:22,346 INFO L168 Benchmark]: Toolchain (without parser) took 23728.42 ms. Allocated memory was 100.7 MB in the beginning and 377.5 MB in the end (delta: 276.8 MB). Free memory was 71.7 MB in the beginning and 292.7 MB in the end (delta: -221.0 MB). Peak memory consumption was 54.9 MB. Max. memory is 16.1 GB. [2020-11-28 03:21:22,347 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 100.7 MB. Free memory is still 58.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:21:22,347 INFO L168 Benchmark]: CACSL2BoogieTranslator took 647.18 ms. Allocated memory is still 100.7 MB. Free memory was 71.7 MB in the beginning and 53.1 MB in the end (delta: 18.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-28 03:21:22,348 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.84 ms. Allocated memory is still 100.7 MB. Free memory was 53.1 MB in the beginning and 50.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-28 03:21:22,348 INFO L168 Benchmark]: Boogie Preprocessor took 47.03 ms. Allocated memory is still 100.7 MB. Free memory was 50.2 MB in the beginning and 48.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:21:22,349 INFO L168 Benchmark]: RCFGBuilder took 2886.54 ms. Allocated memory was 100.7 MB in the beginning and 153.1 MB in the end (delta: 52.4 MB). Free memory was 48.1 MB in the beginning and 93.4 MB in the end (delta: -45.3 MB). Peak memory consumption was 33.0 MB. Max. memory is 16.1 GB. [2020-11-28 03:21:22,350 INFO L168 Benchmark]: TraceAbstraction took 19950.31 ms. Allocated memory was 153.1 MB in the beginning and 377.5 MB in the end (delta: 224.4 MB). Free memory was 93.4 MB in the beginning and 306.3 MB in the end (delta: -212.9 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:21:22,350 INFO L168 Benchmark]: Witness Printer took 130.45 ms. Allocated memory is still 377.5 MB. Free memory was 306.3 MB in the beginning and 292.7 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-28 03:21:22,353 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.34 ms. Allocated memory is still 100.7 MB. Free memory is still 58.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 647.18 ms. Allocated memory is still 100.7 MB. Free memory was 71.7 MB in the beginning and 53.1 MB in the end (delta: 18.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 57.84 ms. Allocated memory is still 100.7 MB. Free memory was 53.1 MB in the beginning and 50.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 47.03 ms. Allocated memory is still 100.7 MB. Free memory was 50.2 MB in the beginning and 48.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2886.54 ms. Allocated memory was 100.7 MB in the beginning and 153.1 MB in the end (delta: 52.4 MB). Free memory was 48.1 MB in the beginning and 93.4 MB in the end (delta: -45.3 MB). Peak memory consumption was 33.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19950.31 ms. Allocated memory was 153.1 MB in the beginning and 377.5 MB in the end (delta: 224.4 MB). Free memory was 93.4 MB in the beginning and 306.3 MB in the end (delta: -212.9 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. * Witness Printer took 130.45 ms. Allocated memory is still 377.5 MB. Free memory was 306.3 MB in the beginning and 292.7 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1170 VarBasedMoverChecksPositive, 83 VarBasedMoverChecksNegative, 26 SemBasedMoverChecksPositive, 57 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.8s, 103 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.8s, 106 PlacesBefore, 35 PlacesAfterwards, 99 TransitionsBefore, 26 TransitionsAfterwards, 1770 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 4794 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; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2192; [L814] FCALL, FORK 0 pthread_create(&t2192, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2193; [L816] FCALL, FORK 0 pthread_create(&t2193, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2194; [L818] FCALL, FORK 0 pthread_create(&t2194, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] 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) [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 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 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 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 [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] 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) [L791] 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) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 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 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 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 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 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) [L835] 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) [L836] 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)) [L836] 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) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L836] 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) [L836] 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)) [L836] 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)) [L837] 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)) [L837] 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)) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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)) [L840] 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)) [L840] 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) [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] 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) [L840] 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)) [L840] 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)) [L841] 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)) [L841] EXPR 0 !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) [L841] 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)) [L841] 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)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe017_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.6s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.9s, HoareTripleCheckerStatistics: 440 SDtfs, 426 SDslu, 661 SDs, 0 SdLazy, 533 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred 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, 22 MinimizatonAttempts, 205 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 31599 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...