./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe004_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 96f16385 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe004_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 ebfe1c45ab0296eb95acdc44adc6accef8785e22 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-96f1638 [2020-12-02 12:05:30,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 12:05:30,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 12:05:30,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 12:05:30,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 12:05:30,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 12:05:30,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 12:05:30,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 12:05:30,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 12:05:30,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 12:05:30,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 12:05:30,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 12:05:30,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 12:05:30,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 12:05:30,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 12:05:30,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 12:05:30,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 12:05:30,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 12:05:30,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 12:05:30,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 12:05:30,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 12:05:30,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 12:05:30,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 12:05:30,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 12:05:30,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 12:05:30,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 12:05:30,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 12:05:30,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 12:05:30,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 12:05:30,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 12:05:30,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 12:05:30,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 12:05:30,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 12:05:30,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 12:05:30,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 12:05:30,408 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 12:05:30,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 12:05:30,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 12:05:30,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 12:05:30,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 12:05:30,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 12:05:30,423 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 12:05:30,475 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 12:05:30,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 12:05:30,478 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 12:05:30,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 12:05:30,479 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 12:05:30,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 12:05:30,480 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 12:05:30,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 12:05:30,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 12:05:30,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 12:05:30,482 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 12:05:30,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 12:05:30,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 12:05:30,483 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 12:05:30,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 12:05:30,484 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 12:05:30,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 12:05:30,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 12:05:30,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 12:05:30,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 12:05:30,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 12:05:30,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 12:05:30,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 12:05:30,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 12:05:30,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 12:05:30,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 12:05:30,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 12:05:30,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 12:05:30,488 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 12:05:30,488 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> ebfe1c45ab0296eb95acdc44adc6accef8785e22 [2020-12-02 12:05:30,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 12:05:30,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 12:05:30,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 12:05:30,897 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 12:05:30,900 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 12:05:30,901 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe004_power.oepc.i [2020-12-02 12:05:30,985 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/922d818e5/3c20432c6b2846bd993a5ab108bd4f7d/FLAGc1e450e43 [2020-12-02 12:05:31,700 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 12:05:31,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc.i [2020-12-02 12:05:31,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/922d818e5/3c20432c6b2846bd993a5ab108bd4f7d/FLAGc1e450e43 [2020-12-02 12:05:31,988 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/922d818e5/3c20432c6b2846bd993a5ab108bd4f7d [2020-12-02 12:05:31,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 12:05:31,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 12:05:31,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 12:05:31,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 12:05:31,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 12:05:31,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:05:31" (1/1) ... [2020-12-02 12:05:32,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd048c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:05:32, skipping insertion in model container [2020-12-02 12:05:32,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:05:31" (1/1) ... [2020-12-02 12:05:32,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 12:05:32,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 12:05:32,304 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc.i[952,965] [2020-12-02 12:05:32,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 12:05:32,632 INFO L203 MainTranslator]: Completed pre-run [2020-12-02 12:05:32,647 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc.i[952,965] [2020-12-02 12:05:32,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 12:05:32,863 INFO L208 MainTranslator]: Completed translation [2020-12-02 12:05:32,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:05:32 WrapperNode [2020-12-02 12:05:32,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 12:05:32,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 12:05:32,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 12:05:32,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 12:05:32,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:05:32" (1/1) ... [2020-12-02 12:05:32,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:05:32" (1/1) ... [2020-12-02 12:05:32,939 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 12:05:32,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 12:05:32,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 12:05:32,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 12:05:32,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:05:32" (1/1) ... [2020-12-02 12:05:32,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:05:32" (1/1) ... [2020-12-02 12:05:32,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:05:32" (1/1) ... [2020-12-02 12:05:32,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:05:32" (1/1) ... [2020-12-02 12:05:33,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:05:32" (1/1) ... [2020-12-02 12:05:33,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:05:32" (1/1) ... [2020-12-02 12:05:33,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:05:32" (1/1) ... [2020-12-02 12:05:33,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 12:05:33,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 12:05:33,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 12:05:33,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 12:05:33,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:05:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-02 12:05:33,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-02 12:05:33,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-02 12:05:33,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 12:05:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 12:05:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-02 12:05:33,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-02 12:05:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-02 12:05:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-02 12:05:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-02 12:05:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-02 12:05:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 12:05:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-02 12:05:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 12:05:33,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 12:05:33,173 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-02 12:05:36,442 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 12:05:36,443 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-02 12:05:36,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:05:36 BoogieIcfgContainer [2020-12-02 12:05:36,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 12:05:36,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 12:05:36,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 12:05:36,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 12:05:36,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:05:31" (1/3) ... [2020-12-02 12:05:36,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62bff439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:05:36, skipping insertion in model container [2020-12-02 12:05:36,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:05:32" (2/3) ... [2020-12-02 12:05:36,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62bff439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:05:36, skipping insertion in model container [2020-12-02 12:05:36,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:05:36" (3/3) ... [2020-12-02 12:05:36,455 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc.i [2020-12-02 12:05:36,471 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-02 12:05:36,471 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 12:05:36,476 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-02 12:05:36,477 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-02 12:05:36,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,528 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,529 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,529 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,529 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,530 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,531 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,531 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,532 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,539 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,539 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,539 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,540 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,544 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,544 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,545 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,545 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,581 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,581 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,581 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,581 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,581 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,581 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,581 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,581 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,582 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,582 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,582 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,582 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,582 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,582 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,582 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,582 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,582 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,583 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,583 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,583 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,583 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,583 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,583 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,583 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,583 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,584 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,584 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,584 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,584 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,584 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,606 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,607 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,607 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,609 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,610 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,617 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,619 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:05:36,621 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-02 12:05:36,636 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-02 12:05:36,673 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 12:05:36,674 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 12:05:36,674 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 12:05:36,674 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 12:05:36,674 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 12:05:36,674 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 12:05:36,674 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 12:05:36,674 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 12:05:36,690 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-02 12:05:36,694 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 209 flow [2020-12-02 12:05:36,697 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 209 flow [2020-12-02 12:05:36,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2020-12-02 12:05:36,765 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2020-12-02 12:05:36,766 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-02 12:05:36,771 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-12-02 12:05:36,775 INFO L116 LiptonReduction]: Number of co-enabled transitions 1694 [2020-12-02 12:05:37,060 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:37,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:37,064 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:37,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:37,069 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:37,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:37,075 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:37,076 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:37,118 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:37,119 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:37,123 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:37,123 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:37,129 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:37,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:37,135 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:37,136 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:37,457 WARN L197 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-02 12:05:38,089 WARN L197 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2020-12-02 12:05:38,276 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-12-02 12:05:38,312 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-02 12:05:38,313 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:38,511 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:38,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:38,516 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:05:38,517 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:38,518 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:05:38,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:38,520 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:05:38,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:38,527 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-02 12:05:38,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:38,530 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-02 12:05:38,530 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:38,533 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-02 12:05:38,534 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:38,615 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:38,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:05:38,623 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:38,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:38,658 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:38,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:38,659 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:38,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:38,662 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:38,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:38,665 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:38,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:38,695 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:38,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:38,697 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:38,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:38,700 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:38,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:38,702 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:38,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:38,887 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:38,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:38,889 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:05:38,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:38,892 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:05:38,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:38,893 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:05:38,894 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:38,895 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-02 12:05:38,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:38,898 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-02 12:05:38,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:38,899 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-02 12:05:38,899 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:38,978 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:38,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:05:38,982 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:38,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:39,059 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:39,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:05:39,063 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:39,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:39,125 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:39,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:39,127 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:05:39,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:39,130 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:05:39,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:39,131 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:05:39,132 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:39,133 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-02 12:05:39,134 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:39,136 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-02 12:05:39,136 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:39,138 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-02 12:05:39,138 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:39,296 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-02 12:05:39,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:39,298 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:39,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:39,299 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-02 12:05:39,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:39,302 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:05:39,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:39,303 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:05:39,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:39,345 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:05:39,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:39,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:05:39,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:40,464 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-12-02 12:05:40,926 WARN L197 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-12-02 12:05:42,915 WARN L197 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2020-12-02 12:05:43,812 WARN L197 SmtUtils]: Spent 891.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2020-12-02 12:05:43,878 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:43,879 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:43,879 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:43,879 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:43,881 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:43,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:43,883 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:43,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:43,904 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:43,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:43,905 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:43,905 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:43,907 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:43,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:43,909 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:43,909 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:44,940 WARN L197 SmtUtils]: Spent 998.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 175 [2020-12-02 12:05:45,409 WARN L197 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2020-12-02 12:05:47,465 WARN L197 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 299 DAG size of output: 255 [2020-12-02 12:05:48,381 WARN L197 SmtUtils]: Spent 912.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2020-12-02 12:05:48,744 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:48,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:48,745 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:48,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:48,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:48,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:48,750 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:48,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:48,770 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:48,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:48,770 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:48,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:48,773 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:48,773 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:48,775 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:48,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:48,871 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:48,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:48,877 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:05:48,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:48,879 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:05:48,879 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:48,881 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:48,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:48,882 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:48,882 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:48,883 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:48,883 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:48,921 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:48,922 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:05:48,924 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:48,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:48,976 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:48,977 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:05:48,979 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:48,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,020 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:49,021 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:49,029 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:05:49,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:49,031 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:05:49,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:49,032 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:05:49,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:49,034 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-02 12:05:49,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,036 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-02 12:05:49,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,038 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-02 12:05:49,038 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,092 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:49,092 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:49,093 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:49,093 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:49,094 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:49,095 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:49,096 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:49,097 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:49,116 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:49,117 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:49,117 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:49,117 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:49,119 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:49,119 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:49,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-02 12:05:49,121 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:49,196 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-02 12:05:49,199 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,199 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:49,257 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:49,257 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:49,261 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:05:49,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,262 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:05:49,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,266 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:49,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,273 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:49,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,275 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:49,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,391 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,393 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,400 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,401 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,402 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,404 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,405 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,406 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,407 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:05:49,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,408 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:05:49,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,410 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,412 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-12-02 12:05:49,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:49,415 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-12-02 12:05:49,415 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:49,417 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 6, 3, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-12-02 12:05:49,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:49,418 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 3, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-12-02 12:05:49,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:49,420 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 6, 3, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-12-02 12:05:49,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:49,501 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,501 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,504 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:05:49,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,505 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 5, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,507 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 5, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,508 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 5, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,511 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 4, 3, 5, 3, 5, 3, 5, 3, 5, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:49,512 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 4, 3, 5, 3, 5, 3, 5, 3, 5, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:49,515 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 3, 4, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:49,518 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 3, 4, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:49,520 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 3, 4, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 4, 3, 2, 1] term [2020-12-02 12:05:49,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:49,524 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:05:49,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,525 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:05:49,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,673 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:05:49,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:49,674 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:05:49,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:49,703 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:05:49,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:49,704 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:05:49,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:50,038 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:50,039 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:50,040 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:05:50,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:50,042 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:05:50,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:50,043 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:05:50,044 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:50,045 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-02 12:05:50,046 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:50,047 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-02 12:05:50,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:50,048 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-02 12:05:50,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:50,100 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:50,101 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:05:50,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:50,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:50,134 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:50,135 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:50,135 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:50,136 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:50,137 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:50,137 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:50,139 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:50,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:50,159 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:50,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:50,160 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:50,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:50,162 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:50,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:50,164 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:50,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:50,492 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-02 12:05:50,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:50,523 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:05:50,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:50,525 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:05:50,526 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:50,552 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:05:50,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:50,553 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:05:50,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:50,647 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:50,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:50,648 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:50,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:50,650 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:50,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:50,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:50,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:50,678 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:50,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:50,679 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:50,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:50,681 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:50,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:50,683 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:50,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:51,221 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:51,222 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:51,223 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:51,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:51,224 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:51,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:51,226 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:51,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:51,247 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:51,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:51,249 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:51,249 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:51,250 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:51,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:51,252 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:51,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:51,386 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-02 12:05:51,491 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-02 12:05:51,725 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-12-02 12:05:51,954 WARN L197 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-12-02 12:05:52,074 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,075 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,076 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:05:52,076 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:52,077 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,077 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:52,078 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:52,080 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:52,080 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,081 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:52,124 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:52,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-02 12:05:52,126 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:52,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,178 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:52,179 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-02 12:05:52,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:52,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,233 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,235 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:05:52,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:52,237 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:05:52,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:52,239 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:05:52,239 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:52,240 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-02 12:05:52,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:52,242 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-02 12:05:52,242 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:52,243 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-02 12:05:52,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:52,522 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,523 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,524 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,526 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,526 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:52,528 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,528 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:52,548 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,549 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,551 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,551 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:52,553 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:52,601 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,602 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,603 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:52,605 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:52,622 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,623 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,625 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,625 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:52,626 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:52,658 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,659 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,660 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:52,662 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:52,680 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,681 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,683 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:52,685 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:52,960 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,961 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,961 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,961 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,963 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,963 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:52,965 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,965 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:52,981 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,982 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:52,984 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,984 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:52,985 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:52,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:53,012 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:53,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:53,013 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:53,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:53,017 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:53,018 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:53,022 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:53,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:53,040 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:53,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:53,041 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:53,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:53,047 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:53,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:53,048 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:53,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:53,155 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:53,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:53,157 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:05:53,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:53,158 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:05:53,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:53,159 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:05:53,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:05:53,161 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-02 12:05:53,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:53,162 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-02 12:05:53,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:53,163 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-02 12:05:53,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:53,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:53,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-02 12:05:53,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:05:53,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:53,253 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:53,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:53,254 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:53,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:53,256 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:53,256 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:53,258 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:53,258 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:05:53,280 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:53,280 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:53,280 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:53,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:05:53,282 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:53,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:53,284 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:05:53,285 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:05:54,254 WARN L197 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-12-02 12:05:54,428 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-02 12:05:54,814 WARN L197 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-12-02 12:05:55,006 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-02 12:05:55,025 INFO L131 LiptonReduction]: Checked pairs total: 4561 [2020-12-02 12:05:55,025 INFO L133 LiptonReduction]: Total number of compositions: 82 [2020-12-02 12:05:55,031 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-12-02 12:05:55,088 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2020-12-02 12:05:55,091 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2020-12-02 12:05:55,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-02 12:05:55,096 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:05:55,096 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-02 12:05:55,097 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:05:55,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:05:55,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1700340, now seen corresponding path program 1 times [2020-12-02 12:05:55,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:05:55,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995429760] [2020-12-02 12:05:55,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:05:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:05:55,340 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-02 12:05:55,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995429760] [2020-12-02 12:05:55,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:05:55,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 12:05:55,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719711074] [2020-12-02 12:05:55,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 12:05:55,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:05:55,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 12:05:55,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 12:05:55,367 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2020-12-02 12:05:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:05:55,530 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-12-02 12:05:55,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 12:05:55,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-02 12:05:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:05:55,558 INFO L225 Difference]: With dead ends: 812 [2020-12-02 12:05:55,558 INFO L226 Difference]: Without dead ends: 687 [2020-12-02 12:05:55,559 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-02 12:05:55,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-12-02 12:05:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-12-02 12:05:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-12-02 12:05:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-12-02 12:05:55,703 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2020-12-02 12:05:55,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:05:55,703 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-12-02 12:05:55,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 12:05:55,704 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-12-02 12:05:55,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-02 12:05:55,706 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:05:55,706 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:05:55,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 12:05:55,707 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:05:55,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:05:55,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1794497624, now seen corresponding path program 1 times [2020-12-02 12:05:55,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:05:55,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143956887] [2020-12-02 12:05:55,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:05:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:05:55,943 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-02 12:05:55,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143956887] [2020-12-02 12:05:55,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:05:55,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 12:05:55,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099545646] [2020-12-02 12:05:55,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:05:55,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:05:55,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:05:55,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:05:55,948 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states. [2020-12-02 12:05:56,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:05:56,003 INFO L93 Difference]: Finished difference Result 792 states and 2384 transitions. [2020-12-02 12:05:56,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:05:56,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-02 12:05:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:05:56,013 INFO L225 Difference]: With dead ends: 792 [2020-12-02 12:05:56,013 INFO L226 Difference]: Without dead ends: 667 [2020-12-02 12:05:56,014 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:05:56,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2020-12-02 12:05:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2020-12-02 12:05:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2020-12-02 12:05:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2074 transitions. [2020-12-02 12:05:56,045 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 2074 transitions. Word has length 10 [2020-12-02 12:05:56,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:05:56,046 INFO L481 AbstractCegarLoop]: Abstraction has 667 states and 2074 transitions. [2020-12-02 12:05:56,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:05:56,046 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 2074 transitions. [2020-12-02 12:05:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-02 12:05:56,057 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:05:56,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:05:56,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 12:05:56,057 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:05:56,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:05:56,063 INFO L82 PathProgramCache]: Analyzing trace with hash -592166290, now seen corresponding path program 1 times [2020-12-02 12:05:56,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:05:56,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558163926] [2020-12-02 12:05:56,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:05:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:05:56,197 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-02 12:05:56,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558163926] [2020-12-02 12:05:56,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:05:56,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 12:05:56,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549046208] [2020-12-02 12:05:56,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:05:56,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:05:56,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:05:56,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:05:56,199 INFO L87 Difference]: Start difference. First operand 667 states and 2074 transitions. Second operand 4 states. [2020-12-02 12:05:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:05:56,245 INFO L93 Difference]: Finished difference Result 736 states and 2205 transitions. [2020-12-02 12:05:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:05:56,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-02 12:05:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:05:56,251 INFO L225 Difference]: With dead ends: 736 [2020-12-02 12:05:56,251 INFO L226 Difference]: Without dead ends: 621 [2020-12-02 12:05:56,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:05:56,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-12-02 12:05:56,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2020-12-02 12:05:56,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2020-12-02 12:05:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1910 transitions. [2020-12-02 12:05:56,275 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1910 transitions. Word has length 11 [2020-12-02 12:05:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:05:56,275 INFO L481 AbstractCegarLoop]: Abstraction has 621 states and 1910 transitions. [2020-12-02 12:05:56,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:05:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1910 transitions. [2020-12-02 12:05:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 12:05:56,277 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:05:56,277 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:05:56,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 12:05:56,277 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:05:56,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:05:56,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1177282286, now seen corresponding path program 1 times [2020-12-02 12:05:56,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:05:56,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010941887] [2020-12-02 12:05:56,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:05:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:05:56,526 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-02 12:05:56,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010941887] [2020-12-02 12:05:56,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:05:56,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 12:05:56,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136658376] [2020-12-02 12:05:56,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:05:56,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:05:56,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:05:56,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:05:56,531 INFO L87 Difference]: Start difference. First operand 621 states and 1910 transitions. Second operand 4 states. [2020-12-02 12:05:56,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:05:56,574 INFO L93 Difference]: Finished difference Result 667 states and 1982 transitions. [2020-12-02 12:05:56,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:05:56,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-02 12:05:56,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:05:56,579 INFO L225 Difference]: With dead ends: 667 [2020-12-02 12:05:56,580 INFO L226 Difference]: Without dead ends: 575 [2020-12-02 12:05:56,580 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:05:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-12-02 12:05:56,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2020-12-02 12:05:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2020-12-02 12:05:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1746 transitions. [2020-12-02 12:05:56,600 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1746 transitions. Word has length 12 [2020-12-02 12:05:56,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:05:56,600 INFO L481 AbstractCegarLoop]: Abstraction has 575 states and 1746 transitions. [2020-12-02 12:05:56,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:05:56,600 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1746 transitions. [2020-12-02 12:05:56,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-02 12:05:56,602 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:05:56,602 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:05:56,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-02 12:05:56,602 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:05:56,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:05:56,602 INFO L82 PathProgramCache]: Analyzing trace with hash -2136042613, now seen corresponding path program 1 times [2020-12-02 12:05:56,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:05:56,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589189545] [2020-12-02 12:05:56,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:05:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:05:56,906 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-02 12:05:56,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589189545] [2020-12-02 12:05:56,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:05:56,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:05:56,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474471989] [2020-12-02 12:05:56,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:05:56,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:05:56,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:05:56,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:05:56,909 INFO L87 Difference]: Start difference. First operand 575 states and 1746 transitions. Second operand 6 states. [2020-12-02 12:05:57,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:05:57,122 INFO L93 Difference]: Finished difference Result 914 states and 2770 transitions. [2020-12-02 12:05:57,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:05:57,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-02 12:05:57,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:05:57,128 INFO L225 Difference]: With dead ends: 914 [2020-12-02 12:05:57,128 INFO L226 Difference]: Without dead ends: 545 [2020-12-02 12:05:57,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-02 12:05:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-12-02 12:05:57,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2020-12-02 12:05:57,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2020-12-02 12:05:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 1636 transitions. [2020-12-02 12:05:57,151 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 1636 transitions. Word has length 13 [2020-12-02 12:05:57,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:05:57,151 INFO L481 AbstractCegarLoop]: Abstraction has 545 states and 1636 transitions. [2020-12-02 12:05:57,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:05:57,151 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 1636 transitions. [2020-12-02 12:05:57,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-02 12:05:57,153 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:05:57,153 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:05:57,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-02 12:05:57,153 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:05:57,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:05:57,153 INFO L82 PathProgramCache]: Analyzing trace with hash -798431961, now seen corresponding path program 1 times [2020-12-02 12:05:57,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:05:57,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397756565] [2020-12-02 12:05:57,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:05:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:05:57,481 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-02 12:05:57,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397756565] [2020-12-02 12:05:57,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:05:57,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 12:05:57,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569165281] [2020-12-02 12:05:57,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 12:05:57,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:05:57,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 12:05:57,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:05:57,484 INFO L87 Difference]: Start difference. First operand 545 states and 1636 transitions. Second operand 7 states. [2020-12-02 12:05:57,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:05:57,760 INFO L93 Difference]: Finished difference Result 786 states and 2328 transitions. [2020-12-02 12:05:57,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 12:05:57,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-12-02 12:05:57,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:05:57,765 INFO L225 Difference]: With dead ends: 786 [2020-12-02 12:05:57,765 INFO L226 Difference]: Without dead ends: 489 [2020-12-02 12:05:57,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-02 12:05:57,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2020-12-02 12:05:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2020-12-02 12:05:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2020-12-02 12:05:57,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1410 transitions. [2020-12-02 12:05:57,785 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 1410 transitions. Word has length 14 [2020-12-02 12:05:57,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:05:57,786 INFO L481 AbstractCegarLoop]: Abstraction has 489 states and 1410 transitions. [2020-12-02 12:05:57,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 12:05:57,786 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 1410 transitions. [2020-12-02 12:05:57,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-02 12:05:57,787 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:05:57,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:05:57,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-02 12:05:57,787 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:05:57,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:05:57,788 INFO L82 PathProgramCache]: Analyzing trace with hash 962857171, now seen corresponding path program 1 times [2020-12-02 12:05:57,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:05:57,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459415966] [2020-12-02 12:05:57,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:05:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:05:58,063 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-02 12:05:58,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459415966] [2020-12-02 12:05:58,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:05:58,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 12:05:58,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516416486] [2020-12-02 12:05:58,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 12:05:58,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:05:58,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 12:05:58,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:05:58,066 INFO L87 Difference]: Start difference. First operand 489 states and 1410 transitions. Second operand 7 states. [2020-12-02 12:05:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:05:58,540 INFO L93 Difference]: Finished difference Result 524 states and 1481 transitions. [2020-12-02 12:05:58,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 12:05:58,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-12-02 12:05:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:05:58,545 INFO L225 Difference]: With dead ends: 524 [2020-12-02 12:05:58,545 INFO L226 Difference]: Without dead ends: 477 [2020-12-02 12:05:58,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-12-02 12:05:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2020-12-02 12:05:58,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 471. [2020-12-02 12:05:58,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2020-12-02 12:05:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1350 transitions. [2020-12-02 12:05:58,561 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1350 transitions. Word has length 14 [2020-12-02 12:05:58,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:05:58,561 INFO L481 AbstractCegarLoop]: Abstraction has 471 states and 1350 transitions. [2020-12-02 12:05:58,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 12:05:58,562 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1350 transitions. [2020-12-02 12:05:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-02 12:05:58,563 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:05:58,563 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:05:58,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-02 12:05:58,563 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:05:58,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:05:58,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1788104909, now seen corresponding path program 2 times [2020-12-02 12:05:58,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:05:58,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291361307] [2020-12-02 12:05:58,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:05:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:05:58,866 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-02 12:05:58,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291361307] [2020-12-02 12:05:58,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:05:58,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 12:05:58,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824740551] [2020-12-02 12:05:58,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 12:05:58,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:05:58,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 12:05:58,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:05:58,868 INFO L87 Difference]: Start difference. First operand 471 states and 1350 transitions. Second operand 7 states. [2020-12-02 12:05:59,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:05:59,114 INFO L93 Difference]: Finished difference Result 574 states and 1606 transitions. [2020-12-02 12:05:59,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:05:59,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-12-02 12:05:59,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:05:59,119 INFO L225 Difference]: With dead ends: 574 [2020-12-02 12:05:59,119 INFO L226 Difference]: Without dead ends: 437 [2020-12-02 12:05:59,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-02 12:05:59,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-12-02 12:05:59,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2020-12-02 12:05:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-12-02 12:05:59,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1236 transitions. [2020-12-02 12:05:59,135 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1236 transitions. Word has length 14 [2020-12-02 12:05:59,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:05:59,136 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 1236 transitions. [2020-12-02 12:05:59,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 12:05:59,136 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1236 transitions. [2020-12-02 12:05:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 12:05:59,137 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:05:59,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:05:59,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-02 12:05:59,138 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:05:59,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:05:59,141 INFO L82 PathProgramCache]: Analyzing trace with hash -520885577, now seen corresponding path program 1 times [2020-12-02 12:05:59,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:05:59,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022225661] [2020-12-02 12:05:59,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:05:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:05:59,613 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-02 12:05:59,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022225661] [2020-12-02 12:05:59,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:05:59,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-02 12:05:59,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71596489] [2020-12-02 12:05:59,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 12:05:59,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:05:59,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 12:05:59,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:05:59,615 INFO L87 Difference]: Start difference. First operand 437 states and 1236 transitions. Second operand 8 states. [2020-12-02 12:06:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:06:00,197 INFO L93 Difference]: Finished difference Result 719 states and 1976 transitions. [2020-12-02 12:06:00,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 12:06:00,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-12-02 12:06:00,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:06:00,202 INFO L225 Difference]: With dead ends: 719 [2020-12-02 12:06:00,202 INFO L226 Difference]: Without dead ends: 495 [2020-12-02 12:06:00,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-12-02 12:06:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-12-02 12:06:00,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 423. [2020-12-02 12:06:00,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2020-12-02 12:06:00,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1157 transitions. [2020-12-02 12:06:00,217 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1157 transitions. Word has length 15 [2020-12-02 12:06:00,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:06:00,217 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 1157 transitions. [2020-12-02 12:06:00,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 12:06:00,217 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1157 transitions. [2020-12-02 12:06:00,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 12:06:00,219 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:06:00,219 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:06:00,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-02 12:06:00,219 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:06:00,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:06:00,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1032380416, now seen corresponding path program 1 times [2020-12-02 12:06:00,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:06:00,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112194386] [2020-12-02 12:06:00,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:06:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:06:00,623 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-02 12:06:00,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112194386] [2020-12-02 12:06:00,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:06:00,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-02 12:06:00,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054128965] [2020-12-02 12:06:00,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 12:06:00,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:06:00,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 12:06:00,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:06:00,625 INFO L87 Difference]: Start difference. First operand 423 states and 1157 transitions. Second operand 8 states. [2020-12-02 12:06:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:06:01,048 INFO L93 Difference]: Finished difference Result 471 states and 1255 transitions. [2020-12-02 12:06:01,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 12:06:01,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-12-02 12:06:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:06:01,051 INFO L225 Difference]: With dead ends: 471 [2020-12-02 12:06:01,051 INFO L226 Difference]: Without dead ends: 341 [2020-12-02 12:06:01,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-12-02 12:06:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-12-02 12:06:01,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 305. [2020-12-02 12:06:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2020-12-02 12:06:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 820 transitions. [2020-12-02 12:06:01,063 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 820 transitions. Word has length 16 [2020-12-02 12:06:01,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:06:01,063 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 820 transitions. [2020-12-02 12:06:01,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 12:06:01,063 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 820 transitions. [2020-12-02 12:06:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 12:06:01,064 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:06:01,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:06:01,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-02 12:06:01,065 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:06:01,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:06:01,066 INFO L82 PathProgramCache]: Analyzing trace with hash 568652798, now seen corresponding path program 1 times [2020-12-02 12:06:01,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:06:01,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719622285] [2020-12-02 12:06:01,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:06:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:06:01,202 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-02 12:06:01,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719622285] [2020-12-02 12:06:01,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:06:01,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:06:01,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964966187] [2020-12-02 12:06:01,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:06:01,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:06:01,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:06:01,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:06:01,205 INFO L87 Difference]: Start difference. First operand 305 states and 820 transitions. Second operand 4 states. [2020-12-02 12:06:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:06:01,234 INFO L93 Difference]: Finished difference Result 444 states and 1169 transitions. [2020-12-02 12:06:01,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 12:06:01,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-12-02 12:06:01,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:06:01,257 INFO L225 Difference]: With dead ends: 444 [2020-12-02 12:06:01,257 INFO L226 Difference]: Without dead ends: 192 [2020-12-02 12:06:01,258 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-02 12:06:01,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-12-02 12:06:01,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2020-12-02 12:06:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-12-02 12:06:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 465 transitions. [2020-12-02 12:06:01,263 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 465 transitions. Word has length 17 [2020-12-02 12:06:01,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:06:01,263 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 465 transitions. [2020-12-02 12:06:01,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:06:01,264 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 465 transitions. [2020-12-02 12:06:01,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 12:06:01,264 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:06:01,265 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:06:01,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-02 12:06:01,265 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:06:01,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:06:01,266 INFO L82 PathProgramCache]: Analyzing trace with hash 370213538, now seen corresponding path program 2 times [2020-12-02 12:06:01,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:06:01,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12166264] [2020-12-02 12:06:01,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:06:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:06:01,382 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-02 12:06:01,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12166264] [2020-12-02 12:06:01,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:06:01,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:06:01,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610727492] [2020-12-02 12:06:01,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:06:01,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:06:01,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:06:01,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:06:01,385 INFO L87 Difference]: Start difference. First operand 192 states and 465 transitions. Second operand 4 states. [2020-12-02 12:06:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:06:01,407 INFO L93 Difference]: Finished difference Result 166 states and 366 transitions. [2020-12-02 12:06:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 12:06:01,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-12-02 12:06:01,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:06:01,409 INFO L225 Difference]: With dead ends: 166 [2020-12-02 12:06:01,409 INFO L226 Difference]: Without dead ends: 129 [2020-12-02 12:06:01,410 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-02 12:06:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-12-02 12:06:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2020-12-02 12:06:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-12-02 12:06:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 282 transitions. [2020-12-02 12:06:01,414 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 282 transitions. Word has length 17 [2020-12-02 12:06:01,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:06:01,415 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 282 transitions. [2020-12-02 12:06:01,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:06:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 282 transitions. [2020-12-02 12:06:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 12:06:01,416 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:06:01,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:06:01,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-02 12:06:01,416 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:06:01,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:06:01,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1891822740, now seen corresponding path program 1 times [2020-12-02 12:06:01,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:06:01,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220836804] [2020-12-02 12:06:01,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:06:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:06:01,533 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-02 12:06:01,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220836804] [2020-12-02 12:06:01,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:06:01,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:06:01,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878698360] [2020-12-02 12:06:01,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 12:06:01,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:06:01,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 12:06:01,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:06:01,536 INFO L87 Difference]: Start difference. First operand 129 states and 282 transitions. Second operand 5 states. [2020-12-02 12:06:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:06:01,574 INFO L93 Difference]: Finished difference Result 106 states and 200 transitions. [2020-12-02 12:06:01,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:06:01,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-12-02 12:06:01,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:06:01,576 INFO L225 Difference]: With dead ends: 106 [2020-12-02 12:06:01,576 INFO L226 Difference]: Without dead ends: 85 [2020-12-02 12:06:01,576 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:06:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-12-02 12:06:01,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-12-02 12:06:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-12-02 12:06:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 154 transitions. [2020-12-02 12:06:01,580 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 154 transitions. Word has length 18 [2020-12-02 12:06:01,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:06:01,580 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 154 transitions. [2020-12-02 12:06:01,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 12:06:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 154 transitions. [2020-12-02 12:06:01,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 12:06:01,581 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:06:01,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:06:01,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-02 12:06:01,582 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:06:01,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:06:01,582 INFO L82 PathProgramCache]: Analyzing trace with hash 585660938, now seen corresponding path program 1 times [2020-12-02 12:06:01,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:06:01,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632866121] [2020-12-02 12:06:01,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:06:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:06:01,716 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-02 12:06:01,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632866121] [2020-12-02 12:06:01,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:06:01,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 12:06:01,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702033911] [2020-12-02 12:06:01,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:06:01,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:06:01,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:06:01,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:06:01,719 INFO L87 Difference]: Start difference. First operand 85 states and 154 transitions. Second operand 6 states. [2020-12-02 12:06:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:06:01,766 INFO L93 Difference]: Finished difference Result 70 states and 122 transitions. [2020-12-02 12:06:01,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:06:01,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-12-02 12:06:01,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:06:01,767 INFO L225 Difference]: With dead ends: 70 [2020-12-02 12:06:01,767 INFO L226 Difference]: Without dead ends: 63 [2020-12-02 12:06:01,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-02 12:06:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-12-02 12:06:01,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-12-02 12:06:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-02 12:06:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2020-12-02 12:06:01,770 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 20 [2020-12-02 12:06:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:06:01,771 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2020-12-02 12:06:01,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:06:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2020-12-02 12:06:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 12:06:01,772 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:06:01,772 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:06:01,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-02 12:06:01,772 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:06:01,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:06:01,773 INFO L82 PathProgramCache]: Analyzing trace with hash -718551793, now seen corresponding path program 1 times [2020-12-02 12:06:01,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:06:01,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144896555] [2020-12-02 12:06:01,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:06:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 12:06:01,879 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 12:06:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 12:06:01,974 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 12:06:02,019 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 12:06:02,019 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 12:06:02,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-02 12:06:02,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:06:02 BasicIcfg [2020-12-02 12:06:02,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 12:06:02,158 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 12:06:02,158 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 12:06:02,159 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 12:06:02,159 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:05:36" (3/4) ... [2020-12-02 12:06:02,162 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-02 12:06:02,323 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 12:06:02,323 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 12:06:02,324 INFO L168 Benchmark]: Toolchain (without parser) took 30331.76 ms. Allocated memory was 41.9 MB in the beginning and 503.3 MB in the end (delta: 461.4 MB). Free memory was 18.3 MB in the beginning and 264.7 MB in the end (delta: -246.3 MB). Peak memory consumption was 215.9 MB. Max. memory is 16.1 GB. [2020-12-02 12:06:02,325 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 41.9 MB. Free memory was 24.9 MB in the beginning and 24.8 MB in the end (delta: 42.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 12:06:02,325 INFO L168 Benchmark]: CACSL2BoogieTranslator took 871.32 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 18.2 MB in the beginning and 26.0 MB in the end (delta: -7.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 16.1 GB. [2020-12-02 12:06:02,326 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.18 ms. Allocated memory is still 52.4 MB. Free memory was 26.0 MB in the beginning and 22.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-02 12:06:02,326 INFO L168 Benchmark]: Boogie Preprocessor took 102.42 ms. Allocated memory is still 52.4 MB. Free memory was 22.8 MB in the beginning and 20.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 12:06:02,327 INFO L168 Benchmark]: RCFGBuilder took 3392.06 ms. Allocated memory was 52.4 MB in the beginning and 104.9 MB in the end (delta: 52.4 MB). Free memory was 33.3 MB in the beginning and 67.6 MB in the end (delta: -34.3 MB). Peak memory consumption was 62.4 MB. Max. memory is 16.1 GB. [2020-12-02 12:06:02,327 INFO L168 Benchmark]: TraceAbstraction took 25710.29 ms. Allocated memory was 104.9 MB in the beginning and 503.3 MB in the end (delta: 398.5 MB). Free memory was 66.6 MB in the beginning and 284.6 MB in the end (delta: -218.0 MB). Peak memory consumption was 180.4 MB. Max. memory is 16.1 GB. [2020-12-02 12:06:02,328 INFO L168 Benchmark]: Witness Printer took 165.23 ms. Allocated memory is still 503.3 MB. Free memory was 284.6 MB in the beginning and 264.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-12-02 12:06:02,331 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.15 ms. Allocated memory is still 41.9 MB. Free memory was 24.9 MB in the beginning and 24.8 MB in the end (delta: 42.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 871.32 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 18.2 MB in the beginning and 26.0 MB in the end (delta: -7.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 75.18 ms. Allocated memory is still 52.4 MB. Free memory was 26.0 MB in the beginning and 22.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 102.42 ms. Allocated memory is still 52.4 MB. Free memory was 22.8 MB in the beginning and 20.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3392.06 ms. Allocated memory was 52.4 MB in the beginning and 104.9 MB in the end (delta: 52.4 MB). Free memory was 33.3 MB in the beginning and 67.6 MB in the end (delta: -34.3 MB). Peak memory consumption was 62.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 25710.29 ms. Allocated memory was 104.9 MB in the beginning and 503.3 MB in the end (delta: 398.5 MB). Free memory was 66.6 MB in the beginning and 284.6 MB in the end (delta: -218.0 MB). Peak memory consumption was 180.4 MB. Max. memory is 16.1 GB. * Witness Printer took 165.23 ms. Allocated memory is still 503.3 MB. Free memory was 284.6 MB in the beginning and 264.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1115 VarBasedMoverChecksPositive, 81 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 52 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.3s, 135 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 18.3s, 105 PlacesBefore, 37 PlacesAfterwards, 97 TransitionsBefore, 28 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, 4561 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1873; [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 pthread_t t1874; [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1875; [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L776] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L811] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L812] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L813] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L814] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L815] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L816] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L867] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L868] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L869] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L870] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L872] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 25.3s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.4s, HoareTripleCheckerStatistics: 357 SDtfs, 605 SDslu, 708 SDs, 0 SdLazy, 468 SolverSat, 217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 114 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 27479 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...