./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 96f16385 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef64d1aae1f19ee0d65ae01134651161f15b9356 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-96f1638 [2020-12-02 11:49:43,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 11:49:43,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 11:49:43,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 11:49:43,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 11:49:43,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 11:49:43,535 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 11:49:43,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 11:49:43,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 11:49:43,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 11:49:43,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 11:49:43,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 11:49:43,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 11:49:43,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 11:49:43,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 11:49:43,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 11:49:43,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 11:49:43,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 11:49:43,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 11:49:43,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 11:49:43,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 11:49:43,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 11:49:43,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 11:49:43,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 11:49:43,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 11:49:43,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 11:49:43,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 11:49:43,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 11:49:43,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 11:49:43,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 11:49:43,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 11:49:43,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 11:49:43,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 11:49:43,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 11:49:43,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 11:49:43,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 11:49:43,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 11:49:43,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 11:49:43,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 11:49:43,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 11:49:43,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 11:49:43,610 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 11:49:43,673 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 11:49:43,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 11:49:43,675 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 11:49:43,675 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 11:49:43,676 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 11:49:43,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 11:49:43,676 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 11:49:43,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 11:49:43,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 11:49:43,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 11:49:43,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 11:49:43,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 11:49:43,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 11:49:43,677 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 11:49:43,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 11:49:43,678 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 11:49:43,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 11:49:43,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 11:49:43,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 11:49:43,680 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 11:49:43,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 11:49:43,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 11:49:43,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 11:49:43,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 11:49:43,681 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 11:49:43,681 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 11:49:43,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 11:49:43,682 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 11:49:43,682 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 11:49:43,682 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef64d1aae1f19ee0d65ae01134651161f15b9356 [2020-12-02 11:49:44,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 11:49:44,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 11:49:44,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 11:49:44,102 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 11:49:44,103 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 11:49:44,104 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i [2020-12-02 11:49:44,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cd4d647a/d8733cdf617c4bc4ad9ec96d2e0dad46/FLAGf62216e63 [2020-12-02 11:49:44,833 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 11:49:44,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i [2020-12-02 11:49:44,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cd4d647a/d8733cdf617c4bc4ad9ec96d2e0dad46/FLAGf62216e63 [2020-12-02 11:49:45,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cd4d647a/d8733cdf617c4bc4ad9ec96d2e0dad46 [2020-12-02 11:49:45,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 11:49:45,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 11:49:45,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 11:49:45,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 11:49:45,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 11:49:45,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:49:45" (1/1) ... [2020-12-02 11:49:45,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@316a923f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:45, skipping insertion in model container [2020-12-02 11:49:45,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:49:45" (1/1) ... [2020-12-02 11:49:45,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 11:49:45,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 11:49:45,457 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i[949,962] [2020-12-02 11:49:45,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 11:49:45,731 INFO L203 MainTranslator]: Completed pre-run [2020-12-02 11:49:45,746 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i[949,962] [2020-12-02 11:49:45,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 11:49:45,912 INFO L208 MainTranslator]: Completed translation [2020-12-02 11:49:45,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:45 WrapperNode [2020-12-02 11:49:45,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 11:49:45,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 11:49:45,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 11:49:45,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 11:49:45,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:45" (1/1) ... [2020-12-02 11:49:45,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:45" (1/1) ... [2020-12-02 11:49:45,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 11:49:45,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 11:49:45,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 11:49:45,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 11:49:45,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:45" (1/1) ... [2020-12-02 11:49:45,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:45" (1/1) ... [2020-12-02 11:49:45,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:45" (1/1) ... [2020-12-02 11:49:45,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:45" (1/1) ... [2020-12-02 11:49:46,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:45" (1/1) ... [2020-12-02 11:49:46,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:45" (1/1) ... [2020-12-02 11:49:46,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:45" (1/1) ... [2020-12-02 11:49:46,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 11:49:46,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 11:49:46,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 11:49:46,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 11:49:46,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 11:49:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-02 11:49:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-02 11:49:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 11:49:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 11:49:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-02 11:49:46,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-02 11:49:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-02 11:49:46,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-02 11:49:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-02 11:49:46,141 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-02 11:49:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 11:49:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-02 11:49:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 11:49:46,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 11:49:46,143 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-02 11:49:48,251 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 11:49:48,252 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-02 11:49:48,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:49:48 BoogieIcfgContainer [2020-12-02 11:49:48,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 11:49:48,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 11:49:48,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 11:49:48,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 11:49:48,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:49:45" (1/3) ... [2020-12-02 11:49:48,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a0b065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:49:48, skipping insertion in model container [2020-12-02 11:49:48,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:45" (2/3) ... [2020-12-02 11:49:48,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a0b065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:49:48, skipping insertion in model container [2020-12-02 11:49:48,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:49:48" (3/3) ... [2020-12-02 11:49:48,264 INFO L111 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2020-12-02 11:49:48,283 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-02 11:49:48,284 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 11:49:48,288 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-02 11:49:48,289 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-02 11:49:48,333 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,333 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,333 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,333 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,333 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,334 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,334 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,344 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,344 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,345 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,345 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,346 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,346 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,346 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,347 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,352 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,352 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,353 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,353 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,366 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,366 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,368 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,368 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,368 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,371 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,371 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:49:48,374 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-02 11:49:48,387 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-02 11:49:48,408 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 11:49:48,408 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 11:49:48,409 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 11:49:48,409 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 11:49:48,409 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 11:49:48,409 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 11:49:48,409 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 11:49:48,409 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 11:49:48,422 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-02 11:49:48,424 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 223 flow [2020-12-02 11:49:48,427 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 223 flow [2020-12-02 11:49:48,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 223 flow [2020-12-02 11:49:48,479 INFO L129 PetriNetUnfolder]: 2/101 cut-off events. [2020-12-02 11:49:48,480 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-02 11:49:48,485 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-12-02 11:49:48,489 INFO L116 LiptonReduction]: Number of co-enabled transitions 1954 [2020-12-02 11:49:48,754 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:49:48,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:48,760 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:49:48,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:48,870 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:49:48,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:48,873 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:49:48,874 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:48,988 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:49:48,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:48,993 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:49:48,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:49,048 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:49:49,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:49,051 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:49:49,051 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:49,300 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:49,303 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:49,312 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:49,316 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:49,351 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:49,354 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:49,364 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:49,370 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,372 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:49,615 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:49,617 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:49,620 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:49,623 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:49,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:49,647 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:49,650 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:49,653 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:49,770 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:49,772 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:49,777 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:49,781 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:49,805 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:49,807 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:49,809 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:49,812 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:49,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:50,166 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-02 11:49:50,740 WARN L197 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-02 11:49:50,907 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-02 11:49:51,283 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,284 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:51,285 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,285 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:51,288 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,288 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:51,290 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:51,316 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,316 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:51,317 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:51,320 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:51,322 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,323 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:51,395 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:51,397 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:51,400 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:51,407 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:51,442 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:51,443 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:51,451 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:51,454 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:51,890 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,891 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:51,891 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:51,895 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:51,902 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:51,925 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:51,926 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,927 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:51,929 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:51,931 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:51,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:52,206 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:49:52,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:52,208 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:49:52,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:52,246 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:49:52,247 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:52,247 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:49:52,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:52,405 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:52,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:52,407 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:52,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:52,409 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:52,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:52,411 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:52,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:52,432 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:52,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:52,433 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:52,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:52,435 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:52,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:52,438 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:52,438 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:52,535 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-02 11:49:52,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:52,583 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:49:52,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:52,584 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:49:52,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:52,622 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:49:52,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:52,624 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:49:52,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:52,664 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:49:52,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:52,666 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:49:52,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:52,694 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:49:52,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:52,696 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:49:52,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:52,760 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:52,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:52,761 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:52,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:52,763 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:52,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:52,766 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:52,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:52,783 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:52,784 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:52,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:52,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:52,787 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:52,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:52,788 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:52,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:53,097 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:53,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:53,098 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:53,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:53,101 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:53,101 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:53,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:53,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:53,125 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:53,126 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:53,127 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:53,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:53,129 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:53,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:53,131 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:53,132 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:53,159 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:53,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:53,161 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:53,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:53,163 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:53,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:53,165 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:53,165 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:53,185 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:53,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:53,186 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:53,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:53,188 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:53,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:53,190 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:53,191 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:54,271 WARN L197 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 232 DAG size of output: 192 [2020-12-02 11:49:55,256 WARN L197 SmtUtils]: Spent 983.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 189 [2020-12-02 11:49:57,526 WARN L197 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 316 DAG size of output: 272 [2020-12-02 11:49:58,529 WARN L197 SmtUtils]: Spent 1000.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2020-12-02 11:49:58,558 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:58,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:58,559 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:58,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:58,561 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:58,562 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:58,564 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:58,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:58,581 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:58,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:58,583 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:58,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:58,585 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:58,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:58,587 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:58,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:58,628 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:58,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:58,629 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:58,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:58,631 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:58,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:58,633 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:58,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:58,651 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:58,651 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:58,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:58,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:58,654 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:58,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:58,656 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:58,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:58,957 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-12-02 11:49:59,035 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:59,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:59,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:59,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:59,038 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:59,038 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:59,040 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:59,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:59,057 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:59,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:59,058 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:59,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:49:59,060 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:59,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:59,062 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:49:59,062 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:49:59,387 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:49:59,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:59,388 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:49:59,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:59,412 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:49:59,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:59,412 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:49:59,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:59,441 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:49:59,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:59,442 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:49:59,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:59,469 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:49:59,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:59,470 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:49:59,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:49:59,987 WARN L197 SmtUtils]: Spent 492.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2020-12-02 11:50:00,505 WARN L197 SmtUtils]: Spent 514.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2020-12-02 11:50:02,559 WARN L197 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 270 DAG size of output: 269 [2020-12-02 11:50:03,567 WARN L197 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 269 [2020-12-02 11:50:03,586 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:03,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,587 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:03,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,609 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:03,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,610 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:03,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,637 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:03,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:03,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,664 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:03,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,665 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:03,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,707 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:03,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,708 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:03,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,730 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:03,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,731 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:03,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,766 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:03,774 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,775 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:03,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,803 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:03,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,804 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:03,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,835 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:03,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,836 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:03,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,865 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:03,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,866 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:03,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,893 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:03,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,894 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:03,894 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,921 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:03,922 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:03,923 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:03,923 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:04,982 WARN L197 SmtUtils]: Spent 641.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2020-12-02 11:50:05,617 WARN L197 SmtUtils]: Spent 633.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2020-12-02 11:50:06,918 WARN L197 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 284 [2020-12-02 11:50:08,213 WARN L197 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 284 [2020-12-02 11:50:08,249 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:08,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:08,252 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:08,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:08,280 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:08,280 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:08,283 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:08,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:08,367 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:08,368 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:08,368 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:08,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:08,392 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:08,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:08,393 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:08,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:08,432 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:08,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:08,433 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:08,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:08,462 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:08,463 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:08,463 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:08,464 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:08,497 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:08,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:08,498 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:08,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:08,523 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:08,523 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:08,524 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:08,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:08,677 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-12-02 11:50:08,798 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-12-02 11:50:08,923 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-12-02 11:50:09,052 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-12-02 11:50:09,072 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:09,072 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,073 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:09,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,094 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:09,094 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,095 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:09,095 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,132 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:09,133 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,134 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:09,134 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,166 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:09,166 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,167 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:09,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,198 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:09,198 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,199 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:09,199 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,229 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:09,230 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,231 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:09,231 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,266 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:09,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,267 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:09,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,298 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:09,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,299 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:09,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,335 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:09,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,337 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:09,337 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,370 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:09,370 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,371 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:09,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,406 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:09,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,407 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:09,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,431 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:50:09,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,432 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:50:09,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:50:09,988 WARN L197 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-12-02 11:50:10,245 WARN L197 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-12-02 11:50:10,774 WARN L197 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-12-02 11:50:11,026 WARN L197 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-12-02 11:50:11,059 INFO L131 LiptonReduction]: Checked pairs total: 5777 [2020-12-02 11:50:11,060 INFO L133 LiptonReduction]: Total number of compositions: 86 [2020-12-02 11:50:11,069 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2020-12-02 11:50:11,169 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1132 states. [2020-12-02 11:50:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states. [2020-12-02 11:50:11,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-02 11:50:11,177 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:50:11,178 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-02 11:50:11,179 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:50:11,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:50:11,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1036550366, now seen corresponding path program 1 times [2020-12-02 11:50:11,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:50:11,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351448839] [2020-12-02 11:50:11,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:50:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:50:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:50:11,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351448839] [2020-12-02 11:50:11,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:50:11,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 11:50:11,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510744926] [2020-12-02 11:50:11,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 11:50:11,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:50:11,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 11:50:11,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:50:11,588 INFO L87 Difference]: Start difference. First operand 1132 states. Second operand 3 states. [2020-12-02 11:50:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:50:11,723 INFO L93 Difference]: Finished difference Result 972 states and 3118 transitions. [2020-12-02 11:50:11,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 11:50:11,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-02 11:50:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:50:11,764 INFO L225 Difference]: With dead ends: 972 [2020-12-02 11:50:11,765 INFO L226 Difference]: Without dead ends: 792 [2020-12-02 11:50:11,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:50:11,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2020-12-02 11:50:11,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2020-12-02 11:50:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-12-02 11:50:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2494 transitions. [2020-12-02 11:50:11,907 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 2494 transitions. Word has length 5 [2020-12-02 11:50:11,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:50:11,907 INFO L481 AbstractCegarLoop]: Abstraction has 792 states and 2494 transitions. [2020-12-02 11:50:11,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 11:50:11,908 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 2494 transitions. [2020-12-02 11:50:11,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-02 11:50:11,909 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:50:11,909 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:50:11,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 11:50:11,910 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:50:11,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:50:11,910 INFO L82 PathProgramCache]: Analyzing trace with hash 884169254, now seen corresponding path program 1 times [2020-12-02 11:50:11,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:50:11,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390592514] [2020-12-02 11:50:11,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:50:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:50:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:50:12,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390592514] [2020-12-02 11:50:12,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:50:12,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 11:50:12,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083453568] [2020-12-02 11:50:12,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 11:50:12,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:50:12,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 11:50:12,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:50:12,095 INFO L87 Difference]: Start difference. First operand 792 states and 2494 transitions. Second operand 3 states. [2020-12-02 11:50:12,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:50:12,111 INFO L93 Difference]: Finished difference Result 732 states and 2276 transitions. [2020-12-02 11:50:12,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 11:50:12,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-02 11:50:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:50:12,119 INFO L225 Difference]: With dead ends: 732 [2020-12-02 11:50:12,119 INFO L226 Difference]: Without dead ends: 732 [2020-12-02 11:50:12,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:50:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2020-12-02 11:50:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2020-12-02 11:50:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2020-12-02 11:50:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2276 transitions. [2020-12-02 11:50:12,151 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2276 transitions. Word has length 9 [2020-12-02 11:50:12,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:50:12,152 INFO L481 AbstractCegarLoop]: Abstraction has 732 states and 2276 transitions. [2020-12-02 11:50:12,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 11:50:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2276 transitions. [2020-12-02 11:50:12,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-02 11:50:12,155 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:50:12,155 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:50:12,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 11:50:12,156 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:50:12,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:50:12,156 INFO L82 PathProgramCache]: Analyzing trace with hash -211180187, now seen corresponding path program 1 times [2020-12-02 11:50:12,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:50:12,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003895623] [2020-12-02 11:50:12,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:50:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:50:12,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:50:12,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003895623] [2020-12-02 11:50:12,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:50:12,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 11:50:12,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086379200] [2020-12-02 11:50:12,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 11:50:12,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:50:12,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 11:50:12,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:50:12,300 INFO L87 Difference]: Start difference. First operand 732 states and 2276 transitions. Second operand 3 states. [2020-12-02 11:50:12,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:50:12,314 INFO L93 Difference]: Finished difference Result 692 states and 2134 transitions. [2020-12-02 11:50:12,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 11:50:12,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-02 11:50:12,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:50:12,321 INFO L225 Difference]: With dead ends: 692 [2020-12-02 11:50:12,321 INFO L226 Difference]: Without dead ends: 692 [2020-12-02 11:50:12,322 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:50:12,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2020-12-02 11:50:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2020-12-02 11:50:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2020-12-02 11:50:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 2134 transitions. [2020-12-02 11:50:12,346 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 2134 transitions. Word has length 11 [2020-12-02 11:50:12,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:50:12,346 INFO L481 AbstractCegarLoop]: Abstraction has 692 states and 2134 transitions. [2020-12-02 11:50:12,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 11:50:12,347 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 2134 transitions. [2020-12-02 11:50:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-02 11:50:12,350 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:50:12,350 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:50:12,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 11:50:12,350 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:50:12,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:50:12,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1080739887, now seen corresponding path program 1 times [2020-12-02 11:50:12,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:50:12,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247801188] [2020-12-02 11:50:12,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:50:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:50:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:50:12,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247801188] [2020-12-02 11:50:12,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:50:12,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 11:50:12,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656708751] [2020-12-02 11:50:12,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 11:50:12,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:50:12,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 11:50:12,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:50:12,485 INFO L87 Difference]: Start difference. First operand 692 states and 2134 transitions. Second operand 5 states. [2020-12-02 11:50:12,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:50:12,569 INFO L93 Difference]: Finished difference Result 684 states and 2102 transitions. [2020-12-02 11:50:12,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 11:50:12,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-02 11:50:12,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:50:12,576 INFO L225 Difference]: With dead ends: 684 [2020-12-02 11:50:12,576 INFO L226 Difference]: Without dead ends: 684 [2020-12-02 11:50:12,576 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:50:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2020-12-02 11:50:12,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2020-12-02 11:50:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2020-12-02 11:50:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 2102 transitions. [2020-12-02 11:50:12,600 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 2102 transitions. Word has length 13 [2020-12-02 11:50:12,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:50:12,601 INFO L481 AbstractCegarLoop]: Abstraction has 684 states and 2102 transitions. [2020-12-02 11:50:12,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 11:50:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 2102 transitions. [2020-12-02 11:50:12,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 11:50:12,603 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:50:12,603 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:50:12,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-02 11:50:12,604 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:50:12,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:50:12,604 INFO L82 PathProgramCache]: Analyzing trace with hash -2070743406, now seen corresponding path program 1 times [2020-12-02 11:50:12,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:50:12,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473883117] [2020-12-02 11:50:12,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:50:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:50:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:50:12,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473883117] [2020-12-02 11:50:12,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:50:12,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:50:12,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811799646] [2020-12-02 11:50:12,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:50:12,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:50:12,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:50:12,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:50:12,817 INFO L87 Difference]: Start difference. First operand 684 states and 2102 transitions. Second operand 6 states. [2020-12-02 11:50:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:50:12,927 INFO L93 Difference]: Finished difference Result 754 states and 2340 transitions. [2020-12-02 11:50:12,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:50:12,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-02 11:50:12,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:50:12,934 INFO L225 Difference]: With dead ends: 754 [2020-12-02 11:50:12,935 INFO L226 Difference]: Without dead ends: 754 [2020-12-02 11:50:12,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:50:12,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2020-12-02 11:50:12,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2020-12-02 11:50:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2020-12-02 11:50:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 2340 transitions. [2020-12-02 11:50:12,961 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 2340 transitions. Word has length 15 [2020-12-02 11:50:12,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:50:12,962 INFO L481 AbstractCegarLoop]: Abstraction has 754 states and 2340 transitions. [2020-12-02 11:50:12,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:50:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 2340 transitions. [2020-12-02 11:50:12,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 11:50:12,964 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:50:12,964 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:50:12,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-02 11:50:12,965 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:50:12,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:50:12,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1579458194, now seen corresponding path program 2 times [2020-12-02 11:50:12,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:50:12,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834236701] [2020-12-02 11:50:12,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:50:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:50:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:50:13,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834236701] [2020-12-02 11:50:13,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:50:13,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:50:13,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857639699] [2020-12-02 11:50:13,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:50:13,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:50:13,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:50:13,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:50:13,078 INFO L87 Difference]: Start difference. First operand 754 states and 2340 transitions. Second operand 6 states. [2020-12-02 11:50:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:50:13,193 INFO L93 Difference]: Finished difference Result 904 states and 2787 transitions. [2020-12-02 11:50:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:50:13,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-02 11:50:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:50:13,202 INFO L225 Difference]: With dead ends: 904 [2020-12-02 11:50:13,202 INFO L226 Difference]: Without dead ends: 904 [2020-12-02 11:50:13,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:50:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2020-12-02 11:50:13,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 864. [2020-12-02 11:50:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2020-12-02 11:50:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 2663 transitions. [2020-12-02 11:50:13,233 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 2663 transitions. Word has length 15 [2020-12-02 11:50:13,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:50:13,234 INFO L481 AbstractCegarLoop]: Abstraction has 864 states and 2663 transitions. [2020-12-02 11:50:13,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:50:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 2663 transitions. [2020-12-02 11:50:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 11:50:13,236 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:50:13,237 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:50:13,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-02 11:50:13,237 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:50:13,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:50:13,238 INFO L82 PathProgramCache]: Analyzing trace with hash 899492516, now seen corresponding path program 3 times [2020-12-02 11:50:13,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:50:13,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689324496] [2020-12-02 11:50:13,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:50:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:50:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:50:13,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689324496] [2020-12-02 11:50:13,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:50:13,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:50:13,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508948654] [2020-12-02 11:50:13,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:50:13,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:50:13,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:50:13,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:50:13,391 INFO L87 Difference]: Start difference. First operand 864 states and 2663 transitions. Second operand 6 states. [2020-12-02 11:50:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:50:13,531 INFO L93 Difference]: Finished difference Result 930 states and 2850 transitions. [2020-12-02 11:50:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 11:50:13,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-02 11:50:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:50:13,540 INFO L225 Difference]: With dead ends: 930 [2020-12-02 11:50:13,540 INFO L226 Difference]: Without dead ends: 930 [2020-12-02 11:50:13,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 11:50:13,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2020-12-02 11:50:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 858. [2020-12-02 11:50:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2020-12-02 11:50:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 2615 transitions. [2020-12-02 11:50:13,571 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 2615 transitions. Word has length 15 [2020-12-02 11:50:13,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:50:13,572 INFO L481 AbstractCegarLoop]: Abstraction has 858 states and 2615 transitions. [2020-12-02 11:50:13,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:50:13,572 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 2615 transitions. [2020-12-02 11:50:13,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 11:50:13,593 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:50:13,593 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:50:13,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-02 11:50:13,594 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:50:13,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:50:13,595 INFO L82 PathProgramCache]: Analyzing trace with hash -382761454, now seen corresponding path program 1 times [2020-12-02 11:50:13,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:50:13,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77545899] [2020-12-02 11:50:13,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:50:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:50:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:50:13,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77545899] [2020-12-02 11:50:13,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:50:13,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 11:50:13,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450339572] [2020-12-02 11:50:13,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 11:50:13,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:50:13,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 11:50:13,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:50:13,672 INFO L87 Difference]: Start difference. First operand 858 states and 2615 transitions. Second operand 4 states. [2020-12-02 11:50:13,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:50:13,720 INFO L93 Difference]: Finished difference Result 822 states and 2229 transitions. [2020-12-02 11:50:13,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:50:13,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-02 11:50:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:50:13,725 INFO L225 Difference]: With dead ends: 822 [2020-12-02 11:50:13,725 INFO L226 Difference]: Without dead ends: 588 [2020-12-02 11:50:13,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:50:13,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-12-02 11:50:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2020-12-02 11:50:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-12-02 11:50:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1535 transitions. [2020-12-02 11:50:13,744 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1535 transitions. Word has length 15 [2020-12-02 11:50:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:50:13,744 INFO L481 AbstractCegarLoop]: Abstraction has 588 states and 1535 transitions. [2020-12-02 11:50:13,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 11:50:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1535 transitions. [2020-12-02 11:50:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 11:50:13,746 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:50:13,746 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:50:13,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-02 11:50:13,746 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:50:13,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:50:13,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1106901571, now seen corresponding path program 1 times [2020-12-02 11:50:13,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:50:13,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190140640] [2020-12-02 11:50:13,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:50:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:50:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:50:13,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190140640] [2020-12-02 11:50:13,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:50:13,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:50:13,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006943208] [2020-12-02 11:50:13,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 11:50:13,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:50:13,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 11:50:13,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:50:13,827 INFO L87 Difference]: Start difference. First operand 588 states and 1535 transitions. Second operand 5 states. [2020-12-02 11:50:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:50:13,879 INFO L93 Difference]: Finished difference Result 482 states and 1178 transitions. [2020-12-02 11:50:13,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 11:50:13,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-02 11:50:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:50:13,882 INFO L225 Difference]: With dead ends: 482 [2020-12-02 11:50:13,883 INFO L226 Difference]: Without dead ends: 371 [2020-12-02 11:50:13,883 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-02 11:50:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2020-12-02 11:50:13,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 317. [2020-12-02 11:50:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2020-12-02 11:50:13,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 749 transitions. [2020-12-02 11:50:13,893 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 749 transitions. Word has length 16 [2020-12-02 11:50:13,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:50:13,893 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 749 transitions. [2020-12-02 11:50:13,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 11:50:13,894 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 749 transitions. [2020-12-02 11:50:13,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 11:50:13,895 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:50:13,895 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:50:13,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-02 11:50:13,895 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:50:13,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:50:13,896 INFO L82 PathProgramCache]: Analyzing trace with hash 873226775, now seen corresponding path program 1 times [2020-12-02 11:50:13,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:50:13,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075445607] [2020-12-02 11:50:13,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:50:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:50:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:50:13,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075445607] [2020-12-02 11:50:13,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:50:13,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 11:50:13,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018872937] [2020-12-02 11:50:13,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:50:13,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:50:13,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:50:13,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:50:13,994 INFO L87 Difference]: Start difference. First operand 317 states and 749 transitions. Second operand 6 states. [2020-12-02 11:50:14,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:50:14,049 INFO L93 Difference]: Finished difference Result 290 states and 693 transitions. [2020-12-02 11:50:14,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 11:50:14,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-02 11:50:14,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:50:14,052 INFO L225 Difference]: With dead ends: 290 [2020-12-02 11:50:14,052 INFO L226 Difference]: Without dead ends: 271 [2020-12-02 11:50:14,052 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-02 11:50:14,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-12-02 11:50:14,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 255. [2020-12-02 11:50:14,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2020-12-02 11:50:14,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 625 transitions. [2020-12-02 11:50:14,060 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 625 transitions. Word has length 19 [2020-12-02 11:50:14,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:50:14,061 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 625 transitions. [2020-12-02 11:50:14,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:50:14,061 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 625 transitions. [2020-12-02 11:50:14,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 11:50:14,062 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:50:14,062 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] [2020-12-02 11:50:14,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-02 11:50:14,063 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:50:14,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:50:14,064 INFO L82 PathProgramCache]: Analyzing trace with hash 773897350, now seen corresponding path program 1 times [2020-12-02 11:50:14,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:50:14,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644378990] [2020-12-02 11:50:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:50:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:50:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:50:14,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644378990] [2020-12-02 11:50:14,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:50:14,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 11:50:14,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140450313] [2020-12-02 11:50:14,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 11:50:14,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:50:14,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 11:50:14,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:50:14,165 INFO L87 Difference]: Start difference. First operand 255 states and 625 transitions. Second operand 4 states. [2020-12-02 11:50:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:50:14,189 INFO L93 Difference]: Finished difference Result 329 states and 789 transitions. [2020-12-02 11:50:14,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 11:50:14,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-12-02 11:50:14,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:50:14,191 INFO L225 Difference]: With dead ends: 329 [2020-12-02 11:50:14,191 INFO L226 Difference]: Without dead ends: 127 [2020-12-02 11:50:14,192 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:50:14,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-12-02 11:50:14,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-12-02 11:50:14,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-12-02 11:50:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 269 transitions. [2020-12-02 11:50:14,196 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 269 transitions. Word has length 23 [2020-12-02 11:50:14,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:50:14,196 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 269 transitions. [2020-12-02 11:50:14,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 11:50:14,197 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 269 transitions. [2020-12-02 11:50:14,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 11:50:14,198 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:50:14,198 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] [2020-12-02 11:50:14,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-02 11:50:14,198 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:50:14,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:50:14,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1590710776, now seen corresponding path program 2 times [2020-12-02 11:50:14,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:50:14,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802053266] [2020-12-02 11:50:14,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:50:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:50:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:50:14,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802053266] [2020-12-02 11:50:14,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:50:14,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 11:50:14,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38942174] [2020-12-02 11:50:14,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 11:50:14,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:50:14,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 11:50:14,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-02 11:50:14,582 INFO L87 Difference]: Start difference. First operand 127 states and 269 transitions. Second operand 9 states. [2020-12-02 11:50:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:50:14,821 INFO L93 Difference]: Finished difference Result 147 states and 304 transitions. [2020-12-02 11:50:14,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 11:50:14,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-12-02 11:50:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:50:14,823 INFO L225 Difference]: With dead ends: 147 [2020-12-02 11:50:14,823 INFO L226 Difference]: Without dead ends: 105 [2020-12-02 11:50:14,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-12-02 11:50:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-12-02 11:50:14,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-12-02 11:50:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-12-02 11:50:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 217 transitions. [2020-12-02 11:50:14,827 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 217 transitions. Word has length 23 [2020-12-02 11:50:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:50:14,828 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 217 transitions. [2020-12-02 11:50:14,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 11:50:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 217 transitions. [2020-12-02 11:50:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 11:50:14,829 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:50:14,829 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] [2020-12-02 11:50:14,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-02 11:50:14,829 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:50:14,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:50:14,830 INFO L82 PathProgramCache]: Analyzing trace with hash 621053640, now seen corresponding path program 3 times [2020-12-02 11:50:14,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:50:14,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310112369] [2020-12-02 11:50:14,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:50:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 11:50:14,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 11:50:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 11:50:14,940 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 11:50:14,980 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 11:50:14,981 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 11:50:14,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-02 11:50:15,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:50:15 BasicIcfg [2020-12-02 11:50:15,076 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 11:50:15,076 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 11:50:15,077 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 11:50:15,079 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 11:50:15,080 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:49:48" (3/4) ... [2020-12-02 11:50:15,083 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-02 11:50:15,220 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 11:50:15,221 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 11:50:15,222 INFO L168 Benchmark]: Toolchain (without parser) took 30087.58 ms. Allocated memory was 52.4 MB in the beginning and 226.5 MB in the end (delta: 174.1 MB). Free memory was 28.1 MB in the beginning and 69.9 MB in the end (delta: -41.7 MB). Peak memory consumption was 134.3 MB. Max. memory is 16.1 GB. [2020-12-02 11:50:15,222 INFO L168 Benchmark]: CDTParser took 0.70 ms. Allocated memory is still 52.4 MB. Free memory is still 37.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 11:50:15,223 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.23 ms. Allocated memory was 52.4 MB in the beginning and 65.0 MB in the end (delta: 12.6 MB). Free memory was 28.0 MB in the beginning and 42.9 MB in the end (delta: -14.9 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. [2020-12-02 11:50:15,223 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.96 ms. Allocated memory is still 65.0 MB. Free memory was 42.9 MB in the beginning and 39.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-02 11:50:15,225 INFO L168 Benchmark]: Boogie Preprocessor took 43.24 ms. Allocated memory is still 65.0 MB. Free memory was 39.9 MB in the beginning and 37.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 11:50:15,225 INFO L168 Benchmark]: RCFGBuilder took 2228.87 ms. Allocated memory was 65.0 MB in the beginning and 96.5 MB in the end (delta: 31.5 MB). Free memory was 37.5 MB in the beginning and 57.2 MB in the end (delta: -19.7 MB). Peak memory consumption was 33.8 MB. Max. memory is 16.1 GB. [2020-12-02 11:50:15,226 INFO L168 Benchmark]: TraceAbstraction took 26818.40 ms. Allocated memory was 96.5 MB in the beginning and 226.5 MB in the end (delta: 130.0 MB). Free memory was 56.5 MB in the beginning and 84.6 MB in the end (delta: -28.1 MB). Peak memory consumption was 101.7 MB. Max. memory is 16.1 GB. [2020-12-02 11:50:15,226 INFO L168 Benchmark]: Witness Printer took 144.36 ms. Allocated memory is still 226.5 MB. Free memory was 84.6 MB in the beginning and 69.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-02 11:50:15,230 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.70 ms. Allocated memory is still 52.4 MB. Free memory is still 37.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 774.23 ms. Allocated memory was 52.4 MB in the beginning and 65.0 MB in the end (delta: 12.6 MB). Free memory was 28.0 MB in the beginning and 42.9 MB in the end (delta: -14.9 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 66.96 ms. Allocated memory is still 65.0 MB. Free memory was 42.9 MB in the beginning and 39.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 43.24 ms. Allocated memory is still 65.0 MB. Free memory was 39.9 MB in the beginning and 37.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2228.87 ms. Allocated memory was 65.0 MB in the beginning and 96.5 MB in the end (delta: 31.5 MB). Free memory was 37.5 MB in the beginning and 57.2 MB in the end (delta: -19.7 MB). Peak memory consumption was 33.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 26818.40 ms. Allocated memory was 96.5 MB in the beginning and 226.5 MB in the end (delta: 130.0 MB). Free memory was 56.5 MB in the beginning and 84.6 MB in the end (delta: -28.1 MB). Peak memory consumption was 101.7 MB. Max. memory is 16.1 GB. * Witness Printer took 144.36 ms. Allocated memory is still 226.5 MB. Free memory was 84.6 MB in the beginning and 69.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1380 VarBasedMoverChecksPositive, 91 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 62 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.0s, 196 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 22.6s, 112 PlacesBefore, 38 PlacesAfterwards, 104 TransitionsBefore, 29 TransitionsAfterwards, 1954 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, 5777 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L724] 0 _Bool x$flush_delayed; [L725] 0 int x$mem_tmp; [L726] 0 _Bool x$r_buff0_thd0; [L727] 0 _Bool x$r_buff0_thd1; [L728] 0 _Bool x$r_buff0_thd2; [L729] 0 _Bool x$r_buff0_thd3; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$read_delayed; [L735] 0 int *x$read_delayed_var; [L736] 0 int x$w_buff0; [L737] 0 _Bool x$w_buff0_used; [L738] 0 int x$w_buff1; [L739] 0 _Bool x$w_buff1_used; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t299; [L836] FCALL, FORK 0 pthread_create(&t299, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t300; [L838] FCALL, FORK 0 pthread_create(&t300, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 2 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 2 y = 1 [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L839] 0 pthread_t t301; [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L840] FCALL, FORK 0 pthread_create(&t301, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L759] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L846] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L846] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L850] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L850] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 x$flush_delayed = weak$$choice2 [L856] 0 x$mem_tmp = x [L857] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L857] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L858] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L858] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L859] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L859] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L860] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L860] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L861] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L862] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L863] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L865] 0 x = x$flush_delayed ? x$mem_tmp : x [L866] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 103 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 26.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 22.7s, HoareTripleCheckerStatistics: 352 SDtfs, 418 SDslu, 606 SDs, 0 SdLazy, 303 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1132occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 182 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 19189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...