./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix019_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/mix019_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 1ef657fa515773a8cc83f63b217863a831eb9a81 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:51:39,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 11:51:39,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 11:51:39,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 11:51:39,109 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 11:51:39,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 11:51:39,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 11:51:39,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 11:51:39,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 11:51:39,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 11:51:39,120 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 11:51:39,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 11:51:39,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 11:51:39,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 11:51:39,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 11:51:39,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 11:51:39,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 11:51:39,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 11:51:39,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 11:51:39,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 11:51:39,135 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 11:51:39,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 11:51:39,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 11:51:39,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 11:51:39,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 11:51:39,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 11:51:39,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 11:51:39,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 11:51:39,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 11:51:39,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 11:51:39,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 11:51:39,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 11:51:39,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 11:51:39,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 11:51:39,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 11:51:39,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 11:51:39,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 11:51:39,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 11:51:39,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 11:51:39,157 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 11:51:39,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 11:51:39,172 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:51:39,224 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 11:51:39,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 11:51:39,227 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 11:51:39,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 11:51:39,228 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 11:51:39,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 11:51:39,228 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 11:51:39,228 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 11:51:39,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 11:51:39,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 11:51:39,230 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 11:51:39,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 11:51:39,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 11:51:39,230 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 11:51:39,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 11:51:39,231 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 11:51:39,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 11:51:39,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 11:51:39,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 11:51:39,232 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 11:51:39,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 11:51:39,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 11:51:39,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 11:51:39,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 11:51:39,233 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 11:51:39,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 11:51:39,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 11:51:39,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 11:51:39,234 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 11:51:39,234 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 -> 1ef657fa515773a8cc83f63b217863a831eb9a81 [2020-12-02 11:51:39,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 11:51:39,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 11:51:39,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 11:51:39,699 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 11:51:39,700 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 11:51:39,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i [2020-12-02 11:51:39,782 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/815074f4f/4653307a447c4742a6f2ed0096d04ce4/FLAG53d04f106 [2020-12-02 11:51:40,637 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 11:51:40,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i [2020-12-02 11:51:40,666 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/815074f4f/4653307a447c4742a6f2ed0096d04ce4/FLAG53d04f106 [2020-12-02 11:51:40,854 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/815074f4f/4653307a447c4742a6f2ed0096d04ce4 [2020-12-02 11:51:40,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 11:51:40,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 11:51:40,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 11:51:40,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 11:51:40,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 11:51:40,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:51:40" (1/1) ... [2020-12-02 11:51:40,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c5a41e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:40, skipping insertion in model container [2020-12-02 11:51:40,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:51:40" (1/1) ... [2020-12-02 11:51:40,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 11:51:40,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 11:51:41,140 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/mix019_tso.oepc.i[949,962] [2020-12-02 11:51:41,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 11:51:41,457 INFO L203 MainTranslator]: Completed pre-run [2020-12-02 11:51:41,472 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/mix019_tso.oepc.i[949,962] [2020-12-02 11:51:41,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 11:51:41,658 INFO L208 MainTranslator]: Completed translation [2020-12-02 11:51:41,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:41 WrapperNode [2020-12-02 11:51:41,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 11:51:41,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 11:51:41,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 11:51:41,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 11:51:41,678 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:51:41" (1/1) ... [2020-12-02 11:51:41,712 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:51:41" (1/1) ... [2020-12-02 11:51:41,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 11:51:41,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 11:51:41,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 11:51:41,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 11:51:41,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:41" (1/1) ... [2020-12-02 11:51:41,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:41" (1/1) ... [2020-12-02 11:51:41,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:41" (1/1) ... [2020-12-02 11:51:41,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:41" (1/1) ... [2020-12-02 11:51:41,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:41" (1/1) ... [2020-12-02 11:51:41,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:41" (1/1) ... [2020-12-02 11:51:41,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:41" (1/1) ... [2020-12-02 11:51:41,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 11:51:41,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 11:51:41,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 11:51:41,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 11:51:41,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:41" (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:51:41,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-02 11:51:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-02 11:51:41,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 11:51:41,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 11:51:41,948 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-02 11:51:41,948 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-02 11:51:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-02 11:51:41,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-02 11:51:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-02 11:51:41,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-02 11:51:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 11:51:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-02 11:51:41,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 11:51:41,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 11:51:41,953 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:51:44,578 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 11:51:44,578 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-02 11:51:44,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:51:44 BoogieIcfgContainer [2020-12-02 11:51:44,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 11:51:44,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 11:51:44,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 11:51:44,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 11:51:44,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:51:40" (1/3) ... [2020-12-02 11:51:44,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408a0d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:51:44, skipping insertion in model container [2020-12-02 11:51:44,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:51:41" (2/3) ... [2020-12-02 11:51:44,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408a0d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:51:44, skipping insertion in model container [2020-12-02 11:51:44,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:51:44" (3/3) ... [2020-12-02 11:51:44,591 INFO L111 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2020-12-02 11:51:44,609 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-02 11:51:44,609 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 11:51:44,614 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-02 11:51:44,615 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-02 11:51:44,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,662 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,662 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,663 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,664 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,670 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,671 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,671 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,672 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,672 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,673 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,673 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,674 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,680 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,680 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,681 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,681 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,686 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,686 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,686 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,687 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,692 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,692 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,694 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,695 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,695 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,699 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,700 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:51:44,705 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-02 11:51:44,719 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-02 11:51:44,760 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 11:51:44,760 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 11:51:44,760 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 11:51:44,760 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 11:51:44,761 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 11:51:44,761 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 11:51:44,761 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 11:51:44,761 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 11:51:44,776 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-02 11:51:44,779 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 100 transitions, 215 flow [2020-12-02 11:51:44,782 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 100 transitions, 215 flow [2020-12-02 11:51:44,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow [2020-12-02 11:51:44,836 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2020-12-02 11:51:44,837 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-02 11:51:44,842 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-12-02 11:51:44,846 INFO L116 LiptonReduction]: Number of co-enabled transitions 1770 [2020-12-02 11:51:45,009 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:45,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:45,011 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:45,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:45,144 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:45,144 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:45,153 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:45,153 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:45,204 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-02 11:51:45,204 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:45,210 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-02 11:51:45,210 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:45,212 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-02 11:51:45,212 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:45,291 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:45,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:45,293 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:45,294 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:45,348 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:45,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:45,351 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:45,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:45,498 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:45,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:45,501 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:45,501 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:45,505 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:45,505 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:51:45,510 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:51:45,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:51:45,555 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:45,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:45,558 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:45,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:45,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:51:45,562 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:51:45,565 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:51:45,566 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:51:45,733 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:45,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:45,735 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:45,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:45,740 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:45,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:51:45,747 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:51:45,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:51:45,792 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:45,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:45,795 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:45,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:45,800 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:45,801 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:51:45,803 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:45,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:51:45,925 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:45,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:45,927 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:45,927 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:45,933 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 11:51:45,933 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 11:51:45,937 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 11:51:45,938 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:46,016 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:46,017 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:46,029 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 11:51:46,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:46,031 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 11:51:46,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:46,035 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 11:51:46,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:51:46,038 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 11:51:46,039 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:51:46,041 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 11:51:46,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:51:46,047 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 11:51:46,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:46,049 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 11:51:46,050 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:46,055 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 11:51:46,055 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:46,168 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:46,168 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:46,169 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:46,173 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:46,211 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:46,212 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:46,212 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:46,213 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:46,516 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-12-02 11:51:46,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:46,517 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-12-02 11:51:46,517 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:46,574 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:46,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:46,575 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:46,580 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:47,847 WARN L197 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-12-02 11:51:48,361 WARN L197 SmtUtils]: Spent 508.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2020-12-02 11:51:50,709 WARN L197 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2020-12-02 11:51:51,735 WARN L197 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 265 [2020-12-02 11:51:52,068 WARN L197 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-02 11:51:52,182 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-02 11:51:52,702 WARN L197 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-02 11:51:52,905 WARN L197 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-02 11:51:53,557 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:53,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,559 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:53,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,618 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:53,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,620 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:53,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,694 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:53,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:53,697 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 11:51:53,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,699 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 11:51:53,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,703 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 11:51:53,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:51:53,705 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 11:51:53,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:51:53,707 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 11:51:53,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:51:53,711 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 11:51:53,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,715 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 11:51:53,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,717 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 11:51:53,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,782 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:53,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,784 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:53,784 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,787 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 11:51:53,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 11:51:53,790 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 11:51:53,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,865 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:53,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,867 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:53,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,902 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:53,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,904 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:53,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,946 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:53,947 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,948 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:53,949 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,985 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:53,985 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:53,986 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:53,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:54,030 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:54,031 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:54,032 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:54,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:54,083 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:54,083 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:54,084 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:54,085 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:54,149 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:54,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:54,157 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 11:51:54,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:54,158 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 11:51:54,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:54,162 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 11:51:54,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:51:54,165 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 11:51:54,165 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:51:54,167 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 11:51:54,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:51:54,170 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 11:51:54,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:54,172 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 11:51:54,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:54,174 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 11:51:54,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:54,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:54,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:54,241 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:54,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:54,244 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 11:51:54,245 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 11:51:54,248 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 11:51:54,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:54,614 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:54,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:54,615 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:54,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:54,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:54,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:54,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:54,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:54,722 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:54,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:54,724 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:54,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:54,726 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:54,727 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:51:54,729 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:51:54,729 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:51:54,767 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:54,767 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:54,768 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:54,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:54,770 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:54,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:51:54,773 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:51:54,773 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:51:54,840 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:54,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:54,842 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:54,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:54,844 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:54,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:51:54,847 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:51:54,848 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:51:54,870 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:54,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:54,872 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:54,874 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:54,876 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:51:54,876 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:51:54,879 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:51:54,879 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:51:55,124 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:55,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:55,126 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:55,126 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:55,149 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:55,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:55,150 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:55,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:55,385 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-02 11:51:55,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:51:55,412 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:55,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:55,414 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:55,415 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:55,451 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:55,451 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:55,452 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:55,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:55,485 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:55,485 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:55,486 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:55,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:55,510 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:55,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:55,511 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:55,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:55,817 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-02 11:51:55,940 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-02 11:51:56,174 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-02 11:51:56,403 WARN L197 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-02 11:51:56,424 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:56,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:56,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:56,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:56,446 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:56,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:56,448 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:56,448 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:56,480 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:56,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:56,481 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:56,482 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:56,512 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:56,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:56,513 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:56,514 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:56,620 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:56,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:56,621 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:56,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:56,665 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:51:56,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:56,666 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:51:56,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:51:56,897 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2020-12-02 11:51:58,816 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-12-02 11:51:58,983 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-12-02 11:51:59,165 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-12-02 11:51:59,329 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-12-02 11:51:59,848 WARN L197 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-12-02 11:52:00,088 WARN L197 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-12-02 11:52:00,637 WARN L197 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-12-02 11:52:00,875 WARN L197 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-12-02 11:52:00,882 INFO L131 LiptonReduction]: Checked pairs total: 5460 [2020-12-02 11:52:00,882 INFO L133 LiptonReduction]: Total number of compositions: 82 [2020-12-02 11:52:00,889 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2020-12-02 11:52:00,964 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1152 states. [2020-12-02 11:52:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states. [2020-12-02 11:52:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-02 11:52:00,973 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:52:00,974 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-02 11:52:00,974 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:52:00,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:52:00,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1024231947, now seen corresponding path program 1 times [2020-12-02 11:52:00,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:52:00,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481691541] [2020-12-02 11:52:00,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:52:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:52:01,345 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:52:01,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481691541] [2020-12-02 11:52:01,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:52:01,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 11:52:01,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807152005] [2020-12-02 11:52:01,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 11:52:01,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:52:01,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 11:52:01,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:52:01,372 INFO L87 Difference]: Start difference. First operand 1152 states. Second operand 3 states. [2020-12-02 11:52:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:52:01,481 INFO L93 Difference]: Finished difference Result 962 states and 3090 transitions. [2020-12-02 11:52:01,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 11:52:01,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-02 11:52:01,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:52:01,528 INFO L225 Difference]: With dead ends: 962 [2020-12-02 11:52:01,528 INFO L226 Difference]: Without dead ends: 812 [2020-12-02 11:52:01,529 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:52:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-12-02 11:52:01,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2020-12-02 11:52:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-12-02 11:52:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2020-12-02 11:52:01,685 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 5 [2020-12-02 11:52:01,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:52:01,685 INFO L481 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2020-12-02 11:52:01,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 11:52:01,685 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2020-12-02 11:52:01,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-02 11:52:01,688 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:52:01,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:52:01,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 11:52:01,689 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:52:01,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:52:01,693 INFO L82 PathProgramCache]: Analyzing trace with hash -73905987, now seen corresponding path program 1 times [2020-12-02 11:52:01,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:52:01,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127215879] [2020-12-02 11:52:01,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:52:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:52:01,940 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:52:01,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127215879] [2020-12-02 11:52:01,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:52:01,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 11:52:01,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141005053] [2020-12-02 11:52:01,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 11:52:01,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:52:01,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 11:52:01,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:52:01,944 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand 4 states. [2020-12-02 11:52:02,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:52:02,012 INFO L93 Difference]: Finished difference Result 862 states and 2630 transitions. [2020-12-02 11:52:02,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:52:02,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-02 11:52:02,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:52:02,019 INFO L225 Difference]: With dead ends: 862 [2020-12-02 11:52:02,020 INFO L226 Difference]: Without dead ends: 712 [2020-12-02 11:52:02,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:52:02,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2020-12-02 11:52:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2020-12-02 11:52:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2020-12-02 11:52:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 2215 transitions. [2020-12-02 11:52:02,047 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 2215 transitions. Word has length 10 [2020-12-02 11:52:02,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:52:02,048 INFO L481 AbstractCegarLoop]: Abstraction has 712 states and 2215 transitions. [2020-12-02 11:52:02,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 11:52:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 2215 transitions. [2020-12-02 11:52:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 11:52:02,051 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:52:02,052 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:52:02,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 11:52:02,052 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:52:02,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:52:02,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1211468434, now seen corresponding path program 1 times [2020-12-02 11:52:02,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:52:02,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529431703] [2020-12-02 11:52:02,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:52:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:52:02,199 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:52:02,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529431703] [2020-12-02 11:52:02,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:52:02,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 11:52:02,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528746759] [2020-12-02 11:52:02,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 11:52:02,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:52:02,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 11:52:02,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:52:02,202 INFO L87 Difference]: Start difference. First operand 712 states and 2215 transitions. Second operand 4 states. [2020-12-02 11:52:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:52:02,310 INFO L93 Difference]: Finished difference Result 796 states and 2398 transitions. [2020-12-02 11:52:02,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:52:02,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-02 11:52:02,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:52:02,318 INFO L225 Difference]: With dead ends: 796 [2020-12-02 11:52:02,318 INFO L226 Difference]: Without dead ends: 696 [2020-12-02 11:52:02,318 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 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:52:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2020-12-02 11:52:02,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2020-12-02 11:52:02,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2020-12-02 11:52:02,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 2155 transitions. [2020-12-02 11:52:02,348 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 2155 transitions. Word has length 12 [2020-12-02 11:52:02,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:52:02,349 INFO L481 AbstractCegarLoop]: Abstraction has 696 states and 2155 transitions. [2020-12-02 11:52:02,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 11:52:02,349 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 2155 transitions. [2020-12-02 11:52:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-02 11:52:02,352 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:52:02,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:52:02,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 11:52:02,352 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:52:02,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:52:02,353 INFO L82 PathProgramCache]: Analyzing trace with hash 126303348, now seen corresponding path program 1 times [2020-12-02 11:52:02,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:52:02,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150426819] [2020-12-02 11:52:02,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:52:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:52:02,594 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:52:02,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150426819] [2020-12-02 11:52:02,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:52:02,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:52:02,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936683294] [2020-12-02 11:52:02,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:52:02,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:52:02,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:52:02,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:52:02,596 INFO L87 Difference]: Start difference. First operand 696 states and 2155 transitions. Second operand 6 states. [2020-12-02 11:52:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:52:02,784 INFO L93 Difference]: Finished difference Result 792 states and 2387 transitions. [2020-12-02 11:52:02,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 11:52:02,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-02 11:52:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:52:02,792 INFO L225 Difference]: With dead ends: 792 [2020-12-02 11:52:02,792 INFO L226 Difference]: Without dead ends: 704 [2020-12-02 11:52:02,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-02 11:52:02,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2020-12-02 11:52:02,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2020-12-02 11:52:02,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2020-12-02 11:52:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 2167 transitions. [2020-12-02 11:52:02,821 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 2167 transitions. Word has length 13 [2020-12-02 11:52:02,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:52:02,821 INFO L481 AbstractCegarLoop]: Abstraction has 704 states and 2167 transitions. [2020-12-02 11:52:02,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:52:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 2167 transitions. [2020-12-02 11:52:02,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-02 11:52:02,824 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:52:02,824 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:52:02,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-02 11:52:02,824 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:52:02,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:52:02,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1931849997, now seen corresponding path program 1 times [2020-12-02 11:52:02,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:52:02,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834367202] [2020-12-02 11:52:02,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:52:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:52:02,973 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:52:02,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834367202] [2020-12-02 11:52:02,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:52:02,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:52:02,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899780255] [2020-12-02 11:52:02,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:52:02,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:52:02,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:52:02,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:52:02,976 INFO L87 Difference]: Start difference. First operand 704 states and 2167 transitions. Second operand 6 states. [2020-12-02 11:52:03,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:52:03,171 INFO L93 Difference]: Finished difference Result 768 states and 2312 transitions. [2020-12-02 11:52:03,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 11:52:03,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-02 11:52:03,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:52:03,178 INFO L225 Difference]: With dead ends: 768 [2020-12-02 11:52:03,179 INFO L226 Difference]: Without dead ends: 706 [2020-12-02 11:52:03,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 11:52:03,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2020-12-02 11:52:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2020-12-02 11:52:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2020-12-02 11:52:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 2170 transitions. [2020-12-02 11:52:03,206 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 2170 transitions. Word has length 14 [2020-12-02 11:52:03,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:52:03,206 INFO L481 AbstractCegarLoop]: Abstraction has 706 states and 2170 transitions. [2020-12-02 11:52:03,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:52:03,206 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 2170 transitions. [2020-12-02 11:52:03,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 11:52:03,209 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:52:03,209 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:52:03,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-02 11:52:03,209 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:52:03,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:52:03,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1393527957, now seen corresponding path program 1 times [2020-12-02 11:52:03,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:52:03,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521891470] [2020-12-02 11:52:03,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:52:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:52:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:52:03,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521891470] [2020-12-02 11:52:03,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:52:03,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 11:52:03,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510131700] [2020-12-02 11:52:03,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 11:52:03,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:52:03,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 11:52:03,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-02 11:52:03,422 INFO L87 Difference]: Start difference. First operand 706 states and 2170 transitions. Second operand 7 states. [2020-12-02 11:52:03,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:52:03,756 INFO L93 Difference]: Finished difference Result 920 states and 2765 transitions. [2020-12-02 11:52:03,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 11:52:03,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-12-02 11:52:03,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:52:03,764 INFO L225 Difference]: With dead ends: 920 [2020-12-02 11:52:03,765 INFO L226 Difference]: Without dead ends: 834 [2020-12-02 11:52:03,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-12-02 11:52:03,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2020-12-02 11:52:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 804. [2020-12-02 11:52:03,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-12-02 11:52:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 2445 transitions. [2020-12-02 11:52:03,805 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 2445 transitions. Word has length 15 [2020-12-02 11:52:03,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:52:03,806 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 2445 transitions. [2020-12-02 11:52:03,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 11:52:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 2445 transitions. [2020-12-02 11:52:03,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 11:52:03,809 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:52:03,810 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:52:03,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-02 11:52:03,810 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:52:03,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:52:03,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1313691475, now seen corresponding path program 1 times [2020-12-02 11:52:03,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:52:03,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939679453] [2020-12-02 11:52:03,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:52:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:52:03,934 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:52:03,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939679453] [2020-12-02 11:52:03,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:52:03,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:52:03,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836691098] [2020-12-02 11:52:03,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 11:52:03,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:52:03,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 11:52:03,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:52:03,937 INFO L87 Difference]: Start difference. First operand 804 states and 2445 transitions. Second operand 5 states. [2020-12-02 11:52:03,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:52:03,996 INFO L93 Difference]: Finished difference Result 1221 states and 3651 transitions. [2020-12-02 11:52:03,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:52:03,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-02 11:52:03,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:52:04,004 INFO L225 Difference]: With dead ends: 1221 [2020-12-02 11:52:04,004 INFO L226 Difference]: Without dead ends: 840 [2020-12-02 11:52:04,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-02 11:52:04,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2020-12-02 11:52:04,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 756. [2020-12-02 11:52:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2020-12-02 11:52:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 2188 transitions. [2020-12-02 11:52:04,035 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 2188 transitions. Word has length 15 [2020-12-02 11:52:04,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:52:04,035 INFO L481 AbstractCegarLoop]: Abstraction has 756 states and 2188 transitions. [2020-12-02 11:52:04,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 11:52:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 2188 transitions. [2020-12-02 11:52:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 11:52:04,038 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:52:04,038 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:52:04,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-02 11:52:04,039 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:52:04,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:52:04,039 INFO L82 PathProgramCache]: Analyzing trace with hash -861466251, now seen corresponding path program 1 times [2020-12-02 11:52:04,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:52:04,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48182200] [2020-12-02 11:52:04,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:52:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:52:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:52:04,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48182200] [2020-12-02 11:52:04,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:52:04,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:52:04,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704416131] [2020-12-02 11:52:04,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:52:04,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:52:04,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:52:04,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:52:04,168 INFO L87 Difference]: Start difference. First operand 756 states and 2188 transitions. Second operand 6 states. [2020-12-02 11:52:04,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:52:04,294 INFO L93 Difference]: Finished difference Result 780 states and 2222 transitions. [2020-12-02 11:52:04,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:52:04,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-02 11:52:04,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:52:04,301 INFO L225 Difference]: With dead ends: 780 [2020-12-02 11:52:04,301 INFO L226 Difference]: Without dead ends: 740 [2020-12-02 11:52:04,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-02 11:52:04,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2020-12-02 11:52:04,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 728. [2020-12-02 11:52:04,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2020-12-02 11:52:04,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 2106 transitions. [2020-12-02 11:52:04,327 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 2106 transitions. Word has length 15 [2020-12-02 11:52:04,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:52:04,328 INFO L481 AbstractCegarLoop]: Abstraction has 728 states and 2106 transitions. [2020-12-02 11:52:04,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:52:04,328 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 2106 transitions. [2020-12-02 11:52:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 11:52:04,330 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:52:04,330 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:52:04,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-02 11:52:04,330 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:52:04,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:52:04,331 INFO L82 PathProgramCache]: Analyzing trace with hash -442709575, now seen corresponding path program 2 times [2020-12-02 11:52:04,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:52:04,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963125453] [2020-12-02 11:52:04,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:52:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:52:04,400 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:52:04,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963125453] [2020-12-02 11:52:04,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:52:04,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 11:52:04,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042243634] [2020-12-02 11:52:04,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 11:52:04,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:52:04,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 11:52:04,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:52:04,402 INFO L87 Difference]: Start difference. First operand 728 states and 2106 transitions. Second operand 4 states. [2020-12-02 11:52:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:52:04,441 INFO L93 Difference]: Finished difference Result 678 states and 1730 transitions. [2020-12-02 11:52:04,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:52:04,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-02 11:52:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:52:04,446 INFO L225 Difference]: With dead ends: 678 [2020-12-02 11:52:04,446 INFO L226 Difference]: Without dead ends: 500 [2020-12-02 11:52:04,446 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:52:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2020-12-02 11:52:04,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2020-12-02 11:52:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-12-02 11:52:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1238 transitions. [2020-12-02 11:52:04,463 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1238 transitions. Word has length 15 [2020-12-02 11:52:04,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:52:04,463 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 1238 transitions. [2020-12-02 11:52:04,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 11:52:04,463 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1238 transitions. [2020-12-02 11:52:04,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 11:52:04,465 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:52:04,465 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:52:04,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-02 11:52:04,465 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:52:04,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:52:04,466 INFO L82 PathProgramCache]: Analyzing trace with hash -842813830, now seen corresponding path program 1 times [2020-12-02 11:52:04,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:52:04,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501287367] [2020-12-02 11:52:04,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:52:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:52:04,544 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:52:04,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501287367] [2020-12-02 11:52:04,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:52:04,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:52:04,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038654095] [2020-12-02 11:52:04,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 11:52:04,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:52:04,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 11:52:04,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:52:04,547 INFO L87 Difference]: Start difference. First operand 500 states and 1238 transitions. Second operand 5 states. [2020-12-02 11:52:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:52:04,596 INFO L93 Difference]: Finished difference Result 386 states and 880 transitions. [2020-12-02 11:52:04,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 11:52:04,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-02 11:52:04,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:52:04,599 INFO L225 Difference]: With dead ends: 386 [2020-12-02 11:52:04,600 INFO L226 Difference]: Without dead ends: 302 [2020-12-02 11:52:04,600 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:52:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-12-02 11:52:04,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 262. [2020-12-02 11:52:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2020-12-02 11:52:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 580 transitions. [2020-12-02 11:52:04,624 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 580 transitions. Word has length 16 [2020-12-02 11:52:04,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:52:04,624 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 580 transitions. [2020-12-02 11:52:04,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 11:52:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 580 transitions. [2020-12-02 11:52:04,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 11:52:04,625 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:52:04,625 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:52:04,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-02 11:52:04,625 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:52:04,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:52:04,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1139978505, now seen corresponding path program 1 times [2020-12-02 11:52:04,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:52:04,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390812898] [2020-12-02 11:52:04,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:52:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:52:04,725 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:52:04,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390812898] [2020-12-02 11:52:04,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:52:04,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 11:52:04,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952161939] [2020-12-02 11:52:04,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:52:04,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:52:04,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:52:04,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:52:04,727 INFO L87 Difference]: Start difference. First operand 262 states and 580 transitions. Second operand 6 states. [2020-12-02 11:52:04,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:52:04,786 INFO L93 Difference]: Finished difference Result 230 states and 515 transitions. [2020-12-02 11:52:04,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 11:52:04,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-02 11:52:04,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:52:04,788 INFO L225 Difference]: With dead ends: 230 [2020-12-02 11:52:04,788 INFO L226 Difference]: Without dead ends: 170 [2020-12-02 11:52:04,788 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:52:04,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-12-02 11:52:04,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2020-12-02 11:52:04,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-12-02 11:52:04,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 379 transitions. [2020-12-02 11:52:04,793 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 379 transitions. Word has length 19 [2020-12-02 11:52:04,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:52:04,794 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 379 transitions. [2020-12-02 11:52:04,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:52:04,794 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 379 transitions. [2020-12-02 11:52:04,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 11:52:04,795 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:52:04,795 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:52:04,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-02 11:52:04,795 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:52:04,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:52:04,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1229833790, now seen corresponding path program 1 times [2020-12-02 11:52:04,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:52:04,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942493160] [2020-12-02 11:52:04,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:52:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:52:04,893 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:52:04,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942493160] [2020-12-02 11:52:04,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:52:04,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:52:04,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618438010] [2020-12-02 11:52:04,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 11:52:04,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:52:04,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 11:52:04,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:52:04,895 INFO L87 Difference]: Start difference. First operand 166 states and 379 transitions. Second operand 5 states. [2020-12-02 11:52:04,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:52:04,935 INFO L93 Difference]: Finished difference Result 205 states and 457 transitions. [2020-12-02 11:52:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:52:04,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-12-02 11:52:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:52:04,936 INFO L225 Difference]: With dead ends: 205 [2020-12-02 11:52:04,936 INFO L226 Difference]: Without dead ends: 74 [2020-12-02 11:52:04,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-02 11:52:04,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-12-02 11:52:04,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-12-02 11:52:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-12-02 11:52:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 139 transitions. [2020-12-02 11:52:04,939 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 139 transitions. Word has length 23 [2020-12-02 11:52:04,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:52:04,939 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 139 transitions. [2020-12-02 11:52:04,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 11:52:04,940 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 139 transitions. [2020-12-02 11:52:04,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 11:52:04,940 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:52:04,940 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:52:04,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-02 11:52:04,941 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:52:04,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:52:04,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1155029740, now seen corresponding path program 2 times [2020-12-02 11:52:04,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:52:04,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934448655] [2020-12-02 11:52:04,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:52:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:52:05,139 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:52:05,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934448655] [2020-12-02 11:52:05,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:52:05,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-02 11:52:05,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527993201] [2020-12-02 11:52:05,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 11:52:05,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:52:05,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 11:52:05,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-02 11:52:05,142 INFO L87 Difference]: Start difference. First operand 74 states and 139 transitions. Second operand 8 states. [2020-12-02 11:52:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:52:05,345 INFO L93 Difference]: Finished difference Result 95 states and 175 transitions. [2020-12-02 11:52:05,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 11:52:05,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-12-02 11:52:05,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:52:05,347 INFO L225 Difference]: With dead ends: 95 [2020-12-02 11:52:05,347 INFO L226 Difference]: Without dead ends: 52 [2020-12-02 11:52:05,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-12-02 11:52:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-12-02 11:52:05,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-12-02 11:52:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-02 11:52:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 87 transitions. [2020-12-02 11:52:05,350 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 87 transitions. Word has length 23 [2020-12-02 11:52:05,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:52:05,350 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 87 transitions. [2020-12-02 11:52:05,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 11:52:05,350 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 87 transitions. [2020-12-02 11:52:05,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 11:52:05,351 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:52:05,351 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:52:05,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-02 11:52:05,352 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:52:05,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:52:05,352 INFO L82 PathProgramCache]: Analyzing trace with hash -399323754, now seen corresponding path program 3 times [2020-12-02 11:52:05,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:52:05,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87247532] [2020-12-02 11:52:05,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:52:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 11:52:05,406 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 11:52:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 11:52:05,463 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 11:52:05,505 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 11:52:05,505 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 11:52:05,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-02 11:52:05,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:52:05 BasicIcfg [2020-12-02 11:52:05,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 11:52:05,675 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 11:52:05,675 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 11:52:05,676 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 11:52:05,676 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:51:44" (3/4) ... [2020-12-02 11:52:05,680 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-02 11:52:05,797 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 11:52:05,798 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 11:52:05,799 INFO L168 Benchmark]: Toolchain (without parser) took 24938.93 ms. Allocated memory was 48.2 MB in the beginning and 308.3 MB in the end (delta: 260.0 MB). Free memory was 31.7 MB in the beginning and 108.5 MB in the end (delta: -76.8 MB). Peak memory consumption was 184.1 MB. Max. memory is 16.1 GB. [2020-12-02 11:52:05,800 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 37.7 MB. Free memory was 20.6 MB in the beginning and 20.5 MB in the end (delta: 33.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 11:52:05,800 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.87 ms. Allocated memory is still 48.2 MB. Free memory was 31.4 MB in the beginning and 18.7 MB in the end (delta: 12.7 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. [2020-12-02 11:52:05,801 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.76 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 18.7 MB in the beginning and 38.3 MB in the end (delta: -19.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 16.1 GB. [2020-12-02 11:52:05,801 INFO L168 Benchmark]: Boogie Preprocessor took 89.52 ms. Allocated memory is still 58.7 MB. Free memory was 38.3 MB in the beginning and 36.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 11:52:05,802 INFO L168 Benchmark]: RCFGBuilder took 2735.07 ms. Allocated memory was 58.7 MB in the beginning and 86.0 MB in the end (delta: 27.3 MB). Free memory was 36.0 MB in the beginning and 35.4 MB in the end (delta: 613.3 kB). Peak memory consumption was 39.9 MB. Max. memory is 16.1 GB. [2020-12-02 11:52:05,802 INFO L168 Benchmark]: TraceAbstraction took 21091.46 ms. Allocated memory was 86.0 MB in the beginning and 308.3 MB in the end (delta: 222.3 MB). Free memory was 35.4 MB in the beginning and 123.2 MB in the end (delta: -87.8 MB). Peak memory consumption was 134.0 MB. Max. memory is 16.1 GB. [2020-12-02 11:52:05,803 INFO L168 Benchmark]: Witness Printer took 122.74 ms. Allocated memory is still 308.3 MB. Free memory was 123.2 MB in the beginning and 108.5 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:52:05,806 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.17 ms. Allocated memory is still 37.7 MB. Free memory was 20.6 MB in the beginning and 20.5 MB in the end (delta: 33.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 797.87 ms. Allocated memory is still 48.2 MB. Free memory was 31.4 MB in the beginning and 18.7 MB in the end (delta: 12.7 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 94.76 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 18.7 MB in the beginning and 38.3 MB in the end (delta: -19.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 89.52 ms. Allocated memory is still 58.7 MB. Free memory was 38.3 MB in the beginning and 36.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2735.07 ms. Allocated memory was 58.7 MB in the beginning and 86.0 MB in the end (delta: 27.3 MB). Free memory was 36.0 MB in the beginning and 35.4 MB in the end (delta: 613.3 kB). Peak memory consumption was 39.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 21091.46 ms. Allocated memory was 86.0 MB in the beginning and 308.3 MB in the end (delta: 222.3 MB). Free memory was 35.4 MB in the beginning and 123.2 MB in the end (delta: -87.8 MB). Peak memory consumption was 134.0 MB. Max. memory is 16.1 GB. * Witness Printer took 122.74 ms. Allocated memory is still 308.3 MB. Free memory was 123.2 MB in the beginning and 108.5 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 1223 VarBasedMoverChecksPositive, 71 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 49 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.1s, 184 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 16.1s, 108 PlacesBefore, 38 PlacesAfterwards, 100 TransitionsBefore, 29 TransitionsAfterwards, 1770 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, 5460 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_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515; [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L827] 0 pthread_t t516; [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L829] 0 pthread_t t517; [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L800] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L780] 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) [L780] 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) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 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 [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 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 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L803] 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) [L803] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L803] 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) [L803] 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) [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L805] 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 [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L807] 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 [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L751] 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) [L751] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L751] 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) [L751] 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) [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L753] 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 [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L755] 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 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L836] 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) [L836] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L836] 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) [L836] 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) [L837] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 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 [L839] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L840] 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 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] 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) [L847] 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) [L848] 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)) [L848] EXPR 0 !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) [L848] 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)) [L848] 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)) [L849] 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)) [L849] EXPR 0 !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) [L849] 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)) [L849] 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)) [L850] 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)) [L850] EXPR 0 !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) [L850] 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)) [L850] 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)) [L851] 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)) [L851] EXPR 0 !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) [L851] 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)) [L851] 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)) [L852] 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)) [L852] EXPR 0 !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) [L852] 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)) [L852] 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)) [L853] 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)) [L853] EXPR 0 !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) [L853] 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)) [L853] 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)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, 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, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 16.2s, HoareTripleCheckerStatistics: 396 SDtfs, 438 SDslu, 826 SDs, 0 SdLazy, 388 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1152occurred 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, 13 MinimizatonAttempts, 170 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 19614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...