./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix036_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8c9e76c3-ff7f-4c99-bb49-b5a194cad557/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8c9e76c3-ff7f-4c99-bb49-b5a194cad557/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8c9e76c3-ff7f-4c99-bb49-b5a194cad557/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8c9e76c3-ff7f-4c99-bb49-b5a194cad557/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix036_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8c9e76c3-ff7f-4c99-bb49-b5a194cad557/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8c9e76c3-ff7f-4c99-bb49-b5a194cad557/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 806f8a7c2293a867505537aa3a019e6da8e82a90 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-69874e2 [2020-12-01 14:54:58,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 14:54:58,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 14:54:58,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 14:54:58,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 14:54:58,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 14:54:58,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 14:54:58,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 14:54:58,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 14:54:58,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 14:54:58,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 14:54:58,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 14:54:58,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 14:54:58,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 14:54:58,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 14:54:58,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 14:54:58,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 14:54:58,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 14:54:58,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 14:54:58,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 14:54:58,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 14:54:58,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 14:54:58,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 14:54:58,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 14:54:58,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 14:54:58,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 14:54:58,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 14:54:58,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 14:54:58,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 14:54:58,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 14:54:58,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 14:54:58,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 14:54:58,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 14:54:58,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 14:54:58,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 14:54:58,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 14:54:58,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 14:54:58,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 14:54:58,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 14:54:58,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 14:54:58,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 14:54:58,246 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8c9e76c3-ff7f-4c99-bb49-b5a194cad557/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-01 14:54:58,267 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 14:54:58,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 14:54:58,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 14:54:58,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 14:54:58,270 INFO L138 SettingsManager]: * Use SBE=true [2020-12-01 14:54:58,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 14:54:58,270 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 14:54:58,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 14:54:58,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 14:54:58,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 14:54:58,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 14:54:58,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 14:54:58,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 14:54:58,272 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 14:54:58,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 14:54:58,273 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 14:54:58,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 14:54:58,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 14:54:58,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-01 14:54:58,274 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 14:54:58,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-01 14:54:58,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 14:54:58,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 14:54:58,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 14:54:58,275 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 14:54:58,276 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-01 14:54:58,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 14:54:58,276 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 14:54:58,276 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-01 14:54:58,277 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_8c9e76c3-ff7f-4c99-bb49-b5a194cad557/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_8c9e76c3-ff7f-4c99-bb49-b5a194cad557/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 -> 806f8a7c2293a867505537aa3a019e6da8e82a90 [2020-12-01 14:54:58,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 14:54:58,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 14:54:58,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 14:54:58,552 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 14:54:58,557 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 14:54:58,558 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8c9e76c3-ff7f-4c99-bb49-b5a194cad557/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix036_rmo.oepc.i [2020-12-01 14:54:58,634 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c9e76c3-ff7f-4c99-bb49-b5a194cad557/bin/uautomizer/data/f2e2a06ff/85675bac050f4b9185f92d0ddf5488ed/FLAG6f38d3f0d [2020-12-01 14:54:59,211 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 14:54:59,211 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8c9e76c3-ff7f-4c99-bb49-b5a194cad557/sv-benchmarks/c/pthread-wmm/mix036_rmo.oepc.i [2020-12-01 14:54:59,247 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c9e76c3-ff7f-4c99-bb49-b5a194cad557/bin/uautomizer/data/f2e2a06ff/85675bac050f4b9185f92d0ddf5488ed/FLAG6f38d3f0d [2020-12-01 14:54:59,478 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8c9e76c3-ff7f-4c99-bb49-b5a194cad557/bin/uautomizer/data/f2e2a06ff/85675bac050f4b9185f92d0ddf5488ed [2020-12-01 14:54:59,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 14:54:59,482 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 14:54:59,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 14:54:59,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 14:54:59,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 14:54:59,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 02:54:59" (1/1) ... [2020-12-01 14:54:59,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@112a85a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:54:59, skipping insertion in model container [2020-12-01 14:54:59,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 02:54:59" (1/1) ... [2020-12-01 14:54:59,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 14:54:59,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 14:55:00,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 14:55:00,157 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 14:55:00,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 14:55:00,324 INFO L208 MainTranslator]: Completed translation [2020-12-01 14:55:00,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:55:00 WrapperNode [2020-12-01 14:55:00,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 14:55:00,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 14:55:00,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 14:55:00,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 14:55:00,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:55:00" (1/1) ... [2020-12-01 14:55:00,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:55:00" (1/1) ... [2020-12-01 14:55:00,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 14:55:00,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 14:55:00,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 14:55:00,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 14:55:00,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:55:00" (1/1) ... [2020-12-01 14:55:00,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:55:00" (1/1) ... [2020-12-01 14:55:00,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:55:00" (1/1) ... [2020-12-01 14:55:00,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:55:00" (1/1) ... [2020-12-01 14:55:00,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:55:00" (1/1) ... [2020-12-01 14:55:00,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:55:00" (1/1) ... [2020-12-01 14:55:00,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:55:00" (1/1) ... [2020-12-01 14:55:00,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 14:55:00,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 14:55:00,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 14:55:00,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 14:55:00,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:55:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c9e76c3-ff7f-4c99-bb49-b5a194cad557/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-12-01 14:55:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-01 14:55:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-01 14:55:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 14:55:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-01 14:55:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-01 14:55:00,590 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-01 14:55:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-01 14:55:00,590 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-01 14:55:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-01 14:55:00,590 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-01 14:55:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-01 14:55:00,590 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-01 14:55:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 14:55:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-01 14:55:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 14:55:00,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 14:55:00,597 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-01 14:55:03,299 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 14:55:03,299 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-12-01 14:55:03,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:55:03 BoogieIcfgContainer [2020-12-01 14:55:03,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 14:55:03,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-01 14:55:03,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-01 14:55:03,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-01 14:55:03,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 02:54:59" (1/3) ... [2020-12-01 14:55:03,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee045c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 02:55:03, skipping insertion in model container [2020-12-01 14:55:03,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:55:00" (2/3) ... [2020-12-01 14:55:03,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee045c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 02:55:03, skipping insertion in model container [2020-12-01 14:55:03,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:55:03" (3/3) ... [2020-12-01 14:55:03,313 INFO L111 eAbstractionObserver]: Analyzing ICFG mix036_rmo.oepc.i [2020-12-01 14:55:03,332 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-01 14:55:03,332 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-01 14:55:03,336 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-01 14:55:03,337 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-01 14:55:03,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,415 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,415 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,415 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,416 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,417 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,418 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,419 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,422 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,429 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,429 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,430 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,430 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,436 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,436 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,437 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,437 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,447 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,447 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,448 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,449 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,450 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,456 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,456 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,467 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,467 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,467 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,467 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,467 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,468 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,468 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,468 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,468 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,468 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,468 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,483 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,483 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,487 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,488 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,498 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,498 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,498 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,498 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,499 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,499 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,499 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,499 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,515 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,517 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,517 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 14:55:03,519 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-01 14:55:03,529 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-01 14:55:03,557 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-01 14:55:03,557 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-01 14:55:03,557 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-01 14:55:03,557 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-01 14:55:03,557 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-01 14:55:03,558 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-01 14:55:03,558 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-01 14:55:03,558 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-01 14:55:03,574 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-01 14:55:03,576 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 125 transitions, 270 flow [2020-12-01 14:55:03,579 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 125 transitions, 270 flow [2020-12-01 14:55:03,581 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 135 places, 125 transitions, 270 flow [2020-12-01 14:55:03,657 INFO L129 PetriNetUnfolder]: 3/121 cut-off events. [2020-12-01 14:55:03,658 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-01 14:55:03,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 3/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 99 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2020-12-01 14:55:03,673 INFO L116 LiptonReduction]: Number of co-enabled transitions 3124 [2020-12-01 14:55:03,847 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:03,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:03,850 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:03,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:03,860 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:03,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:03,871 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:03,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:03,934 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:03,934 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:03,937 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:03,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:03,943 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:03,943 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:03,948 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:03,948 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:04,234 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:04,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:04,235 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:04,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:04,241 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:04,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:04,245 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:04,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:04,289 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:04,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:04,291 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:04,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:04,294 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:04,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:04,300 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:04,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:04,539 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:04,540 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:04,542 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:04,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:04,547 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:04,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:04,551 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:04,552 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:04,584 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:04,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:04,586 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:04,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:04,589 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:04,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:04,594 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:04,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:04,855 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:04,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-01 14:55:04,862 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:04,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:04,930 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:04,930 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:04,939 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 14:55:04,940 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 14:55:04,942 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 14:55:04,942 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 14:55:04,944 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 14:55:04,944 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 14:55:04,946 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:04,947 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:04,951 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:04,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:04,959 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:04,960 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:05,112 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:05,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:05,113 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:05,113 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:05,116 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:05,117 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:05,121 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:05,122 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:05,144 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:05,144 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:05,145 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:05,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:05,149 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:05,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:05,152 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:05,153 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:05,589 WARN L197 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-01 14:55:06,203 WARN L197 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-01 14:55:06,215 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-12-01 14:55:06,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:06,533 WARN L197 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2020-12-01 14:55:06,621 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-01 14:55:06,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:06,880 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:06,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:06,882 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:06,882 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:06,884 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:06,885 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:06,887 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:06,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:06,909 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:06,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:06,910 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:06,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:06,912 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:06,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:06,918 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:06,919 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:07,265 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-12-01 14:55:07,505 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2020-12-01 14:55:07,537 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,538 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:07,545 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 14:55:07,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 14:55:07,547 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 14:55:07,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 14:55:07,548 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 14:55:07,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 14:55:07,551 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:07,551 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:07,552 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:07,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:07,554 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:07,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:07,609 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:07,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-01 14:55:07,612 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:07,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:07,649 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:07,650 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:07,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:07,654 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:07,674 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:07,675 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:07,677 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:07,680 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:07,739 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:07,740 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:07,742 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,742 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:07,744 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:07,783 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,784 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:07,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:07,787 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:07,789 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:07,869 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:07,870 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:07,872 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:07,874 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,875 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:07,895 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:07,896 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,897 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:07,898 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,899 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:07,901 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,901 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:07,976 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,977 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:07,977 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,977 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:07,979 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:07,981 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,981 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:07,998 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,998 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:07,999 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:07,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:08,001 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:08,004 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:08,149 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:08,151 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:08,154 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:08,156 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:08,172 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,173 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:08,174 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:08,175 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,176 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:08,177 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,178 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:08,284 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:08,285 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-01 14:55:08,287 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:08,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:08,359 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:08,361 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 14:55:08,362 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 14:55:08,363 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 14:55:08,363 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 14:55:08,364 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 14:55:08,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 14:55:08,366 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:08,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:08,368 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:08,368 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:08,369 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:08,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:08,530 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:08,531 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:08,533 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,534 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:08,535 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:08,552 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,552 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:08,553 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:08,555 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:08,557 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:08,703 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:08,704 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:08,706 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:08,712 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:08,729 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,729 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:08,730 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:08,732 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,732 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:08,733 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:08,895 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:08,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:08,900 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 14:55:08,901 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 14:55:08,902 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 14:55:08,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 14:55:08,904 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 14:55:08,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 14:55:08,907 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:08,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:08,909 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:08,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:08,911 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:08,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:08,964 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:08,965 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-01 14:55:08,968 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:08,968 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:09,001 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:09,002 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:09,004 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:09,007 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:09,026 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:09,028 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:09,030 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:09,032 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:09,394 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-12-01 14:55:09,568 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-12-01 14:55:09,777 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-12-01 14:55:09,818 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,818 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:09,819 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,819 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:09,821 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:09,824 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:09,841 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:09,842 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:09,844 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:09,846 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:09,960 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,960 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:09,961 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,961 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:09,963 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,963 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:09,965 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,965 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:09,983 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:09,984 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,984 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:09,986 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:09,988 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:09,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:10,379 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:10,379 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:10,380 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:10,380 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:10,382 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:10,383 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:10,385 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:10,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:10,404 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:10,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:10,405 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:10,405 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:10,407 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:10,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:10,410 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:10,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:10,438 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:10,438 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:10,439 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:10,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:10,441 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:10,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:10,443 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:10,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:10,461 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:10,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:10,462 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:10,463 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:10,465 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:10,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:10,467 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:10,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:10,708 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-01 14:55:10,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:10,709 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:10,710 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:10,710 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-01 14:55:10,710 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:11,017 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-01 14:55:11,017 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:11,082 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-01 14:55:11,083 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:11,135 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-01 14:55:11,136 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:11,137 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:11,137 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:11,137 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-01 14:55:11,138 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:11,221 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-01 14:55:11,221 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:11,336 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-01 14:55:11,337 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:11,503 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-01 14:55:11,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:11,528 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-01 14:55:11,528 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:11,657 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:11,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:11,659 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:11,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:11,663 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:11,663 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:11,665 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:11,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:11,683 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:11,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:11,684 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:11,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:11,686 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:11,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:11,688 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:11,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:11,764 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:11,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:11,765 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:11,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:11,767 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:11,767 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:11,769 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:11,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 14:55:11,788 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:11,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:11,789 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:11,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:11,791 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:11,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:11,793 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:11,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:12,008 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:12,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-01 14:55:12,011 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:12,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:12,057 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:12,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:12,067 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 14:55:12,067 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 14:55:12,069 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 14:55:12,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 14:55:12,070 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 14:55:12,070 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 14:55:12,072 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:12,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:12,074 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:12,074 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:12,076 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:12,076 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:12,152 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 14:55:12,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:12,159 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 14:55:12,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 14:55:12,161 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 14:55:12,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 14:55:12,162 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 14:55:12,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 14:55:12,164 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:12,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:12,166 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:12,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:12,168 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:12,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 14:55:12,213 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:12,213 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-01 14:55:12,215 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 14:55:12,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 14:55:12,967 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2020-12-01 14:55:13,646 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-12-01 14:55:13,757 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-12-01 14:55:14,701 WARN L197 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2020-12-01 14:55:14,911 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-12-01 14:55:15,369 WARN L197 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2020-12-01 14:55:15,606 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-12-01 14:55:15,615 INFO L131 LiptonReduction]: Checked pairs total: 9514 [2020-12-01 14:55:15,615 INFO L133 LiptonReduction]: Total number of compositions: 108 [2020-12-01 14:55:15,622 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 34 transitions, 88 flow [2020-12-01 14:55:16,049 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4874 states. [2020-12-01 14:55:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states. [2020-12-01 14:55:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-01 14:55:16,056 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 14:55:16,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-01 14:55:16,057 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 14:55:16,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 14:55:16,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1259684, now seen corresponding path program 1 times [2020-12-01 14:55:16,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 14:55:16,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255223334] [2020-12-01 14:55:16,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 14:55:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 14:55:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 14:55:16,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255223334] [2020-12-01 14:55:16,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 14:55:16,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-01 14:55:16,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781068447] [2020-12-01 14:55:16,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 14:55:16,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 14:55:16,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 14:55:16,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 14:55:16,400 INFO L87 Difference]: Start difference. First operand 4874 states. Second operand 3 states. [2020-12-01 14:55:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 14:55:16,603 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2020-12-01 14:55:16,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 14:55:16,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-01 14:55:16,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 14:55:16,670 INFO L225 Difference]: With dead ends: 4062 [2020-12-01 14:55:16,670 INFO L226 Difference]: Without dead ends: 3312 [2020-12-01 14:55:16,671 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-12-01 14:55:16,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2020-12-01 14:55:16,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2020-12-01 14:55:16,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2020-12-01 14:55:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 12950 transitions. [2020-12-01 14:55:17,000 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 12950 transitions. Word has length 3 [2020-12-01 14:55:17,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 14:55:17,000 INFO L481 AbstractCegarLoop]: Abstraction has 3312 states and 12950 transitions. [2020-12-01 14:55:17,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 14:55:17,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 12950 transitions. [2020-12-01 14:55:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-01 14:55:17,006 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 14:55:17,006 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 14:55:17,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-01 14:55:17,007 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 14:55:17,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 14:55:17,010 INFO L82 PathProgramCache]: Analyzing trace with hash -589076692, now seen corresponding path program 1 times [2020-12-01 14:55:17,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 14:55:17,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032191897] [2020-12-01 14:55:17,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 14:55:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 14:55:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 14:55:17,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032191897] [2020-12-01 14:55:17,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 14:55:17,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-01 14:55:17,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443484908] [2020-12-01 14:55:17,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 14:55:17,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 14:55:17,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 14:55:17,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 14:55:17,146 INFO L87 Difference]: Start difference. First operand 3312 states and 12950 transitions. Second operand 3 states. [2020-12-01 14:55:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 14:55:17,191 INFO L93 Difference]: Finished difference Result 3062 states and 11850 transitions. [2020-12-01 14:55:17,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 14:55:17,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-01 14:55:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 14:55:17,221 INFO L225 Difference]: With dead ends: 3062 [2020-12-01 14:55:17,221 INFO L226 Difference]: Without dead ends: 3062 [2020-12-01 14:55:17,222 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-12-01 14:55:17,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2020-12-01 14:55:17,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3062. [2020-12-01 14:55:17,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3062 states. [2020-12-01 14:55:17,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 11850 transitions. [2020-12-01 14:55:17,366 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 11850 transitions. Word has length 11 [2020-12-01 14:55:17,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 14:55:17,367 INFO L481 AbstractCegarLoop]: Abstraction has 3062 states and 11850 transitions. [2020-12-01 14:55:17,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 14:55:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 11850 transitions. [2020-12-01 14:55:17,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-01 14:55:17,376 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 14:55:17,376 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 14:55:17,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-01 14:55:17,376 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 14:55:17,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 14:55:17,381 INFO L82 PathProgramCache]: Analyzing trace with hash 832965750, now seen corresponding path program 1 times [2020-12-01 14:55:17,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 14:55:17,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672600799] [2020-12-01 14:55:17,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 14:55:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 14:55:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 14:55:17,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672600799] [2020-12-01 14:55:17,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 14:55:17,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 14:55:17,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022736665] [2020-12-01 14:55:17,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 14:55:17,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 14:55:17,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 14:55:17,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 14:55:17,490 INFO L87 Difference]: Start difference. First operand 3062 states and 11850 transitions. Second operand 4 states. [2020-12-01 14:55:17,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 14:55:17,576 INFO L93 Difference]: Finished difference Result 2980 states and 10435 transitions. [2020-12-01 14:55:17,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 14:55:17,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-01 14:55:17,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 14:55:17,597 INFO L225 Difference]: With dead ends: 2980 [2020-12-01 14:55:17,597 INFO L226 Difference]: Without dead ends: 2230 [2020-12-01 14:55:17,598 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-12-01 14:55:17,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2020-12-01 14:55:17,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2230. [2020-12-01 14:55:17,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2230 states. [2020-12-01 14:55:17,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 7690 transitions. [2020-12-01 14:55:17,693 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 7690 transitions. Word has length 13 [2020-12-01 14:55:17,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 14:55:17,694 INFO L481 AbstractCegarLoop]: Abstraction has 2230 states and 7690 transitions. [2020-12-01 14:55:17,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 14:55:17,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 7690 transitions. [2020-12-01 14:55:17,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-01 14:55:17,698 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 14:55:17,698 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 14:55:17,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-01 14:55:17,698 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 14:55:17,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 14:55:17,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1235358432, now seen corresponding path program 1 times [2020-12-01 14:55:17,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 14:55:17,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250817267] [2020-12-01 14:55:17,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 14:55:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 14:55:17,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 14:55:17,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250817267] [2020-12-01 14:55:17,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 14:55:17,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 14:55:17,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990703931] [2020-12-01 14:55:17,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 14:55:17,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 14:55:17,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 14:55:17,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-01 14:55:17,912 INFO L87 Difference]: Start difference. First operand 2230 states and 7690 transitions. Second operand 5 states. [2020-12-01 14:55:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 14:55:18,001 INFO L93 Difference]: Finished difference Result 1844 states and 5875 transitions. [2020-12-01 14:55:18,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 14:55:18,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-01 14:55:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 14:55:18,014 INFO L225 Difference]: With dead ends: 1844 [2020-12-01 14:55:18,014 INFO L226 Difference]: Without dead ends: 1414 [2020-12-01 14:55:18,015 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-12-01 14:55:18,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-12-01 14:55:18,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2020-12-01 14:55:18,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2020-12-01 14:55:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 4426 transitions. [2020-12-01 14:55:18,123 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 4426 transitions. Word has length 16 [2020-12-01 14:55:18,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 14:55:18,123 INFO L481 AbstractCegarLoop]: Abstraction has 1414 states and 4426 transitions. [2020-12-01 14:55:18,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 14:55:18,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 4426 transitions. [2020-12-01 14:55:18,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 14:55:18,126 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 14:55:18,126 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-12-01 14:55:18,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-01 14:55:18,127 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 14:55:18,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 14:55:18,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1086760200, now seen corresponding path program 1 times [2020-12-01 14:55:18,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 14:55:18,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102806594] [2020-12-01 14:55:18,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 14:55:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 14:55:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 14:55:18,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102806594] [2020-12-01 14:55:18,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 14:55:18,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 14:55:18,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506041241] [2020-12-01 14:55:18,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 14:55:18,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 14:55:18,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 14:55:18,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 14:55:18,324 INFO L87 Difference]: Start difference. First operand 1414 states and 4426 transitions. Second operand 5 states. [2020-12-01 14:55:18,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 14:55:18,526 INFO L93 Difference]: Finished difference Result 2574 states and 7873 transitions. [2020-12-01 14:55:18,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 14:55:18,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-12-01 14:55:18,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 14:55:18,545 INFO L225 Difference]: With dead ends: 2574 [2020-12-01 14:55:18,545 INFO L226 Difference]: Without dead ends: 2272 [2020-12-01 14:55:18,546 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-01 14:55:18,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2020-12-01 14:55:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1798. [2020-12-01 14:55:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1798 states. [2020-12-01 14:55:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 5566 transitions. [2020-12-01 14:55:18,617 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 5566 transitions. Word has length 20 [2020-12-01 14:55:18,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 14:55:18,618 INFO L481 AbstractCegarLoop]: Abstraction has 1798 states and 5566 transitions. [2020-12-01 14:55:18,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 14:55:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 5566 transitions. [2020-12-01 14:55:18,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 14:55:18,622 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 14:55:18,623 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-12-01 14:55:18,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-01 14:55:18,623 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 14:55:18,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 14:55:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1205178058, now seen corresponding path program 2 times [2020-12-01 14:55:18,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 14:55:18,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400583634] [2020-12-01 14:55:18,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 14:55:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 14:55:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 14:55:18,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400583634] [2020-12-01 14:55:18,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 14:55:18,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 14:55:18,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431564387] [2020-12-01 14:55:18,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 14:55:18,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 14:55:18,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 14:55:18,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-01 14:55:18,789 INFO L87 Difference]: Start difference. First operand 1798 states and 5566 transitions. Second operand 6 states. [2020-12-01 14:55:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 14:55:18,871 INFO L93 Difference]: Finished difference Result 1615 states and 4953 transitions. [2020-12-01 14:55:18,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 14:55:18,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-12-01 14:55:18,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 14:55:18,893 INFO L225 Difference]: With dead ends: 1615 [2020-12-01 14:55:18,898 INFO L226 Difference]: Without dead ends: 1453 [2020-12-01 14:55:18,899 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-12-01 14:55:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-12-01 14:55:18,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2020-12-01 14:55:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1453 states. [2020-12-01 14:55:18,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 4520 transitions. [2020-12-01 14:55:18,942 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 4520 transitions. Word has length 20 [2020-12-01 14:55:18,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 14:55:18,942 INFO L481 AbstractCegarLoop]: Abstraction has 1453 states and 4520 transitions. [2020-12-01 14:55:18,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 14:55:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 4520 transitions. [2020-12-01 14:55:18,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 14:55:18,950 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 14:55:18,950 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 14:55:18,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-01 14:55:18,950 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 14:55:18,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 14:55:18,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1317131721, now seen corresponding path program 1 times [2020-12-01 14:55:18,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 14:55:18,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600790303] [2020-12-01 14:55:18,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 14:55:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 14:55:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 14:55:19,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600790303] [2020-12-01 14:55:19,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 14:55:19,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 14:55:19,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714692804] [2020-12-01 14:55:19,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 14:55:19,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 14:55:19,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 14:55:19,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-01 14:55:19,207 INFO L87 Difference]: Start difference. First operand 1453 states and 4520 transitions. Second operand 7 states. [2020-12-01 14:55:19,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 14:55:19,451 INFO L93 Difference]: Finished difference Result 1945 states and 5910 transitions. [2020-12-01 14:55:19,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 14:55:19,452 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-01 14:55:19,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 14:55:19,462 INFO L225 Difference]: With dead ends: 1945 [2020-12-01 14:55:19,462 INFO L226 Difference]: Without dead ends: 1858 [2020-12-01 14:55:19,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-01 14:55:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2020-12-01 14:55:19,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1317. [2020-12-01 14:55:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2020-12-01 14:55:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 4094 transitions. [2020-12-01 14:55:19,523 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 4094 transitions. Word has length 24 [2020-12-01 14:55:19,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 14:55:19,523 INFO L481 AbstractCegarLoop]: Abstraction has 1317 states and 4094 transitions. [2020-12-01 14:55:19,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 14:55:19,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 4094 transitions. [2020-12-01 14:55:19,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 14:55:19,528 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 14:55:19,528 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 14:55:19,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-01 14:55:19,528 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 14:55:19,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 14:55:19,529 INFO L82 PathProgramCache]: Analyzing trace with hash -318130224, now seen corresponding path program 1 times [2020-12-01 14:55:19,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 14:55:19,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775968941] [2020-12-01 14:55:19,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 14:55:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 14:55:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 14:55:19,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775968941] [2020-12-01 14:55:19,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 14:55:19,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-01 14:55:19,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200897633] [2020-12-01 14:55:19,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-01 14:55:19,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 14:55:19,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-01 14:55:19,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-12-01 14:55:19,752 INFO L87 Difference]: Start difference. First operand 1317 states and 4094 transitions. Second operand 11 states. [2020-12-01 14:55:20,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 14:55:20,390 INFO L93 Difference]: Finished difference Result 1643 states and 5101 transitions. [2020-12-01 14:55:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-01 14:55:20,391 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-01 14:55:20,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 14:55:20,397 INFO L225 Difference]: With dead ends: 1643 [2020-12-01 14:55:20,397 INFO L226 Difference]: Without dead ends: 1556 [2020-12-01 14:55:20,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2020-12-01 14:55:20,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2020-12-01 14:55:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1447. [2020-12-01 14:55:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2020-12-01 14:55:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 4518 transitions. [2020-12-01 14:55:20,442 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 4518 transitions. Word has length 24 [2020-12-01 14:55:20,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 14:55:20,444 INFO L481 AbstractCegarLoop]: Abstraction has 1447 states and 4518 transitions. [2020-12-01 14:55:20,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-01 14:55:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 4518 transitions. [2020-12-01 14:55:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 14:55:20,449 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 14:55:20,449 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 14:55:20,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-01 14:55:20,450 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 14:55:20,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 14:55:20,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1728529086, now seen corresponding path program 2 times [2020-12-01 14:55:20,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 14:55:20,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879804427] [2020-12-01 14:55:20,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 14:55:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 14:55:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 14:55:20,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879804427] [2020-12-01 14:55:20,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 14:55:20,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-01 14:55:20,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77084619] [2020-12-01 14:55:20,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-01 14:55:20,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 14:55:20,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-01 14:55:20,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-12-01 14:55:20,708 INFO L87 Difference]: Start difference. First operand 1447 states and 4518 transitions. Second operand 11 states. [2020-12-01 14:55:21,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 14:55:21,206 INFO L93 Difference]: Finished difference Result 1716 states and 5174 transitions. [2020-12-01 14:55:21,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-01 14:55:21,206 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-01 14:55:21,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 14:55:21,211 INFO L225 Difference]: With dead ends: 1716 [2020-12-01 14:55:21,212 INFO L226 Difference]: Without dead ends: 1675 [2020-12-01 14:55:21,212 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-12-01 14:55:21,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2020-12-01 14:55:21,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1477. [2020-12-01 14:55:21,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1477 states. [2020-12-01 14:55:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 4572 transitions. [2020-12-01 14:55:21,266 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 4572 transitions. Word has length 24 [2020-12-01 14:55:21,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 14:55:21,266 INFO L481 AbstractCegarLoop]: Abstraction has 1477 states and 4572 transitions. [2020-12-01 14:55:21,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-01 14:55:21,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 4572 transitions. [2020-12-01 14:55:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 14:55:21,272 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 14:55:21,272 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 14:55:21,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-01 14:55:21,272 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 14:55:21,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 14:55:21,273 INFO L82 PathProgramCache]: Analyzing trace with hash 238622153, now seen corresponding path program 2 times [2020-12-01 14:55:21,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 14:55:21,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491311652] [2020-12-01 14:55:21,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 14:55:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 14:55:21,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 14:55:21,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491311652] [2020-12-01 14:55:21,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 14:55:21,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 14:55:21,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935959073] [2020-12-01 14:55:21,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 14:55:21,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 14:55:21,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 14:55:21,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-01 14:55:21,384 INFO L87 Difference]: Start difference. First operand 1477 states and 4572 transitions. Second operand 7 states. [2020-12-01 14:55:21,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 14:55:21,476 INFO L93 Difference]: Finished difference Result 1446 states and 4505 transitions. [2020-12-01 14:55:21,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 14:55:21,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-01 14:55:21,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 14:55:21,482 INFO L225 Difference]: With dead ends: 1446 [2020-12-01 14:55:21,482 INFO L226 Difference]: Without dead ends: 1325 [2020-12-01 14:55:21,482 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-01 14:55:21,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2020-12-01 14:55:21,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2020-12-01 14:55:21,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2020-12-01 14:55:21,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 4156 transitions. [2020-12-01 14:55:21,525 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 4156 transitions. Word has length 24 [2020-12-01 14:55:21,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 14:55:21,526 INFO L481 AbstractCegarLoop]: Abstraction has 1325 states and 4156 transitions. [2020-12-01 14:55:21,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 14:55:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 4156 transitions. [2020-12-01 14:55:21,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-01 14:55:21,531 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 14:55:21,531 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 14:55:21,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-01 14:55:21,531 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 14:55:21,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 14:55:21,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2050568305, now seen corresponding path program 1 times [2020-12-01 14:55:21,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 14:55:21,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554673866] [2020-12-01 14:55:21,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 14:55:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 14:55:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 14:55:21,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554673866] [2020-12-01 14:55:21,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 14:55:21,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 14:55:21,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599789140] [2020-12-01 14:55:21,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 14:55:21,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 14:55:21,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 14:55:21,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-01 14:55:21,794 INFO L87 Difference]: Start difference. First operand 1325 states and 4156 transitions. Second operand 8 states. [2020-12-01 14:55:21,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 14:55:21,989 INFO L93 Difference]: Finished difference Result 1369 states and 4249 transitions. [2020-12-01 14:55:21,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 14:55:21,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-12-01 14:55:21,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 14:55:21,991 INFO L225 Difference]: With dead ends: 1369 [2020-12-01 14:55:21,991 INFO L226 Difference]: Without dead ends: 935 [2020-12-01 14:55:21,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-12-01 14:55:21,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2020-12-01 14:55:22,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 791. [2020-12-01 14:55:22,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-12-01 14:55:22,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 2464 transitions. [2020-12-01 14:55:22,016 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 2464 transitions. Word has length 28 [2020-12-01 14:55:22,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 14:55:22,016 INFO L481 AbstractCegarLoop]: Abstraction has 791 states and 2464 transitions. [2020-12-01 14:55:22,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 14:55:22,017 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 2464 transitions. [2020-12-01 14:55:22,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-01 14:55:22,019 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 14:55:22,019 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 14:55:22,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-01 14:55:22,020 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 14:55:22,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 14:55:22,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1081358095, now seen corresponding path program 2 times [2020-12-01 14:55:22,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 14:55:22,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070230844] [2020-12-01 14:55:22,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 14:55:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 14:55:22,114 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 14:55:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 14:55:22,234 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 14:55:22,275 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 14:55:22,275 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-01 14:55:22,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-01 14:55:22,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 02:55:22 BasicIcfg [2020-12-01 14:55:22,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-01 14:55:22,413 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 14:55:22,413 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 14:55:22,413 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 14:55:22,414 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:55:03" (3/4) ... [2020-12-01 14:55:22,416 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 14:55:22,622 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8c9e76c3-ff7f-4c99-bb49-b5a194cad557/bin/uautomizer/witness.graphml [2020-12-01 14:55:22,622 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 14:55:22,623 INFO L168 Benchmark]: Toolchain (without parser) took 23140.72 ms. Allocated memory was 96.5 MB in the beginning and 465.6 MB in the end (delta: 369.1 MB). Free memory was 62.0 MB in the beginning and 376.4 MB in the end (delta: -314.4 MB). Peak memory consumption was 287.4 MB. Max. memory is 16.1 GB. [2020-12-01 14:55:22,624 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 71.3 MB. Free memory was 46.0 MB in the beginning and 46.0 MB in the end (delta: 29.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 14:55:22,624 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.21 ms. Allocated memory is still 96.5 MB. Free memory was 61.8 MB in the beginning and 48.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-01 14:55:22,625 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.84 ms. Allocated memory is still 96.5 MB. Free memory was 48.7 MB in the beginning and 46.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 14:55:22,625 INFO L168 Benchmark]: Boogie Preprocessor took 72.62 ms. Allocated memory is still 96.5 MB. Free memory was 46.2 MB in the beginning and 43.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 14:55:22,625 INFO L168 Benchmark]: RCFGBuilder took 2816.82 ms. Allocated memory was 96.5 MB in the beginning and 123.7 MB in the end (delta: 27.3 MB). Free memory was 43.8 MB in the beginning and 38.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 45.2 MB. Max. memory is 16.1 GB. [2020-12-01 14:55:22,626 INFO L168 Benchmark]: TraceAbstraction took 19106.77 ms. Allocated memory was 123.7 MB in the beginning and 465.6 MB in the end (delta: 341.8 MB). Free memory was 38.9 MB in the beginning and 148.2 MB in the end (delta: -109.3 MB). Peak memory consumption was 232.5 MB. Max. memory is 16.1 GB. [2020-12-01 14:55:22,626 INFO L168 Benchmark]: Witness Printer took 209.58 ms. Allocated memory is still 465.6 MB. Free memory was 148.2 MB in the beginning and 376.4 MB in the end (delta: -228.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-01 14:55:22,629 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.26 ms. Allocated memory is still 71.3 MB. Free memory was 46.0 MB in the beginning and 46.0 MB in the end (delta: 29.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 833.21 ms. Allocated memory is still 96.5 MB. Free memory was 61.8 MB in the beginning and 48.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 86.84 ms. Allocated memory is still 96.5 MB. Free memory was 48.7 MB in the beginning and 46.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 72.62 ms. Allocated memory is still 96.5 MB. Free memory was 46.2 MB in the beginning and 43.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2816.82 ms. Allocated memory was 96.5 MB in the beginning and 123.7 MB in the end (delta: 27.3 MB). Free memory was 43.8 MB in the beginning and 38.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 45.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19106.77 ms. Allocated memory was 123.7 MB in the beginning and 465.6 MB in the end (delta: 341.8 MB). Free memory was 38.9 MB in the beginning and 148.2 MB in the end (delta: -109.3 MB). Peak memory consumption was 232.5 MB. Max. memory is 16.1 GB. * Witness Printer took 209.58 ms. Allocated memory is still 465.6 MB. Free memory was 148.2 MB in the beginning and 376.4 MB in the end (delta: -228.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2079 VarBasedMoverChecksPositive, 83 VarBasedMoverChecksNegative, 5 SemBasedMoverChecksPositive, 78 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.3s, 190 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.0s, 135 PlacesBefore, 47 PlacesAfterwards, 125 TransitionsBefore, 34 TransitionsAfterwards, 3124 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 108 TotalNumberOfCompositions, 9514 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool b$flush_delayed; [L726] 0 int b$mem_tmp; [L727] 0 _Bool b$r_buff0_thd0; [L728] 0 _Bool b$r_buff0_thd1; [L729] 0 _Bool b$r_buff0_thd2; [L730] 0 _Bool b$r_buff0_thd3; [L731] 0 _Bool b$r_buff0_thd4; [L732] 0 _Bool b$r_buff1_thd0; [L733] 0 _Bool b$r_buff1_thd1; [L734] 0 _Bool b$r_buff1_thd2; [L735] 0 _Bool b$r_buff1_thd3; [L736] 0 _Bool b$r_buff1_thd4; [L737] 0 _Bool b$read_delayed; [L738] 0 int *b$read_delayed_var; [L739] 0 int b$w_buff0; [L740] 0 _Bool b$w_buff0_used; [L741] 0 int b$w_buff1; [L742] 0 _Bool b$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t953; [L874] FCALL, FORK 0 pthread_create(&t953, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 b$w_buff1 = b$w_buff0 [L757] 1 b$w_buff0 = 1 [L758] 1 b$w_buff1_used = b$w_buff0_used [L759] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L766] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t954; [L876] FCALL, FORK 0 pthread_create(&t954, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t955; [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L792] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L878] FCALL, FORK 0 pthread_create(&t955, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L812] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L812] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L813] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L814] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L814] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L815] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L816] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L816] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L879] 0 pthread_t t956; [L880] FCALL, FORK 0 pthread_create(&t956, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L826] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L829] 4 a = 1 [L832] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 b$flush_delayed = weak$$choice2 [L838] 4 b$mem_tmp = b [L839] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L839] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L840] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L840] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0) [L840] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L840] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L841] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L841] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1) [L841] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L841] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L842] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L842] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used) [L842] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L842] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L843] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L844] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4) [L844] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L844] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L845] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L845] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = b [L847] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L847] 4 b = b$flush_delayed ? b$mem_tmp : b [L848] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L851] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L851] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L852] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L853] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L853] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L854] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L855] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L855] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L772] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L773] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L774] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L774] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L775] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L776] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L776] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L886] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L886] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L887] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L888] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L888] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L889] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L890] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L890] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix036_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 123 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.7s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.4s, HoareTripleCheckerStatistics: 487 SDtfs, 661 SDslu, 1538 SDs, 0 SdLazy, 1021 SolverSat, 155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4874occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1466 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 38880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...