./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix007_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_46fd7cbd-2885-4d36-be1c-97fd2acec4e0/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_46fd7cbd-2885-4d36-be1c-97fd2acec4e0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_46fd7cbd-2885-4d36-be1c-97fd2acec4e0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_46fd7cbd-2885-4d36-be1c-97fd2acec4e0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix007_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_46fd7cbd-2885-4d36-be1c-97fd2acec4e0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_46fd7cbd-2885-4d36-be1c-97fd2acec4e0/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8dc0e53f414aa481cc0d92e1b6c26bc1f4ed0399 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-69874e2 [2020-12-01 15:05:58,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 15:05:58,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 15:05:58,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 15:05:58,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 15:05:58,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 15:05:58,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 15:05:58,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 15:05:58,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 15:05:58,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 15:05:58,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 15:05:58,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 15:05:58,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 15:05:58,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 15:05:58,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 15:05:58,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 15:05:58,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 15:05:58,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 15:05:58,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 15:05:58,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 15:05:58,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 15:05:58,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 15:05:58,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 15:05:58,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 15:05:58,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 15:05:58,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 15:05:58,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 15:05:58,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 15:05:58,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 15:05:58,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 15:05:58,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 15:05:58,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 15:05:58,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 15:05:58,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 15:05:58,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 15:05:58,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 15:05:58,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 15:05:58,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 15:05:58,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 15:05:58,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 15:05:58,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 15:05:58,457 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_46fd7cbd-2885-4d36-be1c-97fd2acec4e0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-01 15:05:58,498 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 15:05:58,499 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 15:05:58,501 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 15:05:58,501 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 15:05:58,501 INFO L138 SettingsManager]: * Use SBE=true [2020-12-01 15:05:58,502 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 15:05:58,502 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 15:05:58,502 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 15:05:58,502 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 15:05:58,502 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 15:05:58,504 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 15:05:58,504 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 15:05:58,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 15:05:58,504 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 15:05:58,505 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 15:05:58,505 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 15:05:58,505 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 15:05:58,505 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 15:05:58,505 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-01 15:05:58,506 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 15:05:58,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-01 15:05:58,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 15:05:58,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 15:05:58,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 15:05:58,507 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 15:05:58,507 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-01 15:05:58,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 15:05:58,507 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 15:05:58,508 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-01 15:05:58,508 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_46fd7cbd-2885-4d36-be1c-97fd2acec4e0/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_46fd7cbd-2885-4d36-be1c-97fd2acec4e0/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8dc0e53f414aa481cc0d92e1b6c26bc1f4ed0399 [2020-12-01 15:05:58,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 15:05:58,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 15:05:58,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 15:05:58,867 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 15:05:58,868 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 15:05:58,870 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_46fd7cbd-2885-4d36-be1c-97fd2acec4e0/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix007_power.oepc.i [2020-12-01 15:05:58,955 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_46fd7cbd-2885-4d36-be1c-97fd2acec4e0/bin/uautomizer/data/7923c1e15/3a315aaad07b44c3b7c0b8f1431354d2/FLAG0f45bb69d [2020-12-01 15:05:59,651 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 15:05:59,652 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_46fd7cbd-2885-4d36-be1c-97fd2acec4e0/sv-benchmarks/c/pthread-wmm/mix007_power.oepc.i [2020-12-01 15:05:59,679 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_46fd7cbd-2885-4d36-be1c-97fd2acec4e0/bin/uautomizer/data/7923c1e15/3a315aaad07b44c3b7c0b8f1431354d2/FLAG0f45bb69d [2020-12-01 15:05:59,890 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_46fd7cbd-2885-4d36-be1c-97fd2acec4e0/bin/uautomizer/data/7923c1e15/3a315aaad07b44c3b7c0b8f1431354d2 [2020-12-01 15:05:59,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 15:05:59,895 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 15:05:59,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 15:05:59,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 15:05:59,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 15:05:59,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:05:59" (1/1) ... [2020-12-01 15:05:59,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@491f109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:05:59, skipping insertion in model container [2020-12-01 15:05:59,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:05:59" (1/1) ... [2020-12-01 15:05:59,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 15:05:59,993 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 15:06:00,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:06:00,576 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 15:06:00,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:06:00,793 INFO L208 MainTranslator]: Completed translation [2020-12-01 15:06:00,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:06:00 WrapperNode [2020-12-01 15:06:00,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 15:06:00,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 15:06:00,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 15:06:00,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 15:06:00,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:06:00" (1/1) ... [2020-12-01 15:06:00,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:06:00" (1/1) ... [2020-12-01 15:06:00,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 15:06:00,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 15:06:00,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 15:06:00,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 15:06:00,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:06:00" (1/1) ... [2020-12-01 15:06:00,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:06:00" (1/1) ... [2020-12-01 15:06:00,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:06:00" (1/1) ... [2020-12-01 15:06:00,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:06:00" (1/1) ... [2020-12-01 15:06:00,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:06:00" (1/1) ... [2020-12-01 15:06:00,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:06:00" (1/1) ... [2020-12-01 15:06:00,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:06:00" (1/1) ... [2020-12-01 15:06:00,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 15:06:00,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 15:06:00,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 15:06:00,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 15:06:00,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:06:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46fd7cbd-2885-4d36-be1c-97fd2acec4e0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 15:06:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-01 15:06:01,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-01 15:06:01,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 15:06:01,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-01 15:06:01,082 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-01 15:06:01,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-01 15:06:01,083 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-01 15:06:01,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-01 15:06:01,083 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-01 15:06:01,084 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-01 15:06:01,084 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-01 15:06:01,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-01 15:06:01,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 15:06:01,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-01 15:06:01,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 15:06:01,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 15:06:01,087 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-01 15:06:04,142 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 15:06:04,143 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-12-01 15:06:04,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:06:04 BoogieIcfgContainer [2020-12-01 15:06:04,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 15:06:04,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-01 15:06:04,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-01 15:06:04,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-01 15:06:04,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:05:59" (1/3) ... [2020-12-01 15:06:04,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa513b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:06:04, skipping insertion in model container [2020-12-01 15:06:04,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:06:00" (2/3) ... [2020-12-01 15:06:04,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa513b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:06:04, skipping insertion in model container [2020-12-01 15:06:04,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:06:04" (3/3) ... [2020-12-01 15:06:04,154 INFO L111 eAbstractionObserver]: Analyzing ICFG mix007_power.oepc.i [2020-12-01 15:06:04,168 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-01 15:06:04,168 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-01 15:06:04,172 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-01 15:06:04,173 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-01 15:06:04,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,234 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,234 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,234 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,234 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,234 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,234 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,235 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,235 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,236 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,237 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,239 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,244 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,245 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,245 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,245 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,250 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,250 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,251 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,251 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,261 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,261 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,261 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,263 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,270 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,270 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,270 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,270 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,271 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,271 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,271 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,271 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,271 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,271 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,271 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,271 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,272 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,272 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,272 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,272 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,272 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,272 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,272 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,272 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,275 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,275 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,275 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,275 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,280 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,280 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,280 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,280 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,280 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,280 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,280 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,280 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,281 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,281 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,281 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,281 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,281 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,281 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,281 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,281 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,281 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,283 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,283 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,283 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,285 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,285 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,285 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,286 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,286 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,286 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,286 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,286 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,290 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,291 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,294 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,295 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,303 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,304 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,321 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,322 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,323 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:06:04,327 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-01 15:06:04,340 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-01 15:06:04,374 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-01 15:06:04,374 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-01 15:06:04,375 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-01 15:06:04,375 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-01 15:06:04,375 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-01 15:06:04,375 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-01 15:06:04,375 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-01 15:06:04,375 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-01 15:06:04,391 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-01 15:06:04,394 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 124 transitions, 268 flow [2020-12-01 15:06:04,397 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 124 transitions, 268 flow [2020-12-01 15:06:04,399 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 134 places, 124 transitions, 268 flow [2020-12-01 15:06:04,475 INFO L129 PetriNetUnfolder]: 3/120 cut-off events. [2020-12-01 15:06:04,475 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-01 15:06:04,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 120 events. 3/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 102 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2020-12-01 15:06:04,486 INFO L116 LiptonReduction]: Number of co-enabled transitions 3134 [2020-12-01 15:06:04,728 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:04,729 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:04,731 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:04,732 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:04,741 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:04,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:04,749 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:04,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:04,814 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:04,814 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:04,816 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:04,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:04,824 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:04,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:04,830 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:04,830 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:05,150 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-01 15:06:05,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:05,526 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-12-01 15:06:05,661 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2020-12-01 15:06:06,128 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:06,130 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:06,132 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,133 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:06,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-01 15:06:06,136 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:06,172 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,173 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:06,174 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:06,179 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,179 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:06,183 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,184 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:06,409 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:06,411 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:06,423 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:06,428 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,428 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:06,459 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:06,460 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:06,469 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:06,473 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,474 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:06,505 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,505 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:06,506 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:06,509 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:06,511 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:06,543 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:06,544 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:06,546 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:06,550 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:06,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:06,912 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-01 15:06:07,019 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-12-01 15:06:07,469 WARN L197 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-01 15:06:07,479 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-12-01 15:06:07,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:07,765 WARN L197 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2020-12-01 15:06:07,861 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:07,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:07,863 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:07,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:07,865 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:07,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:07,868 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:07,868 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:07,889 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:07,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:07,890 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:07,891 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:07,892 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:07,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:07,895 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:07,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:08,047 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:08,049 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:08,052 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,052 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:08,055 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:08,077 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:08,079 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:08,081 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,081 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:08,083 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,084 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:08,407 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:08,409 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:08,412 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:08,415 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,415 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:08,438 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:08,440 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:08,442 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:08,445 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,446 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:08,598 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:08,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:08,608 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:08,611 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:08,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:08,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:08,642 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:08,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:08,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:08,974 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-12-01 15:06:09,085 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-12-01 15:06:09,273 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-12-01 15:06:09,457 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-12-01 15:06:09,485 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:09,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:09,487 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:09,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:09,489 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:09,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:09,491 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:09,491 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:09,507 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:09,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:09,508 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:09,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:09,510 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:09,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:09,512 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:09,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:09,833 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:09,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:09,834 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:09,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:09,836 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:09,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:09,838 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:09,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:09,855 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:09,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:09,856 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:09,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:09,858 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:09,858 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:09,860 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:09,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:10,218 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:10,220 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:10,222 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,222 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:10,224 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:10,242 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:10,243 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:10,248 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:10,250 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:10,464 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,464 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:10,466 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:06:10,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:06:10,468 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 15:06:10,468 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:06:10,470 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:06:10,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:06:10,473 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:10,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:10,475 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:10,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:10,477 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:10,478 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:10,543 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:10,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-01 15:06:10,546 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:10,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:10,584 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:10,586 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:10,588 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:10,590 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:10,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:10,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:10,641 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:10,644 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:10,832 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:10,833 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:10,835 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:10,837 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:10,855 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:10,856 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:10,858 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:10,860 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:10,932 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:10,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-01 15:06:10,934 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:10,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:10,970 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:10,970 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:10,985 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:06:10,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:06:10,988 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 15:06:10,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:06:10,989 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:06:10,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:06:10,991 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:10,992 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:10,993 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:10,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:10,995 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:10,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:11,033 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:11,034 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:11,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:11,038 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,038 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:11,054 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,055 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:11,056 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:11,058 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:11,060 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:11,135 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,135 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:11,136 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,136 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:11,138 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,138 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:11,140 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,141 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:11,157 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:11,158 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:11,160 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:11,162 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:11,297 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-12-01 15:06:11,464 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-12-01 15:06:11,610 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:11,611 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:11,614 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:11,616 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:11,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:11,634 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,634 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:11,636 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:11,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:11,776 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:11,777 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:11,779 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:11,781 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:11,798 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,798 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:11,799 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:11,801 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,801 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:11,803 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:11,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:12,025 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,026 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,028 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:12,029 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:12,046 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,046 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,047 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,049 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:12,051 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,052 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:12,106 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,106 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,108 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:06:12,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:06:12,110 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 15:06:12,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:06:12,112 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:06:12,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:06:12,114 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:12,114 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:12,115 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:12,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:12,117 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:12,118 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:12,194 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:12,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-01 15:06:12,197 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:12,198 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,419 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,420 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,420 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,422 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:12,424 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:12,440 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,441 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,443 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:12,446 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,446 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:12,471 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,472 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,474 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:12,476 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,477 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:12,497 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,504 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:12,506 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:12,575 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,576 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,579 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,580 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:12,582 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:12,599 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,602 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:12,604 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:12,724 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,726 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,727 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,728 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:12,729 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:12,746 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:12,750 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:12,753 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:12,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:06:13,776 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:13,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-01 15:06:13,779 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:13,779 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:13,821 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:06:13,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:06:13,824 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:06:13,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:06:13,826 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 15:06:13,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:06:13,827 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:06:13,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:06:13,829 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:13,830 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:13,831 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:13,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:13,832 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:06:13,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:06:14,693 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-12-01 15:06:14,858 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-12-01 15:06:15,028 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-12-01 15:06:15,152 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-12-01 15:06:15,717 WARN L197 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-12-01 15:06:15,948 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-12-01 15:06:16,398 WARN L197 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-12-01 15:06:16,600 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-12-01 15:06:16,608 INFO L131 LiptonReduction]: Checked pairs total: 10058 [2020-12-01 15:06:16,608 INFO L133 LiptonReduction]: Total number of compositions: 107 [2020-12-01 15:06:16,615 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 36 transitions, 92 flow [2020-12-01 15:06:17,069 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 5834 states. [2020-12-01 15:06:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states. [2020-12-01 15:06:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-01 15:06:17,076 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:06:17,077 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-01 15:06:17,078 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:06:17,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:06:17,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1256708, now seen corresponding path program 1 times [2020-12-01 15:06:17,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:06:17,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053581082] [2020-12-01 15:06:17,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:06:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:06:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:06:17,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053581082] [2020-12-01 15:06:17,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:06:17,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-01 15:06:17,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821739559] [2020-12-01 15:06:17,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:06:17,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:06:17,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:06:17,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:06:17,447 INFO L87 Difference]: Start difference. First operand 5834 states. Second operand 3 states. [2020-12-01 15:06:17,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:06:17,658 INFO L93 Difference]: Finished difference Result 4862 states and 19480 transitions. [2020-12-01 15:06:17,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:06:17,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-01 15:06:17,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:06:17,741 INFO L225 Difference]: With dead ends: 4862 [2020-12-01 15:06:17,741 INFO L226 Difference]: Without dead ends: 3962 [2020-12-01 15:06:17,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:06:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2020-12-01 15:06:18,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3962. [2020-12-01 15:06:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3962 states. [2020-12-01 15:06:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 15640 transitions. [2020-12-01 15:06:18,081 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 15640 transitions. Word has length 3 [2020-12-01 15:06:18,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:06:18,081 INFO L481 AbstractCegarLoop]: Abstraction has 3962 states and 15640 transitions. [2020-12-01 15:06:18,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:06:18,082 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 15640 transitions. [2020-12-01 15:06:18,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-01 15:06:18,088 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:06:18,088 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:06:18,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-01 15:06:18,088 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:06:18,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:06:18,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1319886223, now seen corresponding path program 1 times [2020-12-01 15:06:18,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:06:18,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019533530] [2020-12-01 15:06:18,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:06:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:06:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:06:18,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019533530] [2020-12-01 15:06:18,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:06:18,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-01 15:06:18,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106890263] [2020-12-01 15:06:18,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:06:18,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:06:18,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:06:18,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:06:18,245 INFO L87 Difference]: Start difference. First operand 3962 states and 15640 transitions. Second operand 3 states. [2020-12-01 15:06:18,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:06:18,303 INFO L93 Difference]: Finished difference Result 3662 states and 14310 transitions. [2020-12-01 15:06:18,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:06:18,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-01 15:06:18,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:06:18,345 INFO L225 Difference]: With dead ends: 3662 [2020-12-01 15:06:18,346 INFO L226 Difference]: Without dead ends: 3662 [2020-12-01 15:06:18,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:06:18,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2020-12-01 15:06:18,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3662. [2020-12-01 15:06:18,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3662 states. [2020-12-01 15:06:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 14310 transitions. [2020-12-01 15:06:18,540 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 14310 transitions. Word has length 11 [2020-12-01 15:06:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:06:18,542 INFO L481 AbstractCegarLoop]: Abstraction has 3662 states and 14310 transitions. [2020-12-01 15:06:18,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:06:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 14310 transitions. [2020-12-01 15:06:18,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-01 15:06:18,551 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:06:18,551 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:06:18,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-01 15:06:18,552 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:06:18,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:06:18,562 INFO L82 PathProgramCache]: Analyzing trace with hash -770127518, now seen corresponding path program 1 times [2020-12-01 15:06:18,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:06:18,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751940205] [2020-12-01 15:06:18,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:06:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:06:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:06:18,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751940205] [2020-12-01 15:06:18,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:06:18,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-01 15:06:18,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496801938] [2020-12-01 15:06:18,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:06:18,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:06:18,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:06:18,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:06:18,644 INFO L87 Difference]: Start difference. First operand 3662 states and 14310 transitions. Second operand 3 states. [2020-12-01 15:06:18,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:06:18,692 INFO L93 Difference]: Finished difference Result 3462 states and 13440 transitions. [2020-12-01 15:06:18,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:06:18,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-12-01 15:06:18,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:06:18,729 INFO L225 Difference]: With dead ends: 3462 [2020-12-01 15:06:18,730 INFO L226 Difference]: Without dead ends: 3462 [2020-12-01 15:06:18,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:06:18,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2020-12-01 15:06:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3462. [2020-12-01 15:06:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3462 states. [2020-12-01 15:06:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 13440 transitions. [2020-12-01 15:06:18,997 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 13440 transitions. Word has length 13 [2020-12-01 15:06:18,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:06:18,997 INFO L481 AbstractCegarLoop]: Abstraction has 3462 states and 13440 transitions. [2020-12-01 15:06:18,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:06:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 13440 transitions. [2020-12-01 15:06:19,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-01 15:06:19,002 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:06:19,002 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:06:19,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-01 15:06:19,003 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:06:19,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:06:19,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1362589169, now seen corresponding path program 1 times [2020-12-01 15:06:19,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:06:19,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146420027] [2020-12-01 15:06:19,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:06:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:06:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:06:19,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146420027] [2020-12-01 15:06:19,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:06:19,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:06:19,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656171167] [2020-12-01 15:06:19,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:06:19,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:06:19,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:06:19,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:06:19,125 INFO L87 Difference]: Start difference. First operand 3462 states and 13440 transitions. Second operand 4 states. [2020-12-01 15:06:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:06:19,227 INFO L93 Difference]: Finished difference Result 3418 states and 12060 transitions. [2020-12-01 15:06:19,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:06:19,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-01 15:06:19,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:06:19,269 INFO L225 Difference]: With dead ends: 3418 [2020-12-01 15:06:19,270 INFO L226 Difference]: Without dead ends: 2518 [2020-12-01 15:06:19,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:06:19,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2020-12-01 15:06:19,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2518. [2020-12-01 15:06:19,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2518 states. [2020-12-01 15:06:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 8720 transitions. [2020-12-01 15:06:19,465 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 8720 transitions. Word has length 15 [2020-12-01 15:06:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:06:19,465 INFO L481 AbstractCegarLoop]: Abstraction has 2518 states and 8720 transitions. [2020-12-01 15:06:19,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:06:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 8720 transitions. [2020-12-01 15:06:19,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-01 15:06:19,471 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:06:19,471 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-01 15:06:19,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-01 15:06:19,471 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:06:19,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:06:19,472 INFO L82 PathProgramCache]: Analyzing trace with hash 34050721, now seen corresponding path program 1 times [2020-12-01 15:06:19,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:06:19,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488112767] [2020-12-01 15:06:19,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:06:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:06:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:06:19,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488112767] [2020-12-01 15:06:19,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:06:19,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:06:19,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286283753] [2020-12-01 15:06:19,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:06:19,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:06:19,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:06:19,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:06:19,643 INFO L87 Difference]: Start difference. First operand 2518 states and 8720 transitions. Second operand 5 states. [2020-12-01 15:06:19,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:06:19,746 INFO L93 Difference]: Finished difference Result 2130 states and 6868 transitions. [2020-12-01 15:06:19,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:06:19,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-12-01 15:06:19,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:06:19,754 INFO L225 Difference]: With dead ends: 2130 [2020-12-01 15:06:19,754 INFO L226 Difference]: Without dead ends: 1630 [2020-12-01 15:06:19,755 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:06:19,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2020-12-01 15:06:19,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1630. [2020-12-01 15:06:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1630 states. [2020-12-01 15:06:19,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 5168 transitions. [2020-12-01 15:06:19,813 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 5168 transitions. Word has length 18 [2020-12-01 15:06:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:06:19,814 INFO L481 AbstractCegarLoop]: Abstraction has 1630 states and 5168 transitions. [2020-12-01 15:06:19,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:06:19,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 5168 transitions. [2020-12-01 15:06:19,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 15:06:19,818 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:06:19,819 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:06:19,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-01 15:06:19,819 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:06:19,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:06:19,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1773749763, now seen corresponding path program 1 times [2020-12-01 15:06:19,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:06:19,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704588220] [2020-12-01 15:06:19,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:06:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:06:20,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:06:20,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704588220] [2020-12-01 15:06:20,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:06:20,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:06:20,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178829671] [2020-12-01 15:06:20,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:06:20,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:06:20,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:06:20,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:06:20,024 INFO L87 Difference]: Start difference. First operand 1630 states and 5168 transitions. Second operand 6 states. [2020-12-01 15:06:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:06:20,119 INFO L93 Difference]: Finished difference Result 1455 states and 4604 transitions. [2020-12-01 15:06:20,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:06:20,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-01 15:06:20,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:06:20,125 INFO L225 Difference]: With dead ends: 1455 [2020-12-01 15:06:20,126 INFO L226 Difference]: Without dead ends: 1315 [2020-12-01 15:06:20,126 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:06:20,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2020-12-01 15:06:20,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1315. [2020-12-01 15:06:20,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1315 states. [2020-12-01 15:06:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 4223 transitions. [2020-12-01 15:06:20,174 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 4223 transitions. Word has length 21 [2020-12-01 15:06:20,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:06:20,174 INFO L481 AbstractCegarLoop]: Abstraction has 1315 states and 4223 transitions. [2020-12-01 15:06:20,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:06:20,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 4223 transitions. [2020-12-01 15:06:20,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-01 15:06:20,179 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:06:20,179 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:06:20,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-01 15:06:20,180 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:06:20,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:06:20,180 INFO L82 PathProgramCache]: Analyzing trace with hash -159250378, now seen corresponding path program 1 times [2020-12-01 15:06:20,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:06:20,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891702125] [2020-12-01 15:06:20,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:06:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:06:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:06:20,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891702125] [2020-12-01 15:06:20,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:06:20,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:06:20,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561064286] [2020-12-01 15:06:20,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:06:20,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:06:20,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:06:20,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:06:20,445 INFO L87 Difference]: Start difference. First operand 1315 states and 4223 transitions. Second operand 7 states. [2020-12-01 15:06:20,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:06:20,546 INFO L93 Difference]: Finished difference Result 1284 states and 4159 transitions. [2020-12-01 15:06:20,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:06:20,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-12-01 15:06:20,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:06:20,553 INFO L225 Difference]: With dead ends: 1284 [2020-12-01 15:06:20,553 INFO L226 Difference]: Without dead ends: 1265 [2020-12-01 15:06:20,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:06:20,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2020-12-01 15:06:20,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2020-12-01 15:06:20,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2020-12-01 15:06:20,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 4123 transitions. [2020-12-01 15:06:20,610 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 4123 transitions. Word has length 25 [2020-12-01 15:06:20,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:06:20,611 INFO L481 AbstractCegarLoop]: Abstraction has 1265 states and 4123 transitions. [2020-12-01 15:06:20,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:06:20,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 4123 transitions. [2020-12-01 15:06:20,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-01 15:06:20,618 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:06:20,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:06:20,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-01 15:06:20,619 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:06:20,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:06:20,620 INFO L82 PathProgramCache]: Analyzing trace with hash -51219955, now seen corresponding path program 1 times [2020-12-01 15:06:20,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:06:20,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320752829] [2020-12-01 15:06:20,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:06:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:06:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:06:20,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320752829] [2020-12-01 15:06:20,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:06:20,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:06:20,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663062375] [2020-12-01 15:06:20,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:06:20,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:06:20,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:06:20,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:06:20,767 INFO L87 Difference]: Start difference. First operand 1265 states and 4123 transitions. Second operand 4 states. [2020-12-01 15:06:20,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:06:20,802 INFO L93 Difference]: Finished difference Result 1867 states and 5983 transitions. [2020-12-01 15:06:20,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:06:20,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-12-01 15:06:20,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:06:20,808 INFO L225 Difference]: With dead ends: 1867 [2020-12-01 15:06:20,808 INFO L226 Difference]: Without dead ends: 865 [2020-12-01 15:06:20,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:06:20,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2020-12-01 15:06:20,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2020-12-01 15:06:20,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2020-12-01 15:06:20,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 2651 transitions. [2020-12-01 15:06:20,847 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 2651 transitions. Word has length 29 [2020-12-01 15:06:20,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:06:20,847 INFO L481 AbstractCegarLoop]: Abstraction has 865 states and 2651 transitions. [2020-12-01 15:06:20,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:06:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 2651 transitions. [2020-12-01 15:06:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-01 15:06:20,852 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:06:20,852 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:06:20,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-01 15:06:20,852 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:06:20,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:06:20,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1173444947, now seen corresponding path program 2 times [2020-12-01 15:06:20,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:06:20,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344393046] [2020-12-01 15:06:20,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:06:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:06:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:06:21,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344393046] [2020-12-01 15:06:21,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:06:21,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:06:21,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978325493] [2020-12-01 15:06:21,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 15:06:21,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:06:21,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 15:06:21,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:06:21,245 INFO L87 Difference]: Start difference. First operand 865 states and 2651 transitions. Second operand 8 states. [2020-12-01 15:06:21,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:06:21,515 INFO L93 Difference]: Finished difference Result 1488 states and 4429 transitions. [2020-12-01 15:06:21,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:06:21,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-12-01 15:06:21,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:06:21,520 INFO L225 Difference]: With dead ends: 1488 [2020-12-01 15:06:21,520 INFO L226 Difference]: Without dead ends: 1154 [2020-12-01 15:06:21,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-01 15:06:21,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2020-12-01 15:06:21,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 865. [2020-12-01 15:06:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2020-12-01 15:06:21,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 2551 transitions. [2020-12-01 15:06:21,558 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 2551 transitions. Word has length 29 [2020-12-01 15:06:21,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:06:21,559 INFO L481 AbstractCegarLoop]: Abstraction has 865 states and 2551 transitions. [2020-12-01 15:06:21,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 15:06:21,560 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 2551 transitions. [2020-12-01 15:06:21,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-01 15:06:21,565 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:06:21,566 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:06:21,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-01 15:06:21,566 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:06:21,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:06:21,567 INFO L82 PathProgramCache]: Analyzing trace with hash 2119321983, now seen corresponding path program 3 times [2020-12-01 15:06:21,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:06:21,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717806931] [2020-12-01 15:06:21,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:06:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:06:21,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:06:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:06:21,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:06:21,880 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:06:21,881 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-01 15:06:21,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-01 15:06:22,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:06:22 BasicIcfg [2020-12-01 15:06:22,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-01 15:06:22,069 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 15:06:22,069 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 15:06:22,070 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 15:06:22,070 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:06:04" (3/4) ... [2020-12-01 15:06:22,072 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 15:06:22,246 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_46fd7cbd-2885-4d36-be1c-97fd2acec4e0/bin/uautomizer/witness.graphml [2020-12-01 15:06:22,247 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 15:06:22,248 INFO L168 Benchmark]: Toolchain (without parser) took 22352.74 ms. Allocated memory was 117.4 MB in the beginning and 620.8 MB in the end (delta: 503.3 MB). Free memory was 83.4 MB in the beginning and 513.1 MB in the end (delta: -429.6 MB). Peak memory consumption was 296.0 MB. Max. memory is 16.1 GB. [2020-12-01 15:06:22,248 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 75.5 MB. Free memory was 36.1 MB in the beginning and 36.1 MB in the end (delta: 37.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:06:22,249 INFO L168 Benchmark]: CACSL2BoogieTranslator took 899.64 ms. Allocated memory is still 117.4 MB. Free memory was 83.2 MB in the beginning and 68.0 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-01 15:06:22,249 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.87 ms. Allocated memory is still 117.4 MB. Free memory was 68.0 MB in the beginning and 65.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:06:22,249 INFO L168 Benchmark]: Boogie Preprocessor took 92.19 ms. Allocated memory is still 117.4 MB. Free memory was 65.3 MB in the beginning and 62.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:06:22,250 INFO L168 Benchmark]: RCFGBuilder took 3151.24 ms. Allocated memory was 117.4 MB in the beginning and 153.1 MB in the end (delta: 35.7 MB). Free memory was 62.9 MB in the beginning and 107.2 MB in the end (delta: -44.2 MB). Peak memory consumption was 62.7 MB. Max. memory is 16.1 GB. [2020-12-01 15:06:22,250 INFO L168 Benchmark]: TraceAbstraction took 17921.74 ms. Allocated memory was 153.1 MB in the beginning and 620.8 MB in the end (delta: 467.7 MB). Free memory was 107.2 MB in the beginning and 298.1 MB in the end (delta: -191.0 MB). Peak memory consumption was 277.8 MB. Max. memory is 16.1 GB. [2020-12-01 15:06:22,251 INFO L168 Benchmark]: Witness Printer took 177.52 ms. Allocated memory is still 620.8 MB. Free memory was 298.1 MB in the beginning and 513.1 MB in the end (delta: -215.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-01 15:06:22,254 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.28 ms. Allocated memory is still 75.5 MB. Free memory was 36.1 MB in the beginning and 36.1 MB in the end (delta: 37.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 899.64 ms. Allocated memory is still 117.4 MB. Free memory was 83.2 MB in the beginning and 68.0 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 102.87 ms. Allocated memory is still 117.4 MB. Free memory was 68.0 MB in the beginning and 65.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 92.19 ms. Allocated memory is still 117.4 MB. Free memory was 65.3 MB in the beginning and 62.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3151.24 ms. Allocated memory was 117.4 MB in the beginning and 153.1 MB in the end (delta: 35.7 MB). Free memory was 62.9 MB in the beginning and 107.2 MB in the end (delta: -44.2 MB). Peak memory consumption was 62.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17921.74 ms. Allocated memory was 153.1 MB in the beginning and 620.8 MB in the end (delta: 467.7 MB). Free memory was 107.2 MB in the beginning and 298.1 MB in the end (delta: -191.0 MB). Peak memory consumption was 277.8 MB. Max. memory is 16.1 GB. * Witness Printer took 177.52 ms. Allocated memory is still 620.8 MB. Free memory was 298.1 MB in the beginning and 513.1 MB in the end (delta: -215.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2363 VarBasedMoverChecksPositive, 120 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 89 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.3s, 273 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.2s, 134 PlacesBefore, 48 PlacesAfterwards, 124 TransitionsBefore, 36 TransitionsAfterwards, 3134 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 107 TotalNumberOfCompositions, 10058 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t177; [L872] FCALL, FORK 0 pthread_create(&t177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t178; [L874] FCALL, FORK 0 pthread_create(&t178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L875] 0 pthread_t t179; [L876] FCALL, FORK 0 pthread_create(&t179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L877] 0 pthread_t t180; [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L878] FCALL, FORK 0 pthread_create(&t180, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L830] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, z=1] [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix007_power.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 122 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.5s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.6s, HoareTripleCheckerStatistics: 361 SDtfs, 455 SDslu, 752 SDs, 0 SdLazy, 263 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5834occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 289 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 193 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 17339 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...