/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:51:38,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:51:38,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:51:39,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:51:39,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:51:39,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:51:39,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:51:39,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:51:39,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:51:39,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:51:39,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:51:39,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:51:39,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:51:39,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:51:39,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:51:39,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:51:39,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:51:39,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:51:39,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:51:39,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:51:39,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:51:39,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:51:39,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:51:39,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:51:39,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:51:39,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:51:39,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:51:39,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:51:39,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:51:39,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:51:39,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:51:39,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:51:39,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:51:39,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:51:39,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:51:39,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:51:39,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:51:39,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:51:39,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:51:39,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:51:39,099 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:51:39,100 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 04:51:39,141 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:51:39,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:51:39,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:51:39,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:51:39,143 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:51:39,143 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:51:39,143 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:51:39,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:51:39,144 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:51:39,144 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:51:39,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:51:39,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:51:39,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:51:39,146 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:51:39,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:51:39,147 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:51:39,147 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:51:39,147 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:51:39,147 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:51:39,147 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:51:39,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:51:39,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:51:39,148 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:51:39,148 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:51:39,148 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:51:39,148 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:51:39,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:51:39,149 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:51:39,149 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:51:39,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:51:39,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:51:39,480 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:51:39,482 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:51:39,482 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:51:39,482 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt.i [2020-10-16 04:51:39,533 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c714db0ed/7d0e7163259f416d9f039d4ad2494f9d/FLAG34000e67e [2020-10-16 04:51:40,122 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:51:40,123 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.opt.i [2020-10-16 04:51:40,141 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c714db0ed/7d0e7163259f416d9f039d4ad2494f9d/FLAG34000e67e [2020-10-16 04:51:40,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c714db0ed/7d0e7163259f416d9f039d4ad2494f9d [2020-10-16 04:51:40,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:51:40,361 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:51:40,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:51:40,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:51:40,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:51:40,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:51:40" (1/1) ... [2020-10-16 04:51:40,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77674f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:40, skipping insertion in model container [2020-10-16 04:51:40,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:51:40" (1/1) ... [2020-10-16 04:51:40,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:51:40,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:51:40,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:51:41,001 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:51:41,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:51:41,143 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:51:41,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:41 WrapperNode [2020-10-16 04:51:41,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:51:41,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:51:41,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:51:41,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:51:41,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:41" (1/1) ... [2020-10-16 04:51:41,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:41" (1/1) ... [2020-10-16 04:51:41,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:51:41,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:51:41,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:51:41,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:51:41,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:41" (1/1) ... [2020-10-16 04:51:41,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:41" (1/1) ... [2020-10-16 04:51:41,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:41" (1/1) ... [2020-10-16 04:51:41,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:41" (1/1) ... [2020-10-16 04:51:41,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:41" (1/1) ... [2020-10-16 04:51:41,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:41" (1/1) ... [2020-10-16 04:51:41,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:41" (1/1) ... [2020-10-16 04:51:41,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:51:41,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:51:41,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:51:41,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:51:41,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04: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-10-16 04:51:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:51:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:51:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:51:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:51:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:51:41,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:51:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:51:41,360 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:51:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:51:41,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:51:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:51:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:51:41,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:51:41,366 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 04:51:43,229 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:51:43,230 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:51:43,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:51:43 BoogieIcfgContainer [2020-10-16 04:51:43,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:51:43,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:51:43,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:51:43,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:51:43,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:51:40" (1/3) ... [2020-10-16 04:51:43,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d19cbcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:51:43, skipping insertion in model container [2020-10-16 04:51:43,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:41" (2/3) ... [2020-10-16 04:51:43,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d19cbcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:51:43, skipping insertion in model container [2020-10-16 04:51:43,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:51:43" (3/3) ... [2020-10-16 04:51:43,241 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_power.opt.i [2020-10-16 04:51:43,253 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:51:43,261 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:51:43,262 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:51:43,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,292 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,292 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,294 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,294 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,297 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,297 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,298 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,298 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,305 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,305 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,310 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,310 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,314 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,314 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,315 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:43,333 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 04:51:43,354 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:51:43,355 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:51:43,355 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:51:43,355 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:51:43,355 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:51:43,355 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:51:43,355 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:51:43,356 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:51:43,371 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2020-10-16 04:51:43,418 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-10-16 04:51:43,418 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:51:43,423 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 04:51:43,424 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 95 transitions, 205 flow [2020-10-16 04:51:43,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 92 transitions, 193 flow [2020-10-16 04:51:43,435 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:51:43,438 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 193 flow [2020-10-16 04:51:43,442 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 193 flow [2020-10-16 04:51:43,442 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 193 flow [2020-10-16 04:51:43,467 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-10-16 04:51:43,468 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:51:43,469 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 04:51:43,472 INFO L117 LiptonReduction]: Number of co-enabled transitions 1692 [2020-10-16 04:51:43,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:51:43,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:43,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:51:43,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:43,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:51:43,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:43,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:51:43,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:44,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:51:44,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:44,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:51:44,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:44,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:51:44,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:44,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:51:44,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:45,367 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 04:51:45,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 04:51:45,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:45,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:51:45,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:46,255 WARN L193 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 04:51:46,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:51:46,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:47,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:47,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:47,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:47,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:47,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:47,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:47,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:47,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:47,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:47,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:47,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:47,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:47,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:47,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:47,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:47,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:47,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:51:47,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:47,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:47,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:47,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:47,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:47,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:47,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:47,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:47,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:47,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:47,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:47,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:47,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:47,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:47,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:47,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:47,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:47,771 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 04:51:47,891 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 04:51:47,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:47,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:47,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:47,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:47,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:47,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:47,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:47,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:47,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:47,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:47,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:47,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:47,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:47,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:47,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:47,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:47,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:48,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:48,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:48,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:48,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:48,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:48,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:48,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:48,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:48,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:48,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:48,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:48,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:48,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:48,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:48,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:48,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:48,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:48,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:48,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:48,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:48,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:48,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:48,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:48,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:48,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:48,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:48,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:48,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:48,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:48,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:48,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:48,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:48,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:48,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:48,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:48,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:48,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:48,871 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2020-10-16 04:51:48,983 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-16 04:51:48,991 INFO L132 LiptonReduction]: Checked pairs total: 4043 [2020-10-16 04:51:48,991 INFO L134 LiptonReduction]: Total number of compositions: 78 [2020-10-16 04:51:48,994 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5562 [2020-10-16 04:51:49,002 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2020-10-16 04:51:49,002 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:51:49,002 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:49,003 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:49,004 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:49,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:49,010 INFO L82 PathProgramCache]: Analyzing trace with hash 606769950, now seen corresponding path program 1 times [2020-10-16 04:51:49,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:49,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804951368] [2020-10-16 04:51:49,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:49,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804951368] [2020-10-16 04:51:49,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:49,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:51:49,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045807720] [2020-10-16 04:51:49,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:51:49,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:49,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:51:49,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:51:49,284 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 173 [2020-10-16 04:51:49,286 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states. [2020-10-16 04:51:49,287 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:49,287 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 173 [2020-10-16 04:51:49,288 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:49,353 INFO L129 PetriNetUnfolder]: 16/65 cut-off events. [2020-10-16 04:51:49,354 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:51:49,354 INFO L80 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 65 events. 16/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 209 event pairs, 6 based on Foata normal form. 6/62 useless extension candidates. Maximal degree in co-relation 100. Up to 27 conditions per place. [2020-10-16 04:51:49,356 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 7 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2020-10-16 04:51:49,356 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 79 flow [2020-10-16 04:51:49,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:51:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:51:49,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2020-10-16 04:51:49,377 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.884393063583815 [2020-10-16 04:51:49,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2020-10-16 04:51:49,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2020-10-16 04:51:49,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:49,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2020-10-16 04:51:49,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:51:49,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:51:49,398 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:51:49,401 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 459 transitions. [2020-10-16 04:51:49,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 79 flow [2020-10-16 04:51:49,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 76 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 04:51:49,407 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2020-10-16 04:51:49,411 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2020-10-16 04:51:49,412 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2020-10-16 04:51:49,412 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2020-10-16 04:51:49,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:51:49,412 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:49,413 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:49,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:51:49,413 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:49,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:49,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1232015982, now seen corresponding path program 1 times [2020-10-16 04:51:49,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:49,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526424421] [2020-10-16 04:51:49,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:49,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:49,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526424421] [2020-10-16 04:51:49,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:49,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:51:49,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536395430] [2020-10-16 04:51:49,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:51:49,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:49,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:51:49,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:51:49,596 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 173 [2020-10-16 04:51:49,596 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand 4 states. [2020-10-16 04:51:49,596 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:49,596 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 173 [2020-10-16 04:51:49,597 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:49,656 INFO L129 PetriNetUnfolder]: 6/42 cut-off events. [2020-10-16 04:51:49,656 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-16 04:51:49,657 INFO L80 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 42 events. 6/42 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 1 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 67. Up to 6 conditions per place. [2020-10-16 04:51:49,657 INFO L132 encePairwiseOnDemand]: 168/173 looper letters, 5 selfloop transitions, 2 changer transitions 6/29 dead transitions. [2020-10-16 04:51:49,657 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 96 flow [2020-10-16 04:51:49,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:51:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:51:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 695 transitions. [2020-10-16 04:51:49,662 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8034682080924855 [2020-10-16 04:51:49,662 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 695 transitions. [2020-10-16 04:51:49,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 695 transitions. [2020-10-16 04:51:49,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:49,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 695 transitions. [2020-10-16 04:51:49,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:51:49,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:51:49,667 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:51:49,667 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 695 transitions. [2020-10-16 04:51:49,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 96 flow [2020-10-16 04:51:49,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:51:49,669 INFO L241 Difference]: Finished difference. Result has 37 places, 22 transitions, 62 flow [2020-10-16 04:51:49,669 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2020-10-16 04:51:49,670 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2020-10-16 04:51:49,670 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 62 flow [2020-10-16 04:51:49,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:51:49,670 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:49,670 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:49,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:51:49,671 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:49,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:49,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1443744297, now seen corresponding path program 1 times [2020-10-16 04:51:49,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:49,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510814358] [2020-10-16 04:51:49,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:49,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510814358] [2020-10-16 04:51:49,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:49,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:51:49,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246200263] [2020-10-16 04:51:49,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:51:49,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:49,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:51:49,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:51:49,784 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 173 [2020-10-16 04:51:49,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 62 flow. Second operand 5 states. [2020-10-16 04:51:49,785 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:49,785 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 173 [2020-10-16 04:51:49,786 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:49,892 INFO L129 PetriNetUnfolder]: 89/216 cut-off events. [2020-10-16 04:51:49,892 INFO L130 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2020-10-16 04:51:49,893 INFO L80 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 216 events. 89/216 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1041 event pairs, 51 based on Foata normal form. 12/222 useless extension candidates. Maximal degree in co-relation 426. Up to 128 conditions per place. [2020-10-16 04:51:49,895 INFO L132 encePairwiseOnDemand]: 168/173 looper letters, 11 selfloop transitions, 3 changer transitions 8/35 dead transitions. [2020-10-16 04:51:49,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 35 transitions, 134 flow [2020-10-16 04:51:49,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:51:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:51:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2020-10-16 04:51:49,898 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7502890173410405 [2020-10-16 04:51:49,899 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2020-10-16 04:51:49,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2020-10-16 04:51:49,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:49,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2020-10-16 04:51:49,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:51:49,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:51:49,902 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:51:49,903 INFO L185 Difference]: Start difference. First operand has 37 places, 22 transitions, 62 flow. Second operand 5 states and 649 transitions. [2020-10-16 04:51:49,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 35 transitions, 134 flow [2020-10-16 04:51:49,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 126 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:51:49,906 INFO L241 Difference]: Finished difference. Result has 37 places, 24 transitions, 81 flow [2020-10-16 04:51:49,906 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=81, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2020-10-16 04:51:49,906 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2020-10-16 04:51:49,907 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 81 flow [2020-10-16 04:51:49,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:51:49,907 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:49,907 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:49,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:51:49,907 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:49,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:49,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1303783391, now seen corresponding path program 1 times [2020-10-16 04:51:49,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:49,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098023954] [2020-10-16 04:51:49,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:50,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098023954] [2020-10-16 04:51:50,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:50,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:51:50,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773749300] [2020-10-16 04:51:50,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:51:50,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:50,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:51:50,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:51:50,050 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 173 [2020-10-16 04:51:50,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 81 flow. Second operand 6 states. [2020-10-16 04:51:50,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:50,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 173 [2020-10-16 04:51:50,052 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:50,175 INFO L129 PetriNetUnfolder]: 68/183 cut-off events. [2020-10-16 04:51:50,176 INFO L130 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2020-10-16 04:51:50,177 INFO L80 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 183 events. 68/183 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 886 event pairs, 39 based on Foata normal form. 13/181 useless extension candidates. Maximal degree in co-relation 393. Up to 98 conditions per place. [2020-10-16 04:51:50,179 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 9 selfloop transitions, 5 changer transitions 6/36 dead transitions. [2020-10-16 04:51:50,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 149 flow [2020-10-16 04:51:50,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:51:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:51:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 766 transitions. [2020-10-16 04:51:50,182 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7379576107899807 [2020-10-16 04:51:50,183 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 766 transitions. [2020-10-16 04:51:50,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 766 transitions. [2020-10-16 04:51:50,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:50,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 766 transitions. [2020-10-16 04:51:50,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:51:50,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:51:50,187 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:51:50,187 INFO L185 Difference]: Start difference. First operand has 37 places, 24 transitions, 81 flow. Second operand 6 states and 766 transitions. [2020-10-16 04:51:50,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 149 flow [2020-10-16 04:51:50,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 144 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:51:50,190 INFO L241 Difference]: Finished difference. Result has 42 places, 28 transitions, 114 flow [2020-10-16 04:51:50,190 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2020-10-16 04:51:50,190 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2020-10-16 04:51:50,191 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 114 flow [2020-10-16 04:51:50,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:51:50,191 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:50,191 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:50,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:51:50,191 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:50,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:50,192 INFO L82 PathProgramCache]: Analyzing trace with hash -601802575, now seen corresponding path program 1 times [2020-10-16 04:51:50,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:50,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418188906] [2020-10-16 04:51:50,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:50,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418188906] [2020-10-16 04:51:50,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:50,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:51:50,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818673370] [2020-10-16 04:51:50,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:51:50,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:50,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:51:50,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:51:50,376 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 173 [2020-10-16 04:51:50,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 114 flow. Second operand 7 states. [2020-10-16 04:51:50,377 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:50,377 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 173 [2020-10-16 04:51:50,377 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:50,550 INFO L129 PetriNetUnfolder]: 72/187 cut-off events. [2020-10-16 04:51:50,550 INFO L130 PetriNetUnfolder]: For 206/210 co-relation queries the response was YES. [2020-10-16 04:51:50,552 INFO L80 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 187 events. 72/187 cut-off events. For 206/210 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 882 event pairs, 8 based on Foata normal form. 8/188 useless extension candidates. Maximal degree in co-relation 512. Up to 93 conditions per place. [2020-10-16 04:51:50,556 INFO L132 encePairwiseOnDemand]: 166/173 looper letters, 11 selfloop transitions, 8 changer transitions 5/40 dead transitions. [2020-10-16 04:51:50,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 206 flow [2020-10-16 04:51:50,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:51:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:51:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 870 transitions. [2020-10-16 04:51:50,560 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7184145334434352 [2020-10-16 04:51:50,560 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 870 transitions. [2020-10-16 04:51:50,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 870 transitions. [2020-10-16 04:51:50,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:50,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 870 transitions. [2020-10-16 04:51:50,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:51:50,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:51:50,565 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:51:50,565 INFO L185 Difference]: Start difference. First operand has 42 places, 28 transitions, 114 flow. Second operand 7 states and 870 transitions. [2020-10-16 04:51:50,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 206 flow [2020-10-16 04:51:50,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 204 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 04:51:50,569 INFO L241 Difference]: Finished difference. Result has 48 places, 32 transitions, 157 flow [2020-10-16 04:51:50,569 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=157, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2020-10-16 04:51:50,569 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2020-10-16 04:51:50,569 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 157 flow [2020-10-16 04:51:50,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:51:50,570 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:50,570 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:50,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:51:50,570 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:50,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:50,572 INFO L82 PathProgramCache]: Analyzing trace with hash 164070705, now seen corresponding path program 2 times [2020-10-16 04:51:50,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:50,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636936210] [2020-10-16 04:51:50,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:50,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636936210] [2020-10-16 04:51:50,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:50,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:51:50,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513855679] [2020-10-16 04:51:50,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:51:50,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:50,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:51:50,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:51:50,648 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 173 [2020-10-16 04:51:50,648 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 157 flow. Second operand 6 states. [2020-10-16 04:51:50,648 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:50,648 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 173 [2020-10-16 04:51:50,649 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:50,771 INFO L129 PetriNetUnfolder]: 69/190 cut-off events. [2020-10-16 04:51:50,772 INFO L130 PetriNetUnfolder]: For 407/411 co-relation queries the response was YES. [2020-10-16 04:51:50,773 INFO L80 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 190 events. 69/190 cut-off events. For 407/411 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 907 event pairs, 16 based on Foata normal form. 14/197 useless extension candidates. Maximal degree in co-relation 625. Up to 82 conditions per place. [2020-10-16 04:51:50,774 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 11 selfloop transitions, 9 changer transitions 5/41 dead transitions. [2020-10-16 04:51:50,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 271 flow [2020-10-16 04:51:50,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:51:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:51:50,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 812 transitions. [2020-10-16 04:51:50,778 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7822736030828517 [2020-10-16 04:51:50,778 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 812 transitions. [2020-10-16 04:51:50,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 812 transitions. [2020-10-16 04:51:50,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:50,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 812 transitions. [2020-10-16 04:51:50,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:51:50,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:51:50,783 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:51:50,783 INFO L185 Difference]: Start difference. First operand has 48 places, 32 transitions, 157 flow. Second operand 6 states and 812 transitions. [2020-10-16 04:51:50,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 271 flow [2020-10-16 04:51:50,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 249 flow, removed 11 selfloop flow, removed 2 redundant places. [2020-10-16 04:51:50,787 INFO L241 Difference]: Finished difference. Result has 52 places, 34 transitions, 197 flow [2020-10-16 04:51:50,788 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2020-10-16 04:51:50,788 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2020-10-16 04:51:50,788 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 197 flow [2020-10-16 04:51:50,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:51:50,788 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:50,788 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:50,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:51:50,789 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:50,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:50,789 INFO L82 PathProgramCache]: Analyzing trace with hash -317927326, now seen corresponding path program 1 times [2020-10-16 04:51:50,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:50,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262609186] [2020-10-16 04:51:50,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:50,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262609186] [2020-10-16 04:51:50,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:50,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:51:50,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652505071] [2020-10-16 04:51:50,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:51:50,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:50,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:51:50,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:51:50,948 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 173 [2020-10-16 04:51:50,949 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 197 flow. Second operand 7 states. [2020-10-16 04:51:50,949 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:50,949 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 173 [2020-10-16 04:51:50,949 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:51,148 INFO L129 PetriNetUnfolder]: 67/186 cut-off events. [2020-10-16 04:51:51,148 INFO L130 PetriNetUnfolder]: For 572/596 co-relation queries the response was YES. [2020-10-16 04:51:51,150 INFO L80 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 186 events. 67/186 cut-off events. For 572/596 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 908 event pairs, 8 based on Foata normal form. 22/201 useless extension candidates. Maximal degree in co-relation 708. Up to 84 conditions per place. [2020-10-16 04:51:51,151 INFO L132 encePairwiseOnDemand]: 166/173 looper letters, 12 selfloop transitions, 11 changer transitions 2/41 dead transitions. [2020-10-16 04:51:51,152 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 296 flow [2020-10-16 04:51:51,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:51:51,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:51:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 889 transitions. [2020-10-16 04:51:51,155 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7341040462427746 [2020-10-16 04:51:51,156 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 889 transitions. [2020-10-16 04:51:51,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 889 transitions. [2020-10-16 04:51:51,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:51,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 889 transitions. [2020-10-16 04:51:51,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:51:51,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:51:51,160 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:51:51,161 INFO L185 Difference]: Start difference. First operand has 52 places, 34 transitions, 197 flow. Second operand 7 states and 889 transitions. [2020-10-16 04:51:51,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 296 flow [2020-10-16 04:51:51,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 41 transitions, 271 flow, removed 7 selfloop flow, removed 3 redundant places. [2020-10-16 04:51:51,166 INFO L241 Difference]: Finished difference. Result has 56 places, 36 transitions, 238 flow [2020-10-16 04:51:51,166 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=238, PETRI_PLACES=56, PETRI_TRANSITIONS=36} [2020-10-16 04:51:51,166 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2020-10-16 04:51:51,167 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 238 flow [2020-10-16 04:51:51,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:51:51,167 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:51,167 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:51,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:51:51,167 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:51,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:51,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1647220356, now seen corresponding path program 2 times [2020-10-16 04:51:51,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:51,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747221278] [2020-10-16 04:51:51,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:51,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747221278] [2020-10-16 04:51:51,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:51,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:51:51,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088819602] [2020-10-16 04:51:51,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:51:51,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:51,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:51:51,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:51:51,326 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 173 [2020-10-16 04:51:51,327 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 36 transitions, 238 flow. Second operand 7 states. [2020-10-16 04:51:51,327 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:51,328 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 173 [2020-10-16 04:51:51,328 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:51,673 INFO L129 PetriNetUnfolder]: 74/213 cut-off events. [2020-10-16 04:51:51,674 INFO L130 PetriNetUnfolder]: For 932/976 co-relation queries the response was YES. [2020-10-16 04:51:51,676 INFO L80 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 213 events. 74/213 cut-off events. For 932/976 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1155 event pairs, 12 based on Foata normal form. 24/230 useless extension candidates. Maximal degree in co-relation 882. Up to 108 conditions per place. [2020-10-16 04:51:51,679 INFO L132 encePairwiseOnDemand]: 165/173 looper letters, 19 selfloop transitions, 12 changer transitions 2/49 dead transitions. [2020-10-16 04:51:51,680 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 422 flow [2020-10-16 04:51:51,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:51:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:51:51,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 853 transitions. [2020-10-16 04:51:51,685 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7043765483071841 [2020-10-16 04:51:51,685 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 853 transitions. [2020-10-16 04:51:51,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 853 transitions. [2020-10-16 04:51:51,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:51,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 853 transitions. [2020-10-16 04:51:51,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:51:51,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:51:51,693 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:51:51,693 INFO L185 Difference]: Start difference. First operand has 56 places, 36 transitions, 238 flow. Second operand 7 states and 853 transitions. [2020-10-16 04:51:51,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 422 flow [2020-10-16 04:51:51,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 49 transitions, 371 flow, removed 17 selfloop flow, removed 5 redundant places. [2020-10-16 04:51:51,702 INFO L241 Difference]: Finished difference. Result has 59 places, 44 transitions, 326 flow [2020-10-16 04:51:51,703 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=326, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2020-10-16 04:51:51,703 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2020-10-16 04:51:51,703 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 326 flow [2020-10-16 04:51:51,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:51:51,704 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:51,704 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:51,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:51:51,705 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:51,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:51,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1093399224, now seen corresponding path program 3 times [2020-10-16 04:51:51,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:51,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984311494] [2020-10-16 04:51:51,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:51,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984311494] [2020-10-16 04:51:51,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:51,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:51:51,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830908255] [2020-10-16 04:51:51,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:51:51,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:51,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:51:51,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:51:51,896 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 173 [2020-10-16 04:51:51,897 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 326 flow. Second operand 8 states. [2020-10-16 04:51:51,898 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:51,898 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 173 [2020-10-16 04:51:51,898 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:52,307 INFO L129 PetriNetUnfolder]: 72/207 cut-off events. [2020-10-16 04:51:52,307 INFO L130 PetriNetUnfolder]: For 864/915 co-relation queries the response was YES. [2020-10-16 04:51:52,309 INFO L80 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 207 events. 72/207 cut-off events. For 864/915 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1089 event pairs, 6 based on Foata normal form. 27/224 useless extension candidates. Maximal degree in co-relation 920. Up to 78 conditions per place. [2020-10-16 04:51:52,311 INFO L132 encePairwiseOnDemand]: 165/173 looper letters, 17 selfloop transitions, 18 changer transitions 4/55 dead transitions. [2020-10-16 04:51:52,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 55 transitions, 501 flow [2020-10-16 04:51:52,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:51:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:51:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1089 transitions. [2020-10-16 04:51:52,316 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6994219653179191 [2020-10-16 04:51:52,317 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1089 transitions. [2020-10-16 04:51:52,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1089 transitions. [2020-10-16 04:51:52,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:52,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1089 transitions. [2020-10-16 04:51:52,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:51:52,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:51:52,323 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:51:52,324 INFO L185 Difference]: Start difference. First operand has 59 places, 44 transitions, 326 flow. Second operand 9 states and 1089 transitions. [2020-10-16 04:51:52,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 55 transitions, 501 flow [2020-10-16 04:51:52,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 451 flow, removed 18 selfloop flow, removed 5 redundant places. [2020-10-16 04:51:52,332 INFO L241 Difference]: Finished difference. Result has 66 places, 46 transitions, 375 flow [2020-10-16 04:51:52,332 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=375, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2020-10-16 04:51:52,333 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 32 predicate places. [2020-10-16 04:51:52,333 INFO L481 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 375 flow [2020-10-16 04:51:52,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:51:52,333 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:52,333 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:52,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:51:52,334 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:52,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:52,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1381590654, now seen corresponding path program 1 times [2020-10-16 04:51:52,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:52,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349660263] [2020-10-16 04:51:52,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:52,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349660263] [2020-10-16 04:51:52,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:52,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:51:52,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763704628] [2020-10-16 04:51:52,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:51:52,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:52,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:51:52,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:51:52,434 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 173 [2020-10-16 04:51:52,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 375 flow. Second operand 4 states. [2020-10-16 04:51:52,435 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:52,435 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 173 [2020-10-16 04:51:52,435 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:52,527 INFO L129 PetriNetUnfolder]: 115/310 cut-off events. [2020-10-16 04:51:52,528 INFO L130 PetriNetUnfolder]: For 890/959 co-relation queries the response was YES. [2020-10-16 04:51:52,530 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 310 events. 115/310 cut-off events. For 890/959 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1852 event pairs, 32 based on Foata normal form. 70/356 useless extension candidates. Maximal degree in co-relation 1088. Up to 125 conditions per place. [2020-10-16 04:51:52,532 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 10 selfloop transitions, 8 changer transitions 0/56 dead transitions. [2020-10-16 04:51:52,532 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 56 transitions, 431 flow [2020-10-16 04:51:52,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:51:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:51:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2020-10-16 04:51:52,535 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8358381502890173 [2020-10-16 04:51:52,535 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2020-10-16 04:51:52,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2020-10-16 04:51:52,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:52,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2020-10-16 04:51:52,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:51:52,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:51:52,540 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:51:52,540 INFO L185 Difference]: Start difference. First operand has 66 places, 46 transitions, 375 flow. Second operand 5 states and 723 transitions. [2020-10-16 04:51:52,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 56 transitions, 431 flow [2020-10-16 04:51:52,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 56 transitions, 411 flow, removed 5 selfloop flow, removed 4 redundant places. [2020-10-16 04:51:52,547 INFO L241 Difference]: Finished difference. Result has 66 places, 53 transitions, 423 flow [2020-10-16 04:51:52,548 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=423, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2020-10-16 04:51:52,548 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 32 predicate places. [2020-10-16 04:51:52,549 INFO L481 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 423 flow [2020-10-16 04:51:52,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:51:52,549 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:52,549 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:52,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:51:52,549 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:52,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:52,550 INFO L82 PathProgramCache]: Analyzing trace with hash 225839952, now seen corresponding path program 1 times [2020-10-16 04:51:52,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:52,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160662504] [2020-10-16 04:51:52,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:52,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:52,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160662504] [2020-10-16 04:51:52,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:52,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:51:52,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384552622] [2020-10-16 04:51:52,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:51:52,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:52,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:51:52,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:51:52,637 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 173 [2020-10-16 04:51:52,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 423 flow. Second operand 5 states. [2020-10-16 04:51:52,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:52,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 173 [2020-10-16 04:51:52,638 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:52,753 INFO L129 PetriNetUnfolder]: 56/199 cut-off events. [2020-10-16 04:51:52,754 INFO L130 PetriNetUnfolder]: For 813/1221 co-relation queries the response was YES. [2020-10-16 04:51:52,756 INFO L80 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 199 events. 56/199 cut-off events. For 813/1221 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1066 event pairs, 4 based on Foata normal form. 140/325 useless extension candidates. Maximal degree in co-relation 803. Up to 98 conditions per place. [2020-10-16 04:51:52,759 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 6 selfloop transitions, 15 changer transitions 3/56 dead transitions. [2020-10-16 04:51:52,759 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 56 transitions, 456 flow [2020-10-16 04:51:52,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:51:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:51:52,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1012 transitions. [2020-10-16 04:51:52,765 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8356729975227085 [2020-10-16 04:51:52,765 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1012 transitions. [2020-10-16 04:51:52,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1012 transitions. [2020-10-16 04:51:52,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:52,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1012 transitions. [2020-10-16 04:51:52,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:51:52,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:51:52,771 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:51:52,771 INFO L185 Difference]: Start difference. First operand has 66 places, 53 transitions, 423 flow. Second operand 7 states and 1012 transitions. [2020-10-16 04:51:52,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 56 transitions, 456 flow [2020-10-16 04:51:52,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 56 transitions, 430 flow, removed 3 selfloop flow, removed 5 redundant places. [2020-10-16 04:51:52,781 INFO L241 Difference]: Finished difference. Result has 70 places, 53 transitions, 427 flow [2020-10-16 04:51:52,781 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=427, PETRI_PLACES=70, PETRI_TRANSITIONS=53} [2020-10-16 04:51:52,781 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 36 predicate places. [2020-10-16 04:51:52,781 INFO L481 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 427 flow [2020-10-16 04:51:52,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:51:52,782 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:52,782 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:52,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:51:52,782 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:52,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:52,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1602935454, now seen corresponding path program 1 times [2020-10-16 04:51:52,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:52,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510762028] [2020-10-16 04:51:52,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:52,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510762028] [2020-10-16 04:51:52,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:52,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:51:52,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752288013] [2020-10-16 04:51:52,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:51:52,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:52,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:51:52,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:51:52,889 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 173 [2020-10-16 04:51:52,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 427 flow. Second operand 4 states. [2020-10-16 04:51:52,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:52,891 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 173 [2020-10-16 04:51:52,891 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:52,975 INFO L129 PetriNetUnfolder]: 78/272 cut-off events. [2020-10-16 04:51:52,975 INFO L130 PetriNetUnfolder]: For 1221/1609 co-relation queries the response was YES. [2020-10-16 04:51:52,978 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 272 events. 78/272 cut-off events. For 1221/1609 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1682 event pairs, 4 based on Foata normal form. 22/268 useless extension candidates. Maximal degree in co-relation 1213. Up to 149 conditions per place. [2020-10-16 04:51:52,980 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 5 selfloop transitions, 3 changer transitions 2/56 dead transitions. [2020-10-16 04:51:52,980 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 56 transitions, 471 flow [2020-10-16 04:51:52,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:51:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:51:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 726 transitions. [2020-10-16 04:51:52,984 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8393063583815029 [2020-10-16 04:51:52,984 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 726 transitions. [2020-10-16 04:51:52,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 726 transitions. [2020-10-16 04:51:52,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:52,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 726 transitions. [2020-10-16 04:51:52,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:51:52,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:51:52,989 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:51:52,990 INFO L185 Difference]: Start difference. First operand has 70 places, 53 transitions, 427 flow. Second operand 5 states and 726 transitions. [2020-10-16 04:51:52,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 56 transitions, 471 flow [2020-10-16 04:51:52,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 56 transitions, 432 flow, removed 15 selfloop flow, removed 2 redundant places. [2020-10-16 04:51:53,000 INFO L241 Difference]: Finished difference. Result has 75 places, 53 transitions, 405 flow [2020-10-16 04:51:53,001 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=405, PETRI_PLACES=75, PETRI_TRANSITIONS=53} [2020-10-16 04:51:53,001 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 41 predicate places. [2020-10-16 04:51:53,001 INFO L481 AbstractCegarLoop]: Abstraction has has 75 places, 53 transitions, 405 flow [2020-10-16 04:51:53,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:51:53,001 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:53,001 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:53,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:51:53,002 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:53,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:53,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1809682900, now seen corresponding path program 1 times [2020-10-16 04:51:53,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:53,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633751971] [2020-10-16 04:51:53,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:53,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633751971] [2020-10-16 04:51:53,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:53,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:51:53,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379765736] [2020-10-16 04:51:53,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:51:53,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:53,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:51:53,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:51:53,100 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 173 [2020-10-16 04:51:53,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 53 transitions, 405 flow. Second operand 5 states. [2020-10-16 04:51:53,101 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:53,101 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 173 [2020-10-16 04:51:53,101 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:53,211 INFO L129 PetriNetUnfolder]: 143/454 cut-off events. [2020-10-16 04:51:53,212 INFO L130 PetriNetUnfolder]: For 1542/1636 co-relation queries the response was YES. [2020-10-16 04:51:53,215 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 454 events. 143/454 cut-off events. For 1542/1636 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 3281 event pairs, 9 based on Foata normal form. 29/441 useless extension candidates. Maximal degree in co-relation 1719. Up to 139 conditions per place. [2020-10-16 04:51:53,217 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 6 selfloop transitions, 1 changer transitions 2/57 dead transitions. [2020-10-16 04:51:53,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 57 transitions, 463 flow [2020-10-16 04:51:53,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:51:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:51:53,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2020-10-16 04:51:53,220 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8265895953757225 [2020-10-16 04:51:53,220 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 715 transitions. [2020-10-16 04:51:53,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 715 transitions. [2020-10-16 04:51:53,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:53,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 715 transitions. [2020-10-16 04:51:53,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:51:53,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:51:53,224 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:51:53,225 INFO L185 Difference]: Start difference. First operand has 75 places, 53 transitions, 405 flow. Second operand 5 states and 715 transitions. [2020-10-16 04:51:53,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 57 transitions, 463 flow [2020-10-16 04:51:53,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 57 transitions, 450 flow, removed 5 selfloop flow, removed 3 redundant places. [2020-10-16 04:51:53,236 INFO L241 Difference]: Finished difference. Result has 77 places, 53 transitions, 405 flow [2020-10-16 04:51:53,236 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=405, PETRI_PLACES=77, PETRI_TRANSITIONS=53} [2020-10-16 04:51:53,236 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 43 predicate places. [2020-10-16 04:51:53,236 INFO L481 AbstractCegarLoop]: Abstraction has has 77 places, 53 transitions, 405 flow [2020-10-16 04:51:53,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:51:53,237 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:53,237 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:53,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:51:53,237 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:53,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:53,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1848599362, now seen corresponding path program 2 times [2020-10-16 04:51:53,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:53,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320772681] [2020-10-16 04:51:53,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:53,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:53,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320772681] [2020-10-16 04:51:53,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:53,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:51:53,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976596116] [2020-10-16 04:51:53,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:51:53,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:53,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:51:53,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:51:53,302 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 173 [2020-10-16 04:51:53,302 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 53 transitions, 405 flow. Second operand 6 states. [2020-10-16 04:51:53,302 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:53,303 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 173 [2020-10-16 04:51:53,303 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:53,456 INFO L129 PetriNetUnfolder]: 69/257 cut-off events. [2020-10-16 04:51:53,457 INFO L130 PetriNetUnfolder]: For 1117/1499 co-relation queries the response was YES. [2020-10-16 04:51:53,458 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 257 events. 69/257 cut-off events. For 1117/1499 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1718 event pairs, 0 based on Foata normal form. 201/438 useless extension candidates. Maximal degree in co-relation 1055. Up to 90 conditions per place. [2020-10-16 04:51:53,459 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 2 selfloop transitions, 17 changer transitions 15/55 dead transitions. [2020-10-16 04:51:53,459 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 55 transitions, 459 flow [2020-10-16 04:51:53,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:51:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:51:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1295 transitions. [2020-10-16 04:51:53,463 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.831727681438664 [2020-10-16 04:51:53,463 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1295 transitions. [2020-10-16 04:51:53,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1295 transitions. [2020-10-16 04:51:53,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:53,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1295 transitions. [2020-10-16 04:51:53,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:51:53,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:51:53,470 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:51:53,470 INFO L185 Difference]: Start difference. First operand has 77 places, 53 transitions, 405 flow. Second operand 9 states and 1295 transitions. [2020-10-16 04:51:53,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 55 transitions, 459 flow [2020-10-16 04:51:53,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 55 transitions, 416 flow, removed 11 selfloop flow, removed 9 redundant places. [2020-10-16 04:51:53,476 INFO L241 Difference]: Finished difference. Result has 77 places, 40 transitions, 300 flow [2020-10-16 04:51:53,476 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=300, PETRI_PLACES=77, PETRI_TRANSITIONS=40} [2020-10-16 04:51:53,476 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 43 predicate places. [2020-10-16 04:51:53,476 INFO L481 AbstractCegarLoop]: Abstraction has has 77 places, 40 transitions, 300 flow [2020-10-16 04:51:53,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:51:53,476 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:53,477 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:53,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 04:51:53,477 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:53,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:53,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1426286347, now seen corresponding path program 1 times [2020-10-16 04:51:53,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:53,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909839037] [2020-10-16 04:51:53,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:51:53,511 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:51:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:51:53,540 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:51:53,574 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:51:53,574 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:51:53,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 04:51:53,601 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,601 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,603 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,603 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,603 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,603 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,604 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,604 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,604 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,605 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,605 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,605 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,605 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,605 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,606 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,606 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,606 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,606 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,607 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,607 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,607 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,607 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,607 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,608 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,608 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,609 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,609 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,609 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,609 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,609 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,609 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,609 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,610 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,610 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,610 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,610 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,614 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,615 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,615 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,615 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,615 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,615 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,615 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,616 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,616 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,616 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,616 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,616 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,616 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,617 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,617 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,617 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,617 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,617 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,617 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,618 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,618 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:53,618 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:53,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:51:53 BasicIcfg [2020-10-16 04:51:53,712 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:51:53,714 INFO L168 Benchmark]: Toolchain (without parser) took 13354.05 ms. Allocated memory was 244.3 MB in the beginning and 584.6 MB in the end (delta: 340.3 MB). Free memory was 198.7 MB in the beginning and 508.9 MB in the end (delta: -310.2 MB). Peak memory consumption was 30.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:51:53,714 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 244.3 MB. Free memory is still 220.7 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:51:53,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.34 ms. Allocated memory was 244.3 MB in the beginning and 295.2 MB in the end (delta: 50.9 MB). Free memory was 198.7 MB in the beginning and 246.0 MB in the end (delta: -47.3 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. [2020-10-16 04:51:53,716 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.36 ms. Allocated memory is still 295.2 MB. Free memory was 246.0 MB in the beginning and 240.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:51:53,717 INFO L168 Benchmark]: Boogie Preprocessor took 55.96 ms. Allocated memory is still 295.2 MB. Free memory was 240.9 MB in the beginning and 238.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:51:53,717 INFO L168 Benchmark]: RCFGBuilder took 1957.91 ms. Allocated memory was 295.2 MB in the beginning and 350.2 MB in the end (delta: 55.1 MB). Free memory was 238.4 MB in the beginning and 203.1 MB in the end (delta: 35.3 MB). Peak memory consumption was 97.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:51:53,718 INFO L168 Benchmark]: TraceAbstraction took 10478.91 ms. Allocated memory was 350.2 MB in the beginning and 584.6 MB in the end (delta: 234.4 MB). Free memory was 203.1 MB in the beginning and 508.9 MB in the end (delta: -305.8 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:51:53,722 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 244.3 MB. Free memory is still 220.7 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 782.34 ms. Allocated memory was 244.3 MB in the beginning and 295.2 MB in the end (delta: 50.9 MB). Free memory was 198.7 MB in the beginning and 246.0 MB in the end (delta: -47.3 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 73.36 ms. Allocated memory is still 295.2 MB. Free memory was 246.0 MB in the beginning and 240.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 55.96 ms. Allocated memory is still 295.2 MB. Free memory was 240.9 MB in the beginning and 238.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1957.91 ms. Allocated memory was 295.2 MB in the beginning and 350.2 MB in the end (delta: 55.1 MB). Free memory was 238.4 MB in the beginning and 203.1 MB in the end (delta: 35.3 MB). Peak memory consumption was 97.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 10478.91 ms. Allocated memory was 350.2 MB in the beginning and 584.6 MB in the end (delta: 234.4 MB). Free memory was 203.1 MB in the beginning and 508.9 MB in the end (delta: -305.8 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1190 VarBasedMoverChecksPositive, 63 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 172 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.5s, 100 PlacesBefore, 34 PlacesAfterwards, 92 TransitionsBefore, 25 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 4043 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L702] 0 int __unbuffered_p2_EBX = 0; [L704] 0 int a = 0; [L705] 0 _Bool main$tmp_guard0; [L706] 0 _Bool main$tmp_guard1; [L708] 0 int x = 0; [L710] 0 int y = 0; [L711] 0 _Bool y$flush_delayed; [L712] 0 int y$mem_tmp; [L713] 0 _Bool y$r_buff0_thd0; [L714] 0 _Bool y$r_buff0_thd1; [L715] 0 _Bool y$r_buff0_thd2; [L716] 0 _Bool y$r_buff0_thd3; [L717] 0 _Bool y$r_buff1_thd0; [L718] 0 _Bool y$r_buff1_thd1; [L719] 0 _Bool y$r_buff1_thd2; [L720] 0 _Bool y$r_buff1_thd3; [L721] 0 _Bool y$read_delayed; [L722] 0 int *y$read_delayed_var; [L723] 0 int y$w_buff0; [L724] 0 _Bool y$w_buff0_used; [L725] 0 int y$w_buff1; [L726] 0 _Bool y$w_buff1_used; [L728] 0 int z = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L812] 0 pthread_t t1196; [L813] FCALL, FORK 0 pthread_create(&t1196, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] 0 pthread_t t1197; [L815] FCALL, FORK 0 pthread_create(&t1197, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] 0 pthread_t t1198; [L817] FCALL, FORK 0 pthread_create(&t1198, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L769] 3 y$w_buff1 = y$w_buff0 [L770] 3 y$w_buff0 = 2 [L771] 3 y$w_buff1_used = y$w_buff0_used [L772] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L774] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L775] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L776] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L777] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L778] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 z = 1 [L784] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L744] 1 return 0; [L749] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L755] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L755] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L758] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L759] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L762] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 2 return 0; [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L794] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L819] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L827] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L830] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 0 y$flush_delayed = weak$$choice2 [L833] 0 y$mem_tmp = y [L834] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L835] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L842] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L842] 0 y = y$flush_delayed ? y$mem_tmp : y [L843] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 10.2s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 68 SDtfs, 53 SDslu, 75 SDs, 0 SdLazy, 405 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=427occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 18902 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...