/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/safe008_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 05:02:48,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 05:02:48,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 05:02:48,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 05:02:48,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 05:02:48,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 05:02:48,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 05:02:48,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 05:02:48,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 05:02:48,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 05:02:48,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 05:02:48,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 05:02:48,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 05:02:48,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 05:02:48,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 05:02:48,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 05:02:48,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 05:02:48,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 05:02:48,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 05:02:48,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 05:02:48,131 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 05:02:48,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 05:02:48,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 05:02:48,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 05:02:48,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 05:02:48,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 05:02:48,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 05:02:48,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 05:02:48,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 05:02:48,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 05:02:48,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 05:02:48,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 05:02:48,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 05:02:48,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 05:02:48,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 05:02:48,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 05:02:48,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 05:02:48,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 05:02:48,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 05:02:48,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 05:02:48,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 05:02:48,166 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 05:02:48,209 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 05:02:48,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 05:02:48,210 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 05:02:48,211 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 05:02:48,211 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 05:02:48,211 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 05:02:48,211 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 05:02:48,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 05:02:48,212 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 05:02:48,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 05:02:48,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 05:02:48,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 05:02:48,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 05:02:48,214 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 05:02:48,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 05:02:48,215 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 05:02:48,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 05:02:48,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 05:02:48,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 05:02:48,215 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 05:02:48,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 05:02:48,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:02:48,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 05:02:48,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 05:02:48,217 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 05:02:48,217 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 05:02:48,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 05:02:48,217 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 05:02:48,217 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 05:02:48,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 05:02:48,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 05:02:48,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 05:02:48,567 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 05:02:48,568 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 05:02:48,569 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.oepc.i [2020-10-16 05:02:48,625 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9e50f5b4/1e5f6e703cbc44379aae1c76d797becf/FLAG44e830055 [2020-10-16 05:02:49,206 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 05:02:49,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_pso.oepc.i [2020-10-16 05:02:49,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9e50f5b4/1e5f6e703cbc44379aae1c76d797becf/FLAG44e830055 [2020-10-16 05:02:49,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9e50f5b4/1e5f6e703cbc44379aae1c76d797becf [2020-10-16 05:02:49,456 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 05:02:49,458 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 05:02:49,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 05:02:49,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 05:02:49,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 05:02:49,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:02:49" (1/1) ... [2020-10-16 05:02:49,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b6f427d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:02:49, skipping insertion in model container [2020-10-16 05:02:49,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:02:49" (1/1) ... [2020-10-16 05:02:49,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 05:02:49,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 05:02:50,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:02:50,058 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 05:02:50,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:02:50,206 INFO L208 MainTranslator]: Completed translation [2020-10-16 05:02:50,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:02:50 WrapperNode [2020-10-16 05:02:50,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 05:02:50,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 05:02:50,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 05:02:50,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 05:02:50,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:02:50" (1/1) ... [2020-10-16 05:02:50,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:02:50" (1/1) ... [2020-10-16 05:02:50,272 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 05:02:50,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 05:02:50,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 05:02:50,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 05:02:50,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:02:50" (1/1) ... [2020-10-16 05:02:50,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:02:50" (1/1) ... [2020-10-16 05:02:50,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:02:50" (1/1) ... [2020-10-16 05:02:50,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:02:50" (1/1) ... [2020-10-16 05:02:50,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:02:50" (1/1) ... [2020-10-16 05:02:50,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:02:50" (1/1) ... [2020-10-16 05:02:50,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:02:50" (1/1) ... [2020-10-16 05:02:50,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 05:02:50,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 05:02:50,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 05:02:50,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 05:02:50,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:02:50" (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 05:02:50,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 05:02:50,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 05:02:50,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 05:02:50,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 05:02:50,384 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 05:02:50,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 05:02:50,385 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 05:02:50,385 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 05:02:50,385 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 05:02:50,385 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 05:02:50,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 05:02:50,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 05:02:50,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 05:02:50,388 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 05:02:52,490 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 05:02:52,490 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 05:02:52,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:02:52 BoogieIcfgContainer [2020-10-16 05:02:52,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 05:02:52,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 05:02:52,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 05:02:52,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 05:02:52,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:02:49" (1/3) ... [2020-10-16 05:02:52,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c0e105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:02:52, skipping insertion in model container [2020-10-16 05:02:52,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:02:50" (2/3) ... [2020-10-16 05:02:52,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c0e105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:02:52, skipping insertion in model container [2020-10-16 05:02:52,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:02:52" (3/3) ... [2020-10-16 05:02:52,502 INFO L111 eAbstractionObserver]: Analyzing ICFG safe008_pso.oepc.i [2020-10-16 05:02:52,515 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 05:02:52,523 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 05:02:52,525 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 05:02:52,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,559 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,559 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,560 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,560 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,561 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,561 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,561 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,562 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,562 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,562 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,562 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,563 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,563 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,563 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,564 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,565 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,565 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,569 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,569 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,577 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,578 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,585 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,585 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,586 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,591 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,592 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:02:52,615 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 05:02:52,639 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 05:02:52,640 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 05:02:52,640 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 05:02:52,640 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 05:02:52,640 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 05:02:52,640 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 05:02:52,641 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 05:02:52,641 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 05:02:52,658 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-16 05:02:52,710 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-16 05:02:52,711 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:02:52,716 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 05:02:52,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 93 transitions, 201 flow [2020-10-16 05:02:52,725 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 90 transitions, 189 flow [2020-10-16 05:02:52,728 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 05:02:52,731 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 189 flow [2020-10-16 05:02:52,734 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 90 transitions, 189 flow [2020-10-16 05:02:52,735 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 189 flow [2020-10-16 05:02:52,762 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-16 05:02:52,762 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:02:52,763 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 05:02:52,766 INFO L117 LiptonReduction]: Number of co-enabled transitions 1650 [2020-10-16 05:02:52,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:02:52,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:53,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:53,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:53,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:53,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:53,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:53,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:53,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:53,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:53,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:53,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:53,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:53,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:53,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:53,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:53,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:53,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:53,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:53,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:53,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:53,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:53,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:53,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:53,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:53,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:53,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:53,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:53,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:53,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:53,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:53,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:53,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:53,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:53,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:53,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:53,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:53,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:53,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:53,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:53,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:53,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:53,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:53,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:53,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:53,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:53,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:53,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:53,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:53,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:53,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:02:53,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:02:53,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:02:53,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:02:53,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:02:53,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:02:53,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:02:53,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:02:55,018 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-16 05:02:55,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 05:02:55,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:02:55,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:02:55,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:02:55,878 WARN L193 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-16 05:02:55,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:02:55,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:56,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:56,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:56,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:56,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:56,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:56,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:56,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:56,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:56,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:56,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:56,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:56,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:56,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:56,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:56,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:56,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:56,641 WARN L193 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 05:02:56,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:56,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:56,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:56,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:56,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:56,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:56,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:56,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:56,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:56,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:56,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:56,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:56,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:56,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:56,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:56,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:56,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:02:56,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:57,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:57,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:57,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:57,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:57,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:57,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:57,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:57,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:02:57,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:57,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:02:57,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:57,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:57,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:57,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:57,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:02:57,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:57,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:57,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:57,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:57,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:02:57,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:02:57,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:02:57,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:02:57,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:02:57,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:02:57,932 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-16 05:02:58,037 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-16 05:02:58,261 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-16 05:02:58,398 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 05:02:58,405 INFO L132 LiptonReduction]: Checked pairs total: 4509 [2020-10-16 05:02:58,405 INFO L134 LiptonReduction]: Total number of compositions: 75 [2020-10-16 05:02:58,422 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5697 [2020-10-16 05:02:58,439 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2020-10-16 05:02:58,439 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:02:58,439 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:02:58,440 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 05:02:58,443 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:02:58,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:02:58,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1042199, now seen corresponding path program 1 times [2020-10-16 05:02:58,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:02:58,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712554068] [2020-10-16 05:02:58,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:02:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:02:58,792 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 05:02:58,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712554068] [2020-10-16 05:02:58,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:02:58,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:02:58,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060757697] [2020-10-16 05:02:58,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:02:58,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:02:58,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:02:58,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:02:58,828 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 168 [2020-10-16 05:02:58,833 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states. [2020-10-16 05:02:58,833 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:02:58,833 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 168 [2020-10-16 05:02:58,835 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:02:58,964 INFO L129 PetriNetUnfolder]: 49/134 cut-off events. [2020-10-16 05:02:58,964 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:02:58,966 INFO L80 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 134 events. 49/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 596 event pairs, 38 based on Foata normal form. 11/127 useless extension candidates. Maximal degree in co-relation 220. Up to 65 conditions per place. [2020-10-16 05:02:58,969 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 9 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2020-10-16 05:02:58,970 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 85 flow [2020-10-16 05:02:58,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:02:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:02:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2020-10-16 05:02:58,995 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8670634920634921 [2020-10-16 05:02:58,996 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2020-10-16 05:02:58,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2020-10-16 05:02:59,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:02:59,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2020-10-16 05:02:59,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:02:59,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:02:59,017 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:02:59,020 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 437 transitions. [2020-10-16 05:02:59,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 85 flow [2020-10-16 05:02:59,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 05:02:59,026 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2020-10-16 05:02:59,028 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, 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 05:02:59,029 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2020-10-16 05:02:59,030 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2020-10-16 05:02:59,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:02:59,030 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:02:59,030 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:02:59,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 05:02:59,031 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:02:59,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:02:59,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1791790612, now seen corresponding path program 1 times [2020-10-16 05:02:59,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:02:59,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872517835] [2020-10-16 05:02:59,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:02:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:02:59,167 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 05:02:59,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872517835] [2020-10-16 05:02:59,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:02:59,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:02:59,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345825888] [2020-10-16 05:02:59,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:02:59,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:02:59,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:02:59,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:02:59,172 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 168 [2020-10-16 05:02:59,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand 4 states. [2020-10-16 05:02:59,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:02:59,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 168 [2020-10-16 05:02:59,173 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:02:59,330 INFO L129 PetriNetUnfolder]: 183/372 cut-off events. [2020-10-16 05:02:59,330 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2020-10-16 05:02:59,332 INFO L80 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 372 events. 183/372 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2020 event pairs, 115 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 712. Up to 213 conditions per place. [2020-10-16 05:02:59,334 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 10 selfloop transitions, 3 changer transitions 12/38 dead transitions. [2020-10-16 05:02:59,334 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 142 flow [2020-10-16 05:02:59,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:02:59,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:02:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2020-10-16 05:02:59,337 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7880952380952381 [2020-10-16 05:02:59,337 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2020-10-16 05:02:59,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2020-10-16 05:02:59,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:02:59,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2020-10-16 05:02:59,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:02:59,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:02:59,342 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:02:59,342 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 662 transitions. [2020-10-16 05:02:59,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 142 flow [2020-10-16 05:02:59,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:02:59,344 INFO L241 Difference]: Finished difference. Result has 37 places, 24 transitions, 77 flow [2020-10-16 05:02:59,345 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2020-10-16 05:02:59,345 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2020-10-16 05:02:59,345 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 77 flow [2020-10-16 05:02:59,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:02:59,346 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:02:59,346 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:02:59,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 05:02:59,346 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:02:59,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:02:59,347 INFO L82 PathProgramCache]: Analyzing trace with hash -289853304, now seen corresponding path program 1 times [2020-10-16 05:02:59,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:02:59,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452272286] [2020-10-16 05:02:59,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:02:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:02:59,499 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 05:02:59,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452272286] [2020-10-16 05:02:59,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:02:59,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:02:59,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913537015] [2020-10-16 05:02:59,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:02:59,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:02:59,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:02:59,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:02:59,502 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 168 [2020-10-16 05:02:59,503 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 77 flow. Second operand 5 states. [2020-10-16 05:02:59,503 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:02:59,503 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 168 [2020-10-16 05:02:59,504 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:02:59,562 INFO L129 PetriNetUnfolder]: 7/52 cut-off events. [2020-10-16 05:02:59,563 INFO L130 PetriNetUnfolder]: For 17/19 co-relation queries the response was YES. [2020-10-16 05:02:59,563 INFO L80 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 52 events. 7/52 cut-off events. For 17/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 157 event pairs, 1 based on Foata normal form. 2/53 useless extension candidates. Maximal degree in co-relation 103. Up to 15 conditions per place. [2020-10-16 05:02:59,564 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 6 selfloop transitions, 3 changer transitions 2/27 dead transitions. [2020-10-16 05:02:59,564 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 111 flow [2020-10-16 05:02:59,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:02:59,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:02:59,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 657 transitions. [2020-10-16 05:02:59,567 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7821428571428571 [2020-10-16 05:02:59,567 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 657 transitions. [2020-10-16 05:02:59,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 657 transitions. [2020-10-16 05:02:59,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:02:59,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 657 transitions. [2020-10-16 05:02:59,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:02:59,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:02:59,571 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:02:59,571 INFO L185 Difference]: Start difference. First operand has 37 places, 24 transitions, 77 flow. Second operand 5 states and 657 transitions. [2020-10-16 05:02:59,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 111 flow [2020-10-16 05:02:59,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 102 flow, removed 3 selfloop flow, removed 2 redundant places. [2020-10-16 05:02:59,574 INFO L241 Difference]: Finished difference. Result has 39 places, 24 transitions, 85 flow [2020-10-16 05:02:59,574 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2020-10-16 05:02:59,574 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2020-10-16 05:02:59,574 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 85 flow [2020-10-16 05:02:59,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:02:59,575 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:02:59,575 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:02:59,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 05:02:59,575 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:02:59,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:02:59,576 INFO L82 PathProgramCache]: Analyzing trace with hash -289086426, now seen corresponding path program 1 times [2020-10-16 05:02:59,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:02:59,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904645373] [2020-10-16 05:02:59,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:02:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:02:59,657 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 05:02:59,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904645373] [2020-10-16 05:02:59,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:02:59,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:02:59,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725843077] [2020-10-16 05:02:59,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:02:59,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:02:59,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:02:59,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:02:59,661 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 168 [2020-10-16 05:02:59,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 85 flow. Second operand 5 states. [2020-10-16 05:02:59,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:02:59,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 168 [2020-10-16 05:02:59,662 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:02:59,846 INFO L129 PetriNetUnfolder]: 149/304 cut-off events. [2020-10-16 05:02:59,846 INFO L130 PetriNetUnfolder]: For 244/250 co-relation queries the response was YES. [2020-10-16 05:02:59,848 INFO L80 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 304 events. 149/304 cut-off events. For 244/250 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1534 event pairs, 93 based on Foata normal form. 18/313 useless extension candidates. Maximal degree in co-relation 710. Up to 206 conditions per place. [2020-10-16 05:02:59,851 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 11 selfloop transitions, 4 changer transitions 9/38 dead transitions. [2020-10-16 05:02:59,851 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 179 flow [2020-10-16 05:02:59,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:02:59,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:02:59,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2020-10-16 05:02:59,855 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7547619047619047 [2020-10-16 05:02:59,855 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2020-10-16 05:02:59,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2020-10-16 05:02:59,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:02:59,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2020-10-16 05:02:59,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:02:59,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:02:59,859 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:02:59,859 INFO L185 Difference]: Start difference. First operand has 39 places, 24 transitions, 85 flow. Second operand 5 states and 634 transitions. [2020-10-16 05:02:59,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 179 flow [2020-10-16 05:02:59,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 169 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 05:02:59,863 INFO L241 Difference]: Finished difference. Result has 40 places, 27 transitions, 115 flow [2020-10-16 05:02:59,863 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2020-10-16 05:02:59,864 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2020-10-16 05:02:59,864 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 115 flow [2020-10-16 05:02:59,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:02:59,864 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:02:59,864 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:02:59,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 05:02:59,865 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:02:59,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:02:59,865 INFO L82 PathProgramCache]: Analyzing trace with hash -2017615678, now seen corresponding path program 1 times [2020-10-16 05:02:59,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:02:59,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915680116] [2020-10-16 05:02:59,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:02:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:00,002 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 05:03:00,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915680116] [2020-10-16 05:03:00,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:00,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:03:00,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724313066] [2020-10-16 05:03:00,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:03:00,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:00,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:03:00,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:03:00,007 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 168 [2020-10-16 05:03:00,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 115 flow. Second operand 6 states. [2020-10-16 05:03:00,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:00,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 168 [2020-10-16 05:03:00,008 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:00,436 INFO L129 PetriNetUnfolder]: 225/458 cut-off events. [2020-10-16 05:03:00,436 INFO L130 PetriNetUnfolder]: For 556/559 co-relation queries the response was YES. [2020-10-16 05:03:00,438 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 458 events. 225/458 cut-off events. For 556/559 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2535 event pairs, 31 based on Foata normal form. 32/482 useless extension candidates. Maximal degree in co-relation 1214. Up to 161 conditions per place. [2020-10-16 05:03:00,441 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 17 selfloop transitions, 9 changer transitions 20/59 dead transitions. [2020-10-16 05:03:00,441 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 334 flow [2020-10-16 05:03:00,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:03:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:03:00,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1080 transitions. [2020-10-16 05:03:00,446 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2020-10-16 05:03:00,447 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1080 transitions. [2020-10-16 05:03:00,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1080 transitions. [2020-10-16 05:03:00,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:00,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1080 transitions. [2020-10-16 05:03:00,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:03:00,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:03:00,454 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:03:00,454 INFO L185 Difference]: Start difference. First operand has 40 places, 27 transitions, 115 flow. Second operand 9 states and 1080 transitions. [2020-10-16 05:03:00,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 334 flow [2020-10-16 05:03:00,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 324 flow, removed 3 selfloop flow, removed 2 redundant places. [2020-10-16 05:03:00,458 INFO L241 Difference]: Finished difference. Result has 51 places, 31 transitions, 184 flow [2020-10-16 05:03:00,459 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=51, PETRI_TRANSITIONS=31} [2020-10-16 05:03:00,459 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2020-10-16 05:03:00,459 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 31 transitions, 184 flow [2020-10-16 05:03:00,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:03:00,459 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:00,460 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:00,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 05:03:00,460 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:03:00,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:00,460 INFO L82 PathProgramCache]: Analyzing trace with hash 617888698, now seen corresponding path program 1 times [2020-10-16 05:03:00,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:00,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602075898] [2020-10-16 05:03:00,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:00,555 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 05:03:00,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602075898] [2020-10-16 05:03:00,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:00,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:03:00,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953902519] [2020-10-16 05:03:00,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:03:00,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:00,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:03:00,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:03:00,558 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 168 [2020-10-16 05:03:00,559 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 31 transitions, 184 flow. Second operand 6 states. [2020-10-16 05:03:00,559 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:00,559 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 168 [2020-10-16 05:03:00,559 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:00,771 INFO L129 PetriNetUnfolder]: 189/406 cut-off events. [2020-10-16 05:03:00,772 INFO L130 PetriNetUnfolder]: For 1280/1288 co-relation queries the response was YES. [2020-10-16 05:03:00,774 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 406 events. 189/406 cut-off events. For 1280/1288 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2288 event pairs, 136 based on Foata normal form. 23/393 useless extension candidates. Maximal degree in co-relation 1170. Up to 254 conditions per place. [2020-10-16 05:03:00,777 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 12 selfloop transitions, 6 changer transitions 8/42 dead transitions. [2020-10-16 05:03:00,777 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 42 transitions, 286 flow [2020-10-16 05:03:00,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:03:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:03:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2020-10-16 05:03:00,780 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7309523809523809 [2020-10-16 05:03:00,781 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2020-10-16 05:03:00,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2020-10-16 05:03:00,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:00,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2020-10-16 05:03:00,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:03:00,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:03:00,785 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:03:00,785 INFO L185 Difference]: Start difference. First operand has 51 places, 31 transitions, 184 flow. Second operand 5 states and 614 transitions. [2020-10-16 05:03:00,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 42 transitions, 286 flow [2020-10-16 05:03:00,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 42 transitions, 247 flow, removed 17 selfloop flow, removed 6 redundant places. [2020-10-16 05:03:00,791 INFO L241 Difference]: Finished difference. Result has 48 places, 31 transitions, 177 flow [2020-10-16 05:03:00,791 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2020-10-16 05:03:00,792 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2020-10-16 05:03:00,792 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 177 flow [2020-10-16 05:03:00,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:03:00,792 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:00,792 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:00,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 05:03:00,793 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:03:00,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:00,793 INFO L82 PathProgramCache]: Analyzing trace with hash -2014846908, now seen corresponding path program 1 times [2020-10-16 05:03:00,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:00,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809385005] [2020-10-16 05:03:00,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:00,859 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 05:03:00,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809385005] [2020-10-16 05:03:00,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:00,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:03:00,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188310576] [2020-10-16 05:03:00,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:03:00,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:00,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:03:00,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:03:00,862 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2020-10-16 05:03:00,863 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 177 flow. Second operand 5 states. [2020-10-16 05:03:00,863 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:00,863 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2020-10-16 05:03:00,863 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:00,931 INFO L129 PetriNetUnfolder]: 5/69 cut-off events. [2020-10-16 05:03:00,932 INFO L130 PetriNetUnfolder]: For 238/320 co-relation queries the response was YES. [2020-10-16 05:03:00,932 INFO L80 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 69 events. 5/69 cut-off events. For 238/320 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 306 event pairs, 0 based on Foata normal form. 6/74 useless extension candidates. Maximal degree in co-relation 169. Up to 15 conditions per place. [2020-10-16 05:03:00,933 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 2 selfloop transitions, 3 changer transitions 13/35 dead transitions. [2020-10-16 05:03:00,933 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 35 transitions, 235 flow [2020-10-16 05:03:00,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:03:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:03:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 821 transitions. [2020-10-16 05:03:00,936 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.814484126984127 [2020-10-16 05:03:00,937 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 821 transitions. [2020-10-16 05:03:00,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 821 transitions. [2020-10-16 05:03:00,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:00,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 821 transitions. [2020-10-16 05:03:00,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:03:00,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:03:00,941 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:03:00,942 INFO L185 Difference]: Start difference. First operand has 48 places, 31 transitions, 177 flow. Second operand 6 states and 821 transitions. [2020-10-16 05:03:00,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 35 transitions, 235 flow [2020-10-16 05:03:00,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 35 transitions, 211 flow, removed 6 selfloop flow, removed 5 redundant places. [2020-10-16 05:03:00,944 INFO L241 Difference]: Finished difference. Result has 50 places, 22 transitions, 108 flow [2020-10-16 05:03:00,945 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=108, PETRI_PLACES=50, PETRI_TRANSITIONS=22} [2020-10-16 05:03:00,945 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2020-10-16 05:03:00,945 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 22 transitions, 108 flow [2020-10-16 05:03:00,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:03:00,945 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:00,945 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:00,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 05:03:00,946 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:03:00,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:00,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1837851229, now seen corresponding path program 1 times [2020-10-16 05:03:00,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:00,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563126766] [2020-10-16 05:03:00,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:01,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 05:03:01,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563126766] [2020-10-16 05:03:01,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:01,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:03:01,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738271321] [2020-10-16 05:03:01,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:03:01,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:01,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:03:01,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:03:01,102 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 168 [2020-10-16 05:03:01,103 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 22 transitions, 108 flow. Second operand 6 states. [2020-10-16 05:03:01,103 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:01,103 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 168 [2020-10-16 05:03:01,103 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:01,309 INFO L129 PetriNetUnfolder]: 73/169 cut-off events. [2020-10-16 05:03:01,309 INFO L130 PetriNetUnfolder]: For 495/507 co-relation queries the response was YES. [2020-10-16 05:03:01,310 INFO L80 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 169 events. 73/169 cut-off events. For 495/507 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 636 event pairs, 38 based on Foata normal form. 12/177 useless extension candidates. Maximal degree in co-relation 441. Up to 108 conditions per place. [2020-10-16 05:03:01,311 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 9 selfloop transitions, 5 changer transitions 8/35 dead transitions. [2020-10-16 05:03:01,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 35 transitions, 194 flow [2020-10-16 05:03:01,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:03:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:03:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 744 transitions. [2020-10-16 05:03:01,316 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2020-10-16 05:03:01,316 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 744 transitions. [2020-10-16 05:03:01,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 744 transitions. [2020-10-16 05:03:01,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:01,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 744 transitions. [2020-10-16 05:03:01,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:03:01,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:03:01,322 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:03:01,322 INFO L185 Difference]: Start difference. First operand has 50 places, 22 transitions, 108 flow. Second operand 6 states and 744 transitions. [2020-10-16 05:03:01,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 35 transitions, 194 flow [2020-10-16 05:03:01,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 130 flow, removed 18 selfloop flow, removed 16 redundant places. [2020-10-16 05:03:01,324 INFO L241 Difference]: Finished difference. Result has 40 places, 25 transitions, 96 flow [2020-10-16 05:03:01,325 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2020-10-16 05:03:01,325 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2020-10-16 05:03:01,325 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 96 flow [2020-10-16 05:03:01,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:03:01,325 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:01,325 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:01,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 05:03:01,326 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:03:01,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:01,326 INFO L82 PathProgramCache]: Analyzing trace with hash -742881069, now seen corresponding path program 1 times [2020-10-16 05:03:01,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:01,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792369133] [2020-10-16 05:03:01,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:01,404 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 05:03:01,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792369133] [2020-10-16 05:03:01,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:01,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:03:01,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822721879] [2020-10-16 05:03:01,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:03:01,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:01,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:03:01,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:03:01,407 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 168 [2020-10-16 05:03:01,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 96 flow. Second operand 4 states. [2020-10-16 05:03:01,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:01,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 168 [2020-10-16 05:03:01,408 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:01,463 INFO L129 PetriNetUnfolder]: 77/188 cut-off events. [2020-10-16 05:03:01,463 INFO L130 PetriNetUnfolder]: For 63/66 co-relation queries the response was YES. [2020-10-16 05:03:01,464 INFO L80 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 188 events. 77/188 cut-off events. For 63/66 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 844 event pairs, 38 based on Foata normal form. 14/189 useless extension candidates. Maximal degree in co-relation 435. Up to 81 conditions per place. [2020-10-16 05:03:01,465 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 8 selfloop transitions, 8 changer transitions 0/35 dead transitions. [2020-10-16 05:03:01,465 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 148 flow [2020-10-16 05:03:01,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:03:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:03:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 683 transitions. [2020-10-16 05:03:01,468 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8130952380952381 [2020-10-16 05:03:01,468 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 683 transitions. [2020-10-16 05:03:01,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 683 transitions. [2020-10-16 05:03:01,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:01,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 683 transitions. [2020-10-16 05:03:01,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:03:01,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:03:01,473 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:03:01,473 INFO L185 Difference]: Start difference. First operand has 40 places, 25 transitions, 96 flow. Second operand 5 states and 683 transitions. [2020-10-16 05:03:01,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 148 flow [2020-10-16 05:03:01,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 140 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 05:03:01,475 INFO L241 Difference]: Finished difference. Result has 42 places, 32 transitions, 148 flow [2020-10-16 05:03:01,475 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2020-10-16 05:03:01,476 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2020-10-16 05:03:01,476 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 148 flow [2020-10-16 05:03:01,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:03:01,476 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:01,476 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:01,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 05:03:01,477 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:03:01,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:01,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1658078233, now seen corresponding path program 1 times [2020-10-16 05:03:01,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:01,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050602152] [2020-10-16 05:03:01,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:01,553 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 05:03:01,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050602152] [2020-10-16 05:03:01,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:01,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:03:01,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929850412] [2020-10-16 05:03:01,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:03:01,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:01,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:03:01,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:03:01,557 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 168 [2020-10-16 05:03:01,557 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 148 flow. Second operand 5 states. [2020-10-16 05:03:01,558 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:01,558 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 168 [2020-10-16 05:03:01,558 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:01,635 INFO L129 PetriNetUnfolder]: 38/124 cut-off events. [2020-10-16 05:03:01,635 INFO L130 PetriNetUnfolder]: For 147/237 co-relation queries the response was YES. [2020-10-16 05:03:01,636 INFO L80 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 124 events. 38/124 cut-off events. For 147/237 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 482 event pairs, 7 based on Foata normal form. 53/171 useless extension candidates. Maximal degree in co-relation 408. Up to 68 conditions per place. [2020-10-16 05:03:01,637 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 5 selfloop transitions, 15 changer transitions 3/42 dead transitions. [2020-10-16 05:03:01,637 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 252 flow [2020-10-16 05:03:01,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:03:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:03:01,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 956 transitions. [2020-10-16 05:03:01,641 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8129251700680272 [2020-10-16 05:03:01,641 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 956 transitions. [2020-10-16 05:03:01,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 956 transitions. [2020-10-16 05:03:01,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:01,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 956 transitions. [2020-10-16 05:03:01,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:03:01,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:03:01,647 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:03:01,647 INFO L185 Difference]: Start difference. First operand has 42 places, 32 transitions, 148 flow. Second operand 7 states and 956 transitions. [2020-10-16 05:03:01,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 252 flow [2020-10-16 05:03:01,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:03:01,650 INFO L241 Difference]: Finished difference. Result has 50 places, 39 transitions, 243 flow [2020-10-16 05:03:01,650 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=243, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2020-10-16 05:03:01,650 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2020-10-16 05:03:01,650 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 243 flow [2020-10-16 05:03:01,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:03:01,651 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:01,651 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 05:03:01,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 05:03:01,651 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:03:01,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:01,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2029665930, now seen corresponding path program 1 times [2020-10-16 05:03:01,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:01,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210209104] [2020-10-16 05:03:01,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:01,748 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 05:03:01,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210209104] [2020-10-16 05:03:01,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:01,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:03:01,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294117551] [2020-10-16 05:03:01,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:03:01,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:01,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:03:01,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:03:01,751 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 168 [2020-10-16 05:03:01,751 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 243 flow. Second operand 6 states. [2020-10-16 05:03:01,752 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:01,752 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 168 [2020-10-16 05:03:01,752 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:01,877 INFO L129 PetriNetUnfolder]: 24/93 cut-off events. [2020-10-16 05:03:01,877 INFO L130 PetriNetUnfolder]: For 350/473 co-relation queries the response was YES. [2020-10-16 05:03:01,877 INFO L80 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 93 events. 24/93 cut-off events. For 350/473 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 351 event pairs, 1 based on Foata normal form. 56/144 useless extension candidates. Maximal degree in co-relation 401. Up to 58 conditions per place. [2020-10-16 05:03:01,878 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 2 selfloop transitions, 19 changer transitions 3/43 dead transitions. [2020-10-16 05:03:01,878 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 43 transitions, 321 flow [2020-10-16 05:03:01,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:03:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:03:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1223 transitions. [2020-10-16 05:03:01,883 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8088624338624338 [2020-10-16 05:03:01,883 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1223 transitions. [2020-10-16 05:03:01,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1223 transitions. [2020-10-16 05:03:01,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:01,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1223 transitions. [2020-10-16 05:03:01,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:03:01,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:03:01,890 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:03:01,890 INFO L185 Difference]: Start difference. First operand has 50 places, 39 transitions, 243 flow. Second operand 9 states and 1223 transitions. [2020-10-16 05:03:01,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 43 transitions, 321 flow [2020-10-16 05:03:01,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 43 transitions, 278 flow, removed 16 selfloop flow, removed 3 redundant places. [2020-10-16 05:03:01,895 INFO L241 Difference]: Finished difference. Result has 58 places, 40 transitions, 261 flow [2020-10-16 05:03:01,895 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=261, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2020-10-16 05:03:01,895 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2020-10-16 05:03:01,895 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 261 flow [2020-10-16 05:03:01,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:03:01,896 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:01,896 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 05:03:01,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 05:03:01,896 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:03:01,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:01,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2013252185, now seen corresponding path program 1 times [2020-10-16 05:03:01,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:01,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725462590] [2020-10-16 05:03:01,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:02,373 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 05:03:02,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725462590] [2020-10-16 05:03:02,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:02,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 05:03:02,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990026120] [2020-10-16 05:03:02,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 05:03:02,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:02,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 05:03:02,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-16 05:03:02,378 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 168 [2020-10-16 05:03:02,379 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 261 flow. Second operand 10 states. [2020-10-16 05:03:02,379 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:02,379 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 168 [2020-10-16 05:03:02,379 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:02,664 INFO L129 PetriNetUnfolder]: 43/156 cut-off events. [2020-10-16 05:03:02,664 INFO L130 PetriNetUnfolder]: For 686/806 co-relation queries the response was YES. [2020-10-16 05:03:02,669 INFO L80 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 156 events. 43/156 cut-off events. For 686/806 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 833 event pairs, 0 based on Foata normal form. 20/166 useless extension candidates. Maximal degree in co-relation 616. Up to 50 conditions per place. [2020-10-16 05:03:02,670 INFO L132 encePairwiseOnDemand]: 160/168 looper letters, 10 selfloop transitions, 3 changer transitions 8/49 dead transitions. [2020-10-16 05:03:02,670 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 49 transitions, 349 flow [2020-10-16 05:03:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:03:02,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:03:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 955 transitions. [2020-10-16 05:03:02,675 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7105654761904762 [2020-10-16 05:03:02,675 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 955 transitions. [2020-10-16 05:03:02,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 955 transitions. [2020-10-16 05:03:02,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:02,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 955 transitions. [2020-10-16 05:03:02,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:03:02,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:03:02,682 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:03:02,682 INFO L185 Difference]: Start difference. First operand has 58 places, 40 transitions, 261 flow. Second operand 8 states and 955 transitions. [2020-10-16 05:03:02,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 49 transitions, 349 flow [2020-10-16 05:03:02,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 49 transitions, 271 flow, removed 22 selfloop flow, removed 9 redundant places. [2020-10-16 05:03:02,687 INFO L241 Difference]: Finished difference. Result has 59 places, 39 transitions, 208 flow [2020-10-16 05:03:02,687 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=208, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2020-10-16 05:03:02,687 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2020-10-16 05:03:02,688 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 208 flow [2020-10-16 05:03:02,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 05:03:02,688 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:02,688 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 05:03:02,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 05:03:02,688 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:03:02,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:02,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1242596841, now seen corresponding path program 2 times [2020-10-16 05:03:02,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:02,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665944633] [2020-10-16 05:03:02,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:03:02,743 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:03:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:03:02,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:03:02,875 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 05:03:02,875 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 05:03:02,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 05:03:02,898 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 05:03:02,898 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,906 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 05:03:02,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,906 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 05:03:02,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,907 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 05:03:02,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,907 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 05:03:02,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,908 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 05:03:02,908 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,908 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 05:03:02,908 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,909 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 05:03:02,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,910 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 05:03:02,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,910 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 05:03:02,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,910 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 05:03:02,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,911 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 05:03:02,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,911 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 05:03:02,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,912 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 05:03:02,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,912 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 05:03:02,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,912 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 05:03:02,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,913 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 05:03:02,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,913 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 05:03:02,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,914 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 05:03:02,914 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,919 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 05:03:02,919 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,919 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 05:03:02,919 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,919 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 05:03:02,920 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,920 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 05:03:02,920 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,920 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 05:03:02,920 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,921 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 05:03:02,921 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,921 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 05:03:02,921 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,921 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 05:03:02,921 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,922 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 05:03:02,922 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,922 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 05:03:02,922 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,922 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 05:03:02,922 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,922 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 05:03:02,923 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,923 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 05:03:02,923 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,924 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 05:03:02,924 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,924 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 05:03:02,924 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,924 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 05:03:02,924 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:02,924 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 05:03:02,925 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:03,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:03:03 BasicIcfg [2020-10-16 05:03:03,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 05:03:03,008 INFO L168 Benchmark]: Toolchain (without parser) took 13550.06 ms. Allocated memory was 251.1 MB in the beginning and 582.0 MB in the end (delta: 330.8 MB). Free memory was 206.3 MB in the beginning and 384.7 MB in the end (delta: -178.5 MB). Peak memory consumption was 152.4 MB. Max. memory is 14.2 GB. [2020-10-16 05:03:03,008 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 05:03:03,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.45 ms. Allocated memory was 251.1 MB in the beginning and 310.4 MB in the end (delta: 59.2 MB). Free memory was 206.3 MB in the beginning and 256.2 MB in the end (delta: -49.9 MB). Peak memory consumption was 26.8 MB. Max. memory is 14.2 GB. [2020-10-16 05:03:03,010 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.80 ms. Allocated memory is still 310.4 MB. Free memory was 256.2 MB in the beginning and 253.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:03:03,010 INFO L168 Benchmark]: Boogie Preprocessor took 40.09 ms. Allocated memory is still 310.4 MB. Free memory was 253.7 MB in the beginning and 251.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:03:03,011 INFO L168 Benchmark]: RCFGBuilder took 2180.58 ms. Allocated memory was 310.4 MB in the beginning and 358.1 MB in the end (delta: 47.7 MB). Free memory was 251.1 MB in the beginning and 183.5 MB in the end (delta: 67.6 MB). Peak memory consumption was 115.4 MB. Max. memory is 14.2 GB. [2020-10-16 05:03:03,012 INFO L168 Benchmark]: TraceAbstraction took 10511.99 ms. Allocated memory was 358.1 MB in the beginning and 582.0 MB in the end (delta: 223.9 MB). Free memory was 183.5 MB in the beginning and 384.7 MB in the end (delta: -201.2 MB). Peak memory consumption was 22.6 MB. Max. memory is 14.2 GB. [2020-10-16 05:03:03,016 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.19 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 747.45 ms. Allocated memory was 251.1 MB in the beginning and 310.4 MB in the end (delta: 59.2 MB). Free memory was 206.3 MB in the beginning and 256.2 MB in the end (delta: -49.9 MB). Peak memory consumption was 26.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 64.80 ms. Allocated memory is still 310.4 MB. Free memory was 256.2 MB in the beginning and 253.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 40.09 ms. Allocated memory is still 310.4 MB. Free memory was 253.7 MB in the beginning and 251.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2180.58 ms. Allocated memory was 310.4 MB in the beginning and 358.1 MB in the end (delta: 47.7 MB). Free memory was 251.1 MB in the beginning and 183.5 MB in the end (delta: 67.6 MB). Peak memory consumption was 115.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 10511.99 ms. Allocated memory was 358.1 MB in the beginning and 582.0 MB in the end (delta: 223.9 MB). Free memory was 183.5 MB in the beginning and 384.7 MB in the end (delta: -201.2 MB). Peak memory consumption was 22.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1054 VarBasedMoverChecksPositive, 63 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 43 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 122 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.6s, 98 PlacesBefore, 34 PlacesAfterwards, 90 TransitionsBefore, 25 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 4509 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_p1_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L708] 0 int y = 0; [L710] 0 int z = 0; [L711] 0 _Bool z$flush_delayed; [L712] 0 int z$mem_tmp; [L713] 0 _Bool z$r_buff0_thd0; [L714] 0 _Bool z$r_buff0_thd1; [L715] 0 _Bool z$r_buff0_thd2; [L716] 0 _Bool z$r_buff0_thd3; [L717] 0 _Bool z$r_buff1_thd0; [L718] 0 _Bool z$r_buff1_thd1; [L719] 0 _Bool z$r_buff1_thd2; [L720] 0 _Bool z$r_buff1_thd3; [L721] 0 _Bool z$read_delayed; [L722] 0 int *z$read_delayed_var; [L723] 0 int z$w_buff0; [L724] 0 _Bool z$w_buff0_used; [L725] 0 int z$w_buff1; [L726] 0 _Bool z$w_buff1_used; [L727] 0 _Bool weak$$choice0; [L728] 0 _Bool weak$$choice2; [L809] 0 pthread_t t1967; [L810] FCALL, FORK 0 pthread_create(&t1967, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$w_buff1 = z$w_buff0 [L733] 1 z$w_buff0 = 2 [L734] 1 z$w_buff1_used = z$w_buff0_used [L735] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L737] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L738] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L739] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L740] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L741] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 0 pthread_t t1968; [L812] FCALL, FORK 0 pthread_create(&t1968, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L767] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L767] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L769] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L770] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L770] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L771] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L771] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L813] 0 pthread_t t1969; [L814] FCALL, FORK 0 pthread_create(&t1969, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L791] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L747] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L749] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L750] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L751] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 2 return 0; [L794] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 3 return 0; [L816] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L820] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L820] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L821] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L821] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L822] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L822] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L823] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L823] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L824] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 z$flush_delayed = weak$$choice2 [L830] 0 z$mem_tmp = z [L831] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L831] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L832] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L832] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L832] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L832] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L832] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L833] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L833] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L834] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L834] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L836] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L836] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L836] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L837] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L837] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L839] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L839] 0 z = z$flush_delayed ? z$mem_tmp : z [L840] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 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: 13, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 69 SDtfs, 54 SDslu, 73 SDs, 0 SdLazy, 404 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred 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, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 20633 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...