/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/safe031_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 05:10:12,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 05:10:12,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 05:10:12,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 05:10:12,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 05:10:12,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 05:10:12,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 05:10:12,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 05:10:12,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 05:10:12,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 05:10:12,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 05:10:12,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 05:10:12,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 05:10:12,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 05:10:12,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 05:10:12,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 05:10:12,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 05:10:12,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 05:10:12,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 05:10:12,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 05:10:12,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 05:10:12,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 05:10:12,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 05:10:12,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 05:10:12,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 05:10:12,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 05:10:12,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 05:10:12,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 05:10:12,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 05:10:12,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 05:10:12,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 05:10:12,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 05:10:12,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 05:10:12,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 05:10:12,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 05:10:12,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 05:10:12,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 05:10:12,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 05:10:12,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 05:10:12,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 05:10:12,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 05:10:12,093 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:10:12,116 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 05:10:12,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 05:10:12,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 05:10:12,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 05:10:12,118 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 05:10:12,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 05:10:12,118 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 05:10:12,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 05:10:12,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 05:10:12,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 05:10:12,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 05:10:12,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 05:10:12,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 05:10:12,119 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 05:10:12,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 05:10:12,120 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 05:10:12,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 05:10:12,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 05:10:12,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 05:10:12,120 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 05:10:12,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 05:10:12,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:10:12,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 05:10:12,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 05:10:12,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 05:10:12,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 05:10:12,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 05:10:12,122 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 05:10:12,122 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 05:10:12,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 05:10:12,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 05:10:12,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 05:10:12,464 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 05:10:12,464 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 05:10:12,465 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i [2020-10-16 05:10:12,535 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10b48787/11aeac5131c84e0088c2b01b63bb1248/FLAG7fee069b0 [2020-10-16 05:10:13,016 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 05:10:13,017 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i [2020-10-16 05:10:13,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10b48787/11aeac5131c84e0088c2b01b63bb1248/FLAG7fee069b0 [2020-10-16 05:10:13,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10b48787/11aeac5131c84e0088c2b01b63bb1248 [2020-10-16 05:10:13,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 05:10:13,391 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 05:10:13,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 05:10:13,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 05:10:13,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 05:10:13,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:10:13" (1/1) ... [2020-10-16 05:10:13,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230a6e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:13, skipping insertion in model container [2020-10-16 05:10:13,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:10:13" (1/1) ... [2020-10-16 05:10:13,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 05:10:13,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 05:10:14,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:10:14,164 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 05:10:14,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:10:14,302 INFO L208 MainTranslator]: Completed translation [2020-10-16 05:10:14,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:14 WrapperNode [2020-10-16 05:10:14,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 05:10:14,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 05:10:14,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 05:10:14,304 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 05:10:14,312 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:10:14" (1/1) ... [2020-10-16 05:10:14,332 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:10:14" (1/1) ... [2020-10-16 05:10:14,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 05:10:14,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 05:10:14,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 05:10:14,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 05:10:14,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:14" (1/1) ... [2020-10-16 05:10:14,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:14" (1/1) ... [2020-10-16 05:10:14,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:14" (1/1) ... [2020-10-16 05:10:14,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:14" (1/1) ... [2020-10-16 05:10:14,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:14" (1/1) ... [2020-10-16 05:10:14,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:14" (1/1) ... [2020-10-16 05:10:14,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:14" (1/1) ... [2020-10-16 05:10:14,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 05:10:14,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 05:10:14,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 05:10:14,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 05:10:14,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:14" (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:10:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 05:10:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 05:10:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 05:10:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 05:10:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 05:10:14,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 05:10:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 05:10:14,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 05:10:14,488 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 05:10:14,488 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 05:10:14,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 05:10:14,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 05:10:14,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 05:10:14,491 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:10:16,456 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 05:10:16,457 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 05:10:16,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:10:16 BoogieIcfgContainer [2020-10-16 05:10:16,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 05:10:16,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 05:10:16,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 05:10:16,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 05:10:16,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:10:13" (1/3) ... [2020-10-16 05:10:16,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e25dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:10:16, skipping insertion in model container [2020-10-16 05:10:16,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:14" (2/3) ... [2020-10-16 05:10:16,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e25dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:10:16, skipping insertion in model container [2020-10-16 05:10:16,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:10:16" (3/3) ... [2020-10-16 05:10:16,469 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_pso.opt.i [2020-10-16 05:10:16,481 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 05:10:16,489 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 05:10:16,490 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 05:10:16,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,521 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,521 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,522 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,522 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,525 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,533 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,533 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,535 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,535 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,540 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,541 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,541 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,544 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,544 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:16,563 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 05:10:16,584 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 05:10:16,585 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 05:10:16,585 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 05:10:16,585 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 05:10:16,585 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 05:10:16,585 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 05:10:16,585 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 05:10:16,585 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 05:10:16,600 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-16 05:10:16,645 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-16 05:10:16,646 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:10:16,650 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 05:10:16,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 91 transitions, 197 flow [2020-10-16 05:10:16,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 88 transitions, 185 flow [2020-10-16 05:10:16,662 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 05:10:16,665 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 88 transitions, 185 flow [2020-10-16 05:10:16,668 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 88 transitions, 185 flow [2020-10-16 05:10:16,669 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 96 places, 88 transitions, 185 flow [2020-10-16 05:10:16,697 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-16 05:10:16,697 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:10:16,698 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 05:10:16,701 INFO L117 LiptonReduction]: Number of co-enabled transitions 1536 [2020-10-16 05:10:17,132 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 05:10:17,254 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 05:10:17,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:17,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:17,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:10:17,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:17,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:17,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:17,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:10:17,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:17,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:17,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:17,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-16 05:10:17,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:17,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:17,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:17,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:10:17,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:18,785 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-16 05:10:18,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 05:10:18,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:18,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:10:18,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:19,615 WARN L193 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-16 05:10:19,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:19,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:19,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:10:19,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:19,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:19,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:19,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:10:19,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:19,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:10:19,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:20,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:20,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:20,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:10:20,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:20,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:20,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:20,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-16 05:10:20,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:20,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:10:20,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:20,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:10:20,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:20,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:10:20,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:20,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:20,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:20,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:20,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:10:20,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:10:20,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:10:20,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:20,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:20,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:20,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:20,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:20,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:10:20,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:10:20,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:10:20,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:10:20,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:20,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:20,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:20,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:20,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:10:20,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:10:20,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:10:20,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:20,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:20,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:20,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:20,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:20,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:10:20,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:10:20,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:10:21,852 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 05:10:21,959 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 05:10:21,967 INFO L132 LiptonReduction]: Checked pairs total: 4027 [2020-10-16 05:10:21,967 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 05:10:21,970 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5311 [2020-10-16 05:10:21,977 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2020-10-16 05:10:21,977 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:10:21,978 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:21,979 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:21,979 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:21,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:21,985 INFO L82 PathProgramCache]: Analyzing trace with hash -755541581, now seen corresponding path program 1 times [2020-10-16 05:10:21,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:21,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987944009] [2020-10-16 05:10:21,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:22,239 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:10:22,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987944009] [2020-10-16 05:10:22,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:22,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:10:22,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094018586] [2020-10-16 05:10:22,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:10:22,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:22,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:10:22,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:10:22,265 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 168 [2020-10-16 05:10:22,267 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states. [2020-10-16 05:10:22,267 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:22,268 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 168 [2020-10-16 05:10:22,269 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:22,332 INFO L129 PetriNetUnfolder]: 16/63 cut-off events. [2020-10-16 05:10:22,332 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:10:22,333 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 63 events. 16/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 208 event pairs, 6 based on Foata normal form. 6/63 useless extension candidates. Maximal degree in co-relation 98. Up to 27 conditions per place. [2020-10-16 05:10:22,334 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 7 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2020-10-16 05:10:22,335 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 77 flow [2020-10-16 05:10:22,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:10:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:10:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2020-10-16 05:10:22,354 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8511904761904762 [2020-10-16 05:10:22,354 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2020-10-16 05:10:22,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2020-10-16 05:10:22,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:22,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2020-10-16 05:10:22,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:10:22,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:10:22,373 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:10:22,375 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 429 transitions. [2020-10-16 05:10:22,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 77 flow [2020-10-16 05:10:22,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 74 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 05:10:22,382 INFO L241 Difference]: Finished difference. Result has 31 places, 22 transitions, 54 flow [2020-10-16 05:10:22,385 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2020-10-16 05:10:22,386 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2020-10-16 05:10:22,386 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2020-10-16 05:10:22,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:10:22,386 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:22,386 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:22,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 05:10:22,387 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:22,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:22,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1585839773, now seen corresponding path program 1 times [2020-10-16 05:10:22,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:22,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975060737] [2020-10-16 05:10:22,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:22,614 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:10:22,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975060737] [2020-10-16 05:10:22,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:22,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:10:22,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984985609] [2020-10-16 05:10:22,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:10:22,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:22,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:10:22,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:10:22,620 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 168 [2020-10-16 05:10:22,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand 4 states. [2020-10-16 05:10:22,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:22,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 168 [2020-10-16 05:10:22,621 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:22,777 INFO L129 PetriNetUnfolder]: 152/315 cut-off events. [2020-10-16 05:10:22,777 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-16 05:10:22,779 INFO L80 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 315 events. 152/315 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1615 event pairs, 82 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 596. Up to 180 conditions per place. [2020-10-16 05:10:22,781 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 10 selfloop transitions, 3 changer transitions 12/37 dead transitions. [2020-10-16 05:10:22,781 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 140 flow [2020-10-16 05:10:22,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:10:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:10:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2020-10-16 05:10:22,785 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6988095238095238 [2020-10-16 05:10:22,785 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 587 transitions. [2020-10-16 05:10:22,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 587 transitions. [2020-10-16 05:10:22,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:22,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 587 transitions. [2020-10-16 05:10:22,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:10:22,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:10:22,790 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:10:22,790 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 5 states and 587 transitions. [2020-10-16 05:10:22,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 140 flow [2020-10-16 05:10:22,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:10:22,792 INFO L241 Difference]: Finished difference. Result has 36 places, 23 transitions, 75 flow [2020-10-16 05:10:22,792 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2020-10-16 05:10:22,793 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2020-10-16 05:10:22,793 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 75 flow [2020-10-16 05:10:22,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:10:22,793 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:22,793 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:22,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 05:10:22,794 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:22,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:22,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1692580395, now seen corresponding path program 1 times [2020-10-16 05:10:22,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:22,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027089075] [2020-10-16 05:10:22,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:22,916 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:10:22,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027089075] [2020-10-16 05:10:22,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:22,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:10:22,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012833190] [2020-10-16 05:10:22,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:10:22,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:22,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:10:22,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:10:22,922 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 168 [2020-10-16 05:10:22,923 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 75 flow. Second operand 5 states. [2020-10-16 05:10:22,923 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:22,923 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 168 [2020-10-16 05:10:22,924 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:23,047 INFO L129 PetriNetUnfolder]: 85/189 cut-off events. [2020-10-16 05:10:23,048 INFO L130 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2020-10-16 05:10:23,049 INFO L80 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 189 events. 85/189 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 832 event pairs, 47 based on Foata normal form. 9/195 useless extension candidates. Maximal degree in co-relation 442. Up to 121 conditions per place. [2020-10-16 05:10:23,051 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 9 selfloop transitions, 4 changer transitions 7/34 dead transitions. [2020-10-16 05:10:23,051 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 34 transitions, 154 flow [2020-10-16 05:10:23,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:10:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:10:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2020-10-16 05:10:23,055 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7261904761904762 [2020-10-16 05:10:23,055 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 610 transitions. [2020-10-16 05:10:23,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 610 transitions. [2020-10-16 05:10:23,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:23,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 610 transitions. [2020-10-16 05:10:23,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:10:23,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:10:23,059 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:10:23,059 INFO L185 Difference]: Start difference. First operand has 36 places, 23 transitions, 75 flow. Second operand 5 states and 610 transitions. [2020-10-16 05:10:23,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 34 transitions, 154 flow [2020-10-16 05:10:23,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 148 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 05:10:23,062 INFO L241 Difference]: Finished difference. Result has 38 places, 26 transitions, 110 flow [2020-10-16 05:10:23,062 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2020-10-16 05:10:23,063 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2020-10-16 05:10:23,063 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 110 flow [2020-10-16 05:10:23,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:10:23,063 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:23,063 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:23,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 05:10:23,064 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:23,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:23,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1898982904, now seen corresponding path program 1 times [2020-10-16 05:10:23,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:23,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834013313] [2020-10-16 05:10:23,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:23,206 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:10:23,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834013313] [2020-10-16 05:10:23,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:23,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:10:23,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955973639] [2020-10-16 05:10:23,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:10:23,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:23,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:10:23,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:10:23,211 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 168 [2020-10-16 05:10:23,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 110 flow. Second operand 5 states. [2020-10-16 05:10:23,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:23,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 168 [2020-10-16 05:10:23,212 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:23,404 INFO L129 PetriNetUnfolder]: 126/273 cut-off events. [2020-10-16 05:10:23,404 INFO L130 PetriNetUnfolder]: For 332/336 co-relation queries the response was YES. [2020-10-16 05:10:23,408 INFO L80 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 273 events. 126/273 cut-off events. For 332/336 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1223 event pairs, 26 based on Foata normal form. 22/295 useless extension candidates. Maximal degree in co-relation 740. Up to 162 conditions per place. [2020-10-16 05:10:23,412 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 13 selfloop transitions, 6 changer transitions 8/40 dead transitions. [2020-10-16 05:10:23,412 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 208 flow [2020-10-16 05:10:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:10:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:10:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 687 transitions. [2020-10-16 05:10:23,416 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6815476190476191 [2020-10-16 05:10:23,417 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 687 transitions. [2020-10-16 05:10:23,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 687 transitions. [2020-10-16 05:10:23,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:23,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 687 transitions. [2020-10-16 05:10:23,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:10:23,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:10:23,421 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:10:23,421 INFO L185 Difference]: Start difference. First operand has 38 places, 26 transitions, 110 flow. Second operand 6 states and 687 transitions. [2020-10-16 05:10:23,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 208 flow [2020-10-16 05:10:23,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 200 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 05:10:23,426 INFO L241 Difference]: Finished difference. Result has 42 places, 28 transitions, 140 flow [2020-10-16 05:10:23,427 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2020-10-16 05:10:23,427 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2020-10-16 05:10:23,428 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 140 flow [2020-10-16 05:10:23,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:10:23,431 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:23,431 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:23,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 05:10:23,433 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:23,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:23,434 INFO L82 PathProgramCache]: Analyzing trace with hash -721642966, now seen corresponding path program 1 times [2020-10-16 05:10:23,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:23,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766579009] [2020-10-16 05:10:23,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:23,567 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:10:23,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766579009] [2020-10-16 05:10:23,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:23,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:10:23,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375700693] [2020-10-16 05:10:23,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:10:23,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:23,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:10:23,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:10:23,572 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 168 [2020-10-16 05:10:23,573 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 140 flow. Second operand 6 states. [2020-10-16 05:10:23,573 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:23,573 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 168 [2020-10-16 05:10:23,573 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:23,792 INFO L129 PetriNetUnfolder]: 81/199 cut-off events. [2020-10-16 05:10:23,792 INFO L130 PetriNetUnfolder]: For 506/506 co-relation queries the response was YES. [2020-10-16 05:10:23,794 INFO L80 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 199 events. 81/199 cut-off events. For 506/506 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 896 event pairs, 39 based on Foata normal form. 13/208 useless extension candidates. Maximal degree in co-relation 612. Up to 109 conditions per place. [2020-10-16 05:10:23,795 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 10 selfloop transitions, 6 changer transitions 6/38 dead transitions. [2020-10-16 05:10:23,795 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 222 flow [2020-10-16 05:10:23,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:10:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:10:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 700 transitions. [2020-10-16 05:10:23,799 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2020-10-16 05:10:23,799 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 700 transitions. [2020-10-16 05:10:23,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 700 transitions. [2020-10-16 05:10:23,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:23,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 700 transitions. [2020-10-16 05:10:23,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:10:23,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:10:23,804 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:10:23,804 INFO L185 Difference]: Start difference. First operand has 42 places, 28 transitions, 140 flow. Second operand 6 states and 700 transitions. [2020-10-16 05:10:23,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 222 flow [2020-10-16 05:10:23,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 208 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 05:10:23,812 INFO L241 Difference]: Finished difference. Result has 45 places, 30 transitions, 164 flow [2020-10-16 05:10:23,812 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2020-10-16 05:10:23,812 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2020-10-16 05:10:23,813 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 164 flow [2020-10-16 05:10:23,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:10:23,813 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:23,813 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:23,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 05:10:23,815 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:23,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:23,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1223004261, now seen corresponding path program 1 times [2020-10-16 05:10:23,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:23,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014064570] [2020-10-16 05:10:23,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:23,918 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:10:23,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014064570] [2020-10-16 05:10:23,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:23,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:10:23,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579751962] [2020-10-16 05:10:23,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:10:23,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:23,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:10:23,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:10:23,923 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 168 [2020-10-16 05:10:23,924 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 164 flow. Second operand 5 states. [2020-10-16 05:10:23,924 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:23,924 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 168 [2020-10-16 05:10:23,924 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:24,066 INFO L129 PetriNetUnfolder]: 81/177 cut-off events. [2020-10-16 05:10:24,066 INFO L130 PetriNetUnfolder]: For 639/639 co-relation queries the response was YES. [2020-10-16 05:10:24,068 INFO L80 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 177 events. 81/177 cut-off events. For 639/639 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 667 event pairs, 19 based on Foata normal form. 8/183 useless extension candidates. Maximal degree in co-relation 680. Up to 104 conditions per place. [2020-10-16 05:10:24,069 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 12 selfloop transitions, 10 changer transitions 6/44 dead transitions. [2020-10-16 05:10:24,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 308 flow [2020-10-16 05:10:24,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:10:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:10:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 886 transitions. [2020-10-16 05:10:24,073 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7534013605442177 [2020-10-16 05:10:24,073 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 886 transitions. [2020-10-16 05:10:24,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 886 transitions. [2020-10-16 05:10:24,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:24,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 886 transitions. [2020-10-16 05:10:24,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:10:24,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:10:24,078 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:10:24,079 INFO L185 Difference]: Start difference. First operand has 45 places, 30 transitions, 164 flow. Second operand 7 states and 886 transitions. [2020-10-16 05:10:24,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 308 flow [2020-10-16 05:10:24,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 292 flow, removed 4 selfloop flow, removed 3 redundant places. [2020-10-16 05:10:24,082 INFO L241 Difference]: Finished difference. Result has 50 places, 34 transitions, 211 flow [2020-10-16 05:10:24,083 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=211, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2020-10-16 05:10:24,083 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2020-10-16 05:10:24,083 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 211 flow [2020-10-16 05:10:24,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:10:24,083 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:24,083 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:24,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 05:10:24,084 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:24,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:24,084 INFO L82 PathProgramCache]: Analyzing trace with hash 99421067, now seen corresponding path program 2 times [2020-10-16 05:10:24,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:24,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078425623] [2020-10-16 05:10:24,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:24,149 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:10:24,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078425623] [2020-10-16 05:10:24,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:24,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:10:24,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221710697] [2020-10-16 05:10:24,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:10:24,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:24,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:10:24,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:10:24,153 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 168 [2020-10-16 05:10:24,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 211 flow. Second operand 5 states. [2020-10-16 05:10:24,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:24,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 168 [2020-10-16 05:10:24,154 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:24,297 INFO L129 PetriNetUnfolder]: 80/199 cut-off events. [2020-10-16 05:10:24,297 INFO L130 PetriNetUnfolder]: For 1052/1055 co-relation queries the response was YES. [2020-10-16 05:10:24,300 INFO L80 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 199 events. 80/199 cut-off events. For 1052/1055 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 862 event pairs, 20 based on Foata normal form. 16/214 useless extension candidates. Maximal degree in co-relation 827. Up to 82 conditions per place. [2020-10-16 05:10:24,302 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 17 selfloop transitions, 7 changer transitions 7/47 dead transitions. [2020-10-16 05:10:24,302 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 47 transitions, 387 flow [2020-10-16 05:10:24,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:10:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:10:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions. [2020-10-16 05:10:24,306 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.748015873015873 [2020-10-16 05:10:24,306 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 754 transitions. [2020-10-16 05:10:24,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 754 transitions. [2020-10-16 05:10:24,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:24,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 754 transitions. [2020-10-16 05:10:24,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:10:24,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:10:24,311 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:10:24,312 INFO L185 Difference]: Start difference. First operand has 50 places, 34 transitions, 211 flow. Second operand 6 states and 754 transitions. [2020-10-16 05:10:24,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 47 transitions, 387 flow [2020-10-16 05:10:24,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 360 flow, removed 8 selfloop flow, removed 3 redundant places. [2020-10-16 05:10:24,317 INFO L241 Difference]: Finished difference. Result has 52 places, 36 transitions, 238 flow [2020-10-16 05:10:24,317 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2020-10-16 05:10:24,317 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2020-10-16 05:10:24,318 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 238 flow [2020-10-16 05:10:24,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:10:24,318 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:24,318 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:24,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 05:10:24,318 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:24,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:24,319 INFO L82 PathProgramCache]: Analyzing trace with hash -885223039, now seen corresponding path program 1 times [2020-10-16 05:10:24,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:24,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669986061] [2020-10-16 05:10:24,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:24,403 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:10:24,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669986061] [2020-10-16 05:10:24,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:24,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:10:24,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141663655] [2020-10-16 05:10:24,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:10:24,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:24,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:10:24,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:10:24,407 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 168 [2020-10-16 05:10:24,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 238 flow. Second operand 6 states. [2020-10-16 05:10:24,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:24,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 168 [2020-10-16 05:10:24,408 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:24,608 INFO L129 PetriNetUnfolder]: 130/328 cut-off events. [2020-10-16 05:10:24,608 INFO L130 PetriNetUnfolder]: For 1753/1764 co-relation queries the response was YES. [2020-10-16 05:10:24,610 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 328 events. 130/328 cut-off events. For 1753/1764 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1783 event pairs, 15 based on Foata normal form. 16/340 useless extension candidates. Maximal degree in co-relation 1458. Up to 149 conditions per place. [2020-10-16 05:10:24,613 INFO L132 encePairwiseOnDemand]: 160/168 looper letters, 23 selfloop transitions, 21 changer transitions 9/67 dead transitions. [2020-10-16 05:10:24,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 631 flow [2020-10-16 05:10:24,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:10:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:10:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 853 transitions. [2020-10-16 05:10:24,616 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7253401360544217 [2020-10-16 05:10:24,617 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 853 transitions. [2020-10-16 05:10:24,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 853 transitions. [2020-10-16 05:10:24,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:24,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 853 transitions. [2020-10-16 05:10:24,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:10:24,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:10:24,622 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:10:24,622 INFO L185 Difference]: Start difference. First operand has 52 places, 36 transitions, 238 flow. Second operand 7 states and 853 transitions. [2020-10-16 05:10:24,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 631 flow [2020-10-16 05:10:24,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 602 flow, removed 7 selfloop flow, removed 3 redundant places. [2020-10-16 05:10:24,629 INFO L241 Difference]: Finished difference. Result has 58 places, 51 transitions, 433 flow [2020-10-16 05:10:24,630 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=433, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2020-10-16 05:10:24,630 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2020-10-16 05:10:24,630 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 433 flow [2020-10-16 05:10:24,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:10:24,630 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:24,630 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:24,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 05:10:24,631 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:24,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:24,631 INFO L82 PathProgramCache]: Analyzing trace with hash -486028335, now seen corresponding path program 2 times [2020-10-16 05:10:24,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:24,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692671310] [2020-10-16 05:10:24,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:24,731 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:10:24,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692671310] [2020-10-16 05:10:24,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:24,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:10:24,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645491796] [2020-10-16 05:10:24,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:10:24,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:24,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:10:24,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:10:24,735 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 168 [2020-10-16 05:10:24,735 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 433 flow. Second operand 7 states. [2020-10-16 05:10:24,735 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:24,736 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 168 [2020-10-16 05:10:24,736 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:25,092 INFO L129 PetriNetUnfolder]: 140/367 cut-off events. [2020-10-16 05:10:25,093 INFO L130 PetriNetUnfolder]: For 2884/2898 co-relation queries the response was YES. [2020-10-16 05:10:25,095 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1974 conditions, 367 events. 140/367 cut-off events. For 2884/2898 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2154 event pairs, 15 based on Foata normal form. 18/381 useless extension candidates. Maximal degree in co-relation 1946. Up to 147 conditions per place. [2020-10-16 05:10:25,098 INFO L132 encePairwiseOnDemand]: 160/168 looper letters, 25 selfloop transitions, 26 changer transitions 10/75 dead transitions. [2020-10-16 05:10:25,098 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 75 transitions, 845 flow [2020-10-16 05:10:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:10:25,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:10:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1093 transitions. [2020-10-16 05:10:25,102 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7228835978835979 [2020-10-16 05:10:25,102 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1093 transitions. [2020-10-16 05:10:25,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1093 transitions. [2020-10-16 05:10:25,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:25,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1093 transitions. [2020-10-16 05:10:25,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:10:25,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:10:25,109 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:10:25,109 INFO L185 Difference]: Start difference. First operand has 58 places, 51 transitions, 433 flow. Second operand 9 states and 1093 transitions. [2020-10-16 05:10:25,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 75 transitions, 845 flow [2020-10-16 05:10:25,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 75 transitions, 807 flow, removed 19 selfloop flow, removed 2 redundant places. [2020-10-16 05:10:25,119 INFO L241 Difference]: Finished difference. Result has 67 places, 56 transitions, 543 flow [2020-10-16 05:10:25,120 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=543, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2020-10-16 05:10:25,120 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 34 predicate places. [2020-10-16 05:10:25,120 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 543 flow [2020-10-16 05:10:25,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:10:25,120 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:25,120 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:25,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 05:10:25,121 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:25,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:25,121 INFO L82 PathProgramCache]: Analyzing trace with hash -439554375, now seen corresponding path program 3 times [2020-10-16 05:10:25,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:25,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647023129] [2020-10-16 05:10:25,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:25,191 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:10:25,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647023129] [2020-10-16 05:10:25,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:25,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:10:25,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466393122] [2020-10-16 05:10:25,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:10:25,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:25,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:10:25,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:10:25,194 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 168 [2020-10-16 05:10:25,195 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 543 flow. Second operand 6 states. [2020-10-16 05:10:25,195 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:25,195 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 168 [2020-10-16 05:10:25,195 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:25,326 INFO L129 PetriNetUnfolder]: 110/347 cut-off events. [2020-10-16 05:10:25,326 INFO L130 PetriNetUnfolder]: For 3564/3583 co-relation queries the response was YES. [2020-10-16 05:10:25,328 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1850 conditions, 347 events. 110/347 cut-off events. For 3564/3583 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2218 event pairs, 14 based on Foata normal form. 15/359 useless extension candidates. Maximal degree in co-relation 1818. Up to 103 conditions per place. [2020-10-16 05:10:25,331 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 17 selfloop transitions, 10 changer transitions 2/60 dead transitions. [2020-10-16 05:10:25,332 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 60 transitions, 667 flow [2020-10-16 05:10:25,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:10:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:10:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions. [2020-10-16 05:10:25,335 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2020-10-16 05:10:25,335 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 728 transitions. [2020-10-16 05:10:25,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 728 transitions. [2020-10-16 05:10:25,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:25,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 728 transitions. [2020-10-16 05:10:25,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:10:25,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:10:25,340 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:10:25,340 INFO L185 Difference]: Start difference. First operand has 67 places, 56 transitions, 543 flow. Second operand 6 states and 728 transitions. [2020-10-16 05:10:25,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 60 transitions, 667 flow [2020-10-16 05:10:25,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 60 transitions, 576 flow, removed 32 selfloop flow, removed 6 redundant places. [2020-10-16 05:10:25,357 INFO L241 Difference]: Finished difference. Result has 66 places, 56 transitions, 499 flow [2020-10-16 05:10:25,358 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=499, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2020-10-16 05:10:25,358 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 33 predicate places. [2020-10-16 05:10:25,358 INFO L481 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 499 flow [2020-10-16 05:10:25,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:10:25,358 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:25,359 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:25,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 05:10:25,359 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:25,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:25,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1593858452, now seen corresponding path program 1 times [2020-10-16 05:10:25,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:25,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829103568] [2020-10-16 05:10:25,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:25,471 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:10:25,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829103568] [2020-10-16 05:10:25,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:25,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:10:25,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724942223] [2020-10-16 05:10:25,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:10:25,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:25,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:10:25,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:10:25,477 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 168 [2020-10-16 05:10:25,478 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 499 flow. Second operand 6 states. [2020-10-16 05:10:25,478 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:25,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 168 [2020-10-16 05:10:25,479 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:25,693 INFO L129 PetriNetUnfolder]: 97/319 cut-off events. [2020-10-16 05:10:25,693 INFO L130 PetriNetUnfolder]: For 2196/2202 co-relation queries the response was YES. [2020-10-16 05:10:25,695 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1573 conditions, 319 events. 97/319 cut-off events. For 2196/2202 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2036 event pairs, 12 based on Foata normal form. 13/332 useless extension candidates. Maximal degree in co-relation 1540. Up to 101 conditions per place. [2020-10-16 05:10:25,698 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 22 selfloop transitions, 12 changer transitions 10/64 dead transitions. [2020-10-16 05:10:25,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 690 flow [2020-10-16 05:10:25,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:10:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:10:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 726 transitions. [2020-10-16 05:10:25,701 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7202380952380952 [2020-10-16 05:10:25,701 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 726 transitions. [2020-10-16 05:10:25,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 726 transitions. [2020-10-16 05:10:25,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:25,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 726 transitions. [2020-10-16 05:10:25,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:10:25,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:10:25,706 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:10:25,706 INFO L185 Difference]: Start difference. First operand has 66 places, 56 transitions, 499 flow. Second operand 6 states and 726 transitions. [2020-10-16 05:10:25,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 690 flow [2020-10-16 05:10:25,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 608 flow, removed 31 selfloop flow, removed 6 redundant places. [2020-10-16 05:10:25,718 INFO L241 Difference]: Finished difference. Result has 66 places, 50 transitions, 415 flow [2020-10-16 05:10:25,719 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=415, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2020-10-16 05:10:25,719 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 33 predicate places. [2020-10-16 05:10:25,720 INFO L481 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 415 flow [2020-10-16 05:10:25,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:10:25,720 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:25,720 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:25,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 05:10:25,720 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:25,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:25,721 INFO L82 PathProgramCache]: Analyzing trace with hash 349706889, now seen corresponding path program 1 times [2020-10-16 05:10:25,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:25,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473411813] [2020-10-16 05:10:25,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:10:25,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473411813] [2020-10-16 05:10:25,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:25,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:10:25,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338688159] [2020-10-16 05:10:25,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:10:25,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:25,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:10:25,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:10:25,827 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2020-10-16 05:10:25,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 415 flow. Second operand 4 states. [2020-10-16 05:10:25,828 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:25,828 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2020-10-16 05:10:25,828 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:25,920 INFO L129 PetriNetUnfolder]: 147/385 cut-off events. [2020-10-16 05:10:25,920 INFO L130 PetriNetUnfolder]: For 1482/1555 co-relation queries the response was YES. [2020-10-16 05:10:25,923 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 385 events. 147/385 cut-off events. For 1482/1555 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2449 event pairs, 49 based on Foata normal form. 88/457 useless extension candidates. Maximal degree in co-relation 1320. Up to 216 conditions per place. [2020-10-16 05:10:25,925 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 10 selfloop transitions, 8 changer transitions 2/58 dead transitions. [2020-10-16 05:10:25,926 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 58 transitions, 456 flow [2020-10-16 05:10:25,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:10:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:10:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2020-10-16 05:10:25,929 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.825 [2020-10-16 05:10:25,929 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2020-10-16 05:10:25,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2020-10-16 05:10:25,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:25,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2020-10-16 05:10:25,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:10:25,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:10:25,934 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:10:25,934 INFO L185 Difference]: Start difference. First operand has 66 places, 50 transitions, 415 flow. Second operand 5 states and 693 transitions. [2020-10-16 05:10:25,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 58 transitions, 456 flow [2020-10-16 05:10:25,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 58 transitions, 411 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-16 05:10:25,941 INFO L241 Difference]: Finished difference. Result has 63 places, 53 transitions, 412 flow [2020-10-16 05:10:25,941 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=412, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2020-10-16 05:10:25,941 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 30 predicate places. [2020-10-16 05:10:25,942 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 412 flow [2020-10-16 05:10:25,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:10:25,942 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:25,942 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:25,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 05:10:25,942 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:25,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:25,943 INFO L82 PathProgramCache]: Analyzing trace with hash -862015459, now seen corresponding path program 1 times [2020-10-16 05:10:25,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:25,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587771963] [2020-10-16 05:10:25,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:26,010 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:10:26,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587771963] [2020-10-16 05:10:26,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:26,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:10:26,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873895624] [2020-10-16 05:10:26,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:10:26,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:26,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:10:26,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:10:26,013 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2020-10-16 05:10:26,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 412 flow. Second operand 5 states. [2020-10-16 05:10:26,014 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:26,014 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2020-10-16 05:10:26,014 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:26,110 INFO L129 PetriNetUnfolder]: 81/270 cut-off events. [2020-10-16 05:10:26,111 INFO L130 PetriNetUnfolder]: For 1168/1430 co-relation queries the response was YES. [2020-10-16 05:10:26,113 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 270 events. 81/270 cut-off events. For 1168/1430 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1665 event pairs, 7 based on Foata normal form. 186/448 useless extension candidates. Maximal degree in co-relation 1115. Up to 164 conditions per place. [2020-10-16 05:10:26,114 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 6 selfloop transitions, 15 changer transitions 3/60 dead transitions. [2020-10-16 05:10:26,115 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 60 transitions, 493 flow [2020-10-16 05:10:26,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:10:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:10:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 970 transitions. [2020-10-16 05:10:26,119 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8248299319727891 [2020-10-16 05:10:26,119 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 970 transitions. [2020-10-16 05:10:26,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 970 transitions. [2020-10-16 05:10:26,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:26,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 970 transitions. [2020-10-16 05:10:26,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:10:26,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:10:26,125 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:10:26,125 INFO L185 Difference]: Start difference. First operand has 63 places, 53 transitions, 412 flow. Second operand 7 states and 970 transitions. [2020-10-16 05:10:26,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 60 transitions, 493 flow [2020-10-16 05:10:26,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 60 transitions, 462 flow, removed 3 selfloop flow, removed 5 redundant places. [2020-10-16 05:10:26,131 INFO L241 Difference]: Finished difference. Result has 67 places, 57 transitions, 459 flow [2020-10-16 05:10:26,132 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=459, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2020-10-16 05:10:26,132 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 34 predicate places. [2020-10-16 05:10:26,132 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 459 flow [2020-10-16 05:10:26,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:10:26,132 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:26,132 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:10:26,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 05:10:26,133 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:26,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:26,133 INFO L82 PathProgramCache]: Analyzing trace with hash 483350356, now seen corresponding path program 1 times [2020-10-16 05:10:26,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:26,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585681199] [2020-10-16 05:10:26,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:26,211 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:10:26,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585681199] [2020-10-16 05:10:26,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:26,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:10:26,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348904080] [2020-10-16 05:10:26,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:10:26,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:26,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:10:26,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:10:26,215 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2020-10-16 05:10:26,215 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 459 flow. Second operand 6 states. [2020-10-16 05:10:26,215 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:26,215 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2020-10-16 05:10:26,216 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:26,381 INFO L129 PetriNetUnfolder]: 60/230 cut-off events. [2020-10-16 05:10:26,381 INFO L130 PetriNetUnfolder]: For 1372/1771 co-relation queries the response was YES. [2020-10-16 05:10:26,383 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 230 events. 60/230 cut-off events. For 1372/1771 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 1454 event pairs, 0 based on Foata normal form. 163/382 useless extension candidates. Maximal degree in co-relation 1130. Up to 154 conditions per place. [2020-10-16 05:10:26,386 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 2 selfloop transitions, 19 changer transitions 7/60 dead transitions. [2020-10-16 05:10:26,386 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 60 transitions, 523 flow [2020-10-16 05:10:26,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:10:26,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:10:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1241 transitions. [2020-10-16 05:10:26,390 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8207671957671958 [2020-10-16 05:10:26,391 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1241 transitions. [2020-10-16 05:10:26,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1241 transitions. [2020-10-16 05:10:26,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:26,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1241 transitions. [2020-10-16 05:10:26,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:10:26,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:10:26,399 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:10:26,399 INFO L185 Difference]: Start difference. First operand has 67 places, 57 transitions, 459 flow. Second operand 9 states and 1241 transitions. [2020-10-16 05:10:26,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 60 transitions, 523 flow [2020-10-16 05:10:26,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 60 transitions, 457 flow, removed 25 selfloop flow, removed 5 redundant places. [2020-10-16 05:10:26,405 INFO L241 Difference]: Finished difference. Result has 73 places, 53 transitions, 404 flow [2020-10-16 05:10:26,405 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=404, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2020-10-16 05:10:26,406 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2020-10-16 05:10:26,406 INFO L481 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 404 flow [2020-10-16 05:10:26,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:10:26,406 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:26,406 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] [2020-10-16 05:10:26,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 05:10:26,406 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:26,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:26,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1315966220, now seen corresponding path program 1 times [2020-10-16 05:10:26,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:26,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697156212] [2020-10-16 05:10:26,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:26,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:10:26,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697156212] [2020-10-16 05:10:26,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:26,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:10:26,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088687586] [2020-10-16 05:10:26,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:10:26,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:26,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:10:26,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:10:26,559 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 168 [2020-10-16 05:10:26,560 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 404 flow. Second operand 7 states. [2020-10-16 05:10:26,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:26,561 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 168 [2020-10-16 05:10:26,561 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:26,676 INFO L129 PetriNetUnfolder]: 79/321 cut-off events. [2020-10-16 05:10:26,676 INFO L130 PetriNetUnfolder]: For 1180/1238 co-relation queries the response was YES. [2020-10-16 05:10:26,679 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1340 conditions, 321 events. 79/321 cut-off events. For 1180/1238 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 2312 event pairs, 0 based on Foata normal form. 24/333 useless extension candidates. Maximal degree in co-relation 1309. Up to 95 conditions per place. [2020-10-16 05:10:26,680 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 6 selfloop transitions, 2 changer transitions 11/58 dead transitions. [2020-10-16 05:10:26,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 58 transitions, 471 flow [2020-10-16 05:10:26,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:10:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:10:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 839 transitions. [2020-10-16 05:10:26,684 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7134353741496599 [2020-10-16 05:10:26,684 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 839 transitions. [2020-10-16 05:10:26,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 839 transitions. [2020-10-16 05:10:26,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:26,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 839 transitions. [2020-10-16 05:10:26,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:10:26,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:10:26,689 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:10:26,689 INFO L185 Difference]: Start difference. First operand has 73 places, 53 transitions, 404 flow. Second operand 7 states and 839 transitions. [2020-10-16 05:10:26,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 58 transitions, 471 flow [2020-10-16 05:10:26,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 58 transitions, 392 flow, removed 17 selfloop flow, removed 10 redundant places. [2020-10-16 05:10:26,699 INFO L241 Difference]: Finished difference. Result has 72 places, 46 transitions, 291 flow [2020-10-16 05:10:26,700 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=291, PETRI_PLACES=72, PETRI_TRANSITIONS=46} [2020-10-16 05:10:26,700 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 39 predicate places. [2020-10-16 05:10:26,700 INFO L481 AbstractCegarLoop]: Abstraction has has 72 places, 46 transitions, 291 flow [2020-10-16 05:10:26,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:10:26,701 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:26,701 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] [2020-10-16 05:10:26,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 05:10:26,701 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:26,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:26,701 INFO L82 PathProgramCache]: Analyzing trace with hash -713843904, now seen corresponding path program 2 times [2020-10-16 05:10:26,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:26,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307041190] [2020-10-16 05:10:26,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:10:26,746 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:10:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:10:26,803 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:10:26,872 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 05:10:26,875 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 05:10:26,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 05:10:26,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:10:26,909 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,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:10:26,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,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:10:26,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,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:10:26,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,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:10:26,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,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:10:26,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,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:10:26,914 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,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:10:26,915 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,915 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:10:26,915 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,915 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:10:26,915 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,915 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:10:26,916 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,916 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:10:26,917 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,917 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:10:26,918 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,918 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:10:26,918 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,918 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:10:26,919 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,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:10:26,919 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,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:10:26,920 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,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:10:26,920 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,927 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:10:26,927 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,927 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:10:26,928 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,928 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:10:26,928 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,928 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:10:26,929 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,929 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:10:26,929 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,929 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:10:26,930 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,930 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:10:26,930 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,930 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:10:26,931 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,931 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:10:26,931 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:26,931 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:10:26,932 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:10:27,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:10:27 BasicIcfg [2020-10-16 05:10:27,052 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 05:10:27,056 INFO L168 Benchmark]: Toolchain (without parser) took 13664.90 ms. Allocated memory was 249.6 MB in the beginning and 503.3 MB in the end (delta: 253.8 MB). Free memory was 203.9 MB in the beginning and 366.5 MB in the end (delta: -162.6 MB). Peak memory consumption was 91.2 MB. Max. memory is 14.2 GB. [2020-10-16 05:10:27,056 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 249.6 MB. Free memory is still 225.9 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 05:10:27,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 909.07 ms. Allocated memory was 249.6 MB in the beginning and 316.1 MB in the end (delta: 66.6 MB). Free memory was 203.9 MB in the beginning and 264.5 MB in the end (delta: -60.6 MB). Peak memory consumption was 26.8 MB. Max. memory is 14.2 GB. [2020-10-16 05:10:27,060 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.43 ms. Allocated memory is still 316.1 MB. Free memory was 264.5 MB in the beginning and 259.4 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 14.2 GB. [2020-10-16 05:10:27,061 INFO L168 Benchmark]: Boogie Preprocessor took 39.87 ms. Allocated memory is still 316.1 MB. Free memory was 259.4 MB in the beginning and 256.9 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:10:27,062 INFO L168 Benchmark]: RCFGBuilder took 2050.08 ms. Allocated memory was 316.1 MB in the beginning and 353.9 MB in the end (delta: 37.7 MB). Free memory was 256.9 MB in the beginning and 198.9 MB in the end (delta: 58.0 MB). Peak memory consumption was 95.7 MB. Max. memory is 14.2 GB. [2020-10-16 05:10:27,062 INFO L168 Benchmark]: TraceAbstraction took 10591.81 ms. Allocated memory was 353.9 MB in the beginning and 503.3 MB in the end (delta: 149.4 MB). Free memory was 198.9 MB in the beginning and 366.5 MB in the end (delta: -167.5 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 05:10:27,072 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.36 ms. Allocated memory is still 249.6 MB. Free memory is still 225.9 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 909.07 ms. Allocated memory was 249.6 MB in the beginning and 316.1 MB in the end (delta: 66.6 MB). Free memory was 203.9 MB in the beginning and 264.5 MB in the end (delta: -60.6 MB). Peak memory consumption was 26.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 65.43 ms. Allocated memory is still 316.1 MB. Free memory was 264.5 MB in the beginning and 259.4 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.87 ms. Allocated memory is still 316.1 MB. Free memory was 259.4 MB in the beginning and 256.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2050.08 ms. Allocated memory was 316.1 MB in the beginning and 353.9 MB in the end (delta: 37.7 MB). Free memory was 256.9 MB in the beginning and 198.9 MB in the end (delta: 58.0 MB). Peak memory consumption was 95.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 10591.81 ms. Allocated memory was 353.9 MB in the beginning and 503.3 MB in the end (delta: 149.4 MB). Free memory was 198.9 MB in the beginning and 366.5 MB in the end (delta: -167.5 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1043 VarBasedMoverChecksPositive, 50 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 31 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 147 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.2s, 96 PlacesBefore, 33 PlacesAfterwards, 88 TransitionsBefore, 24 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 4027 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_p0_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L724] 0 int z = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L804] 0 pthread_t t2522; [L805] FCALL, FORK 0 pthread_create(&t2522, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 0 pthread_t t2523; [L807] FCALL, FORK 0 pthread_create(&t2523, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 0 pthread_t t2524; [L809] FCALL, FORK 0 pthread_create(&t2524, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$w_buff1 = y$w_buff0 [L768] 3 y$w_buff0 = 2 [L769] 3 y$w_buff1_used = y$w_buff0_used [L770] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L772] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L776] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L735] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L753] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L756] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L757] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L742] 1 return 0; [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L782] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L782] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L783] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L784] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L785] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L786] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L811] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L815] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L816] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L816] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L817] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L817] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L818] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L819] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 y$flush_delayed = weak$$choice2 [L825] 0 y$mem_tmp = y [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L826] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L827] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L827] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L827] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L827] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L828] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L828] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L828] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L829] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L829] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L831] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L832] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L834] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L834] 0 y = y$flush_delayed ? y$mem_tmp : y [L835] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 90 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: 16, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 103 SDtfs, 92 SDslu, 106 SDs, 0 SdLazy, 494 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=543occurred in iteration=9, 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.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 15596 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...