/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/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:26:25,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:26:25,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:26:25,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:26:25,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:26:25,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:26:25,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:26:25,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:26:25,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:26:25,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:26:25,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:26:25,235 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:26:25,235 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:26:25,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:26:25,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:26:25,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:26:25,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:26:25,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:26:25,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:26:25,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:26:25,257 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:26:25,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:26:25,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:26:25,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:26:25,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:26:25,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:26:25,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:26:25,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:26:25,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:26:25,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:26:25,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:26:25,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:26:25,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:26:25,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:26:25,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:26:25,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:26:25,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:26:25,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:26:25,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:26:25,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:26:25,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:26:25,286 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:26:25,331 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:26:25,331 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:26:25,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:26:25,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:26:25,334 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:26:25,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:26:25,335 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:26:25,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:26:25,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:26:25,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:26:25,337 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:26:25,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:26:25,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:26:25,338 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:26:25,338 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:26:25,338 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:26:25,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:26:25,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:26:25,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:26:25,339 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:26:25,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:26:25,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:26:25,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:26:25,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:26:25,340 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:26:25,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:26:25,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:26:25,341 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:26:25,341 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:26:25,341 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:26:25,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:26:25,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:26:25,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:26:25,698 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:26:25,699 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:26:25,700 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i [2020-10-11 18:26:25,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca1621db/e335bd7d72ea4b938c2c2c64f9c6b240/FLAGbdd2096cb [2020-10-11 18:26:26,325 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:26:26,326 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i [2020-10-11 18:26:26,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca1621db/e335bd7d72ea4b938c2c2c64f9c6b240/FLAGbdd2096cb [2020-10-11 18:26:26,528 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca1621db/e335bd7d72ea4b938c2c2c64f9c6b240 [2020-10-11 18:26:26,536 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:26:26,538 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:26:26,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:26:26,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:26:26,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:26:26,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:26:26" (1/1) ... [2020-10-11 18:26:26,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c51b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:26, skipping insertion in model container [2020-10-11 18:26:26,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:26:26" (1/1) ... [2020-10-11 18:26:26,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:26:26,605 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:26:27,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:26:27,069 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:26:27,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:26:27,256 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:26:27,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:27 WrapperNode [2020-10-11 18:26:27,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:26:27,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:26:27,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:26:27,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:26:27,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:27" (1/1) ... [2020-10-11 18:26:27,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:27" (1/1) ... [2020-10-11 18:26:27,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:26:27,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:26:27,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:26:27,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:26:27,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:27" (1/1) ... [2020-10-11 18:26:27,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:27" (1/1) ... [2020-10-11 18:26:27,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:27" (1/1) ... [2020-10-11 18:26:27,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:27" (1/1) ... [2020-10-11 18:26:27,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:27" (1/1) ... [2020-10-11 18:26:27,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:27" (1/1) ... [2020-10-11 18:26:27,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:27" (1/1) ... [2020-10-11 18:26:27,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:26:27,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:26:27,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:26:27,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:26:27,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:27" (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-11 18:26:27,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:26:27,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:26:27,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:26:27,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:26:27,454 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:26:27,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:26:27,455 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:26:27,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:26:27,455 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:26:27,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:26:27,455 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-11 18:26:27,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-11 18:26:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:26:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:26:27,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:26:27,458 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:26:29,347 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:26:29,348 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:26:29,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:26:29 BoogieIcfgContainer [2020-10-11 18:26:29,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:26:29,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:26:29,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:26:29,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:26:29,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:26:26" (1/3) ... [2020-10-11 18:26:29,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18911aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:26:29, skipping insertion in model container [2020-10-11 18:26:29,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:27" (2/3) ... [2020-10-11 18:26:29,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18911aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:26:29, skipping insertion in model container [2020-10-11 18:26:29,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:26:29" (3/3) ... [2020-10-11 18:26:29,359 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_tso.opt.i [2020-10-11 18:26:29,370 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:26:29,378 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:26:29,379 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:26:29,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,410 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,410 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,412 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,412 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,413 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,414 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,417 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,417 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,417 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,418 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,425 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,426 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,430 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,431 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,432 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,432 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,435 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,436 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,438 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,438 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:29,455 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-11 18:26:29,476 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:26:29,477 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:26:29,477 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:26:29,477 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:26:29,477 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:26:29,477 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:26:29,478 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:26:29,478 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:26:29,493 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow [2020-10-11 18:26:29,543 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-11 18:26:29,543 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:26:29,549 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-11 18:26:29,549 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 107 transitions, 234 flow [2020-10-11 18:26:29,556 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 103 transitions, 218 flow [2020-10-11 18:26:29,576 INFO L129 PetriNetUnfolder]: 0/70 cut-off events. [2020-10-11 18:26:29,576 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:26:29,577 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:29,578 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:29,578 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:29,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:29,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1614687930, now seen corresponding path program 1 times [2020-10-11 18:26:29,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:29,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109986379] [2020-10-11 18:26:29,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:29,958 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-11 18:26:29,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109986379] [2020-10-11 18:26:29,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:29,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:26:29,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82045017] [2020-10-11 18:26:29,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:26:29,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:29,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:26:29,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:26:30,123 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 107 [2020-10-11 18:26:30,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 103 transitions, 218 flow. Second operand 3 states. [2020-10-11 18:26:30,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:30,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 107 [2020-10-11 18:26:30,127 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:30,161 INFO L129 PetriNetUnfolder]: 0/100 cut-off events. [2020-10-11 18:26:30,161 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:26:30,161 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 100 events. 0/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 4/102 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:26:30,163 INFO L132 encePairwiseOnDemand]: 102/107 looper letters, 0 selfloop transitions, 2 changer transitions 13/100 dead transitions. [2020-10-11 18:26:30,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 100 transitions, 216 flow [2020-10-11 18:26:30,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:26:30,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:26:30,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2020-10-11 18:26:30,180 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9750778816199377 [2020-10-11 18:26:30,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2020-10-11 18:26:30,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2020-10-11 18:26:30,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:30,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2020-10-11 18:26:30,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:26:30,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:26:30,198 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:26:30,200 INFO L185 Difference]: Start difference. First operand has 114 places, 103 transitions, 218 flow. Second operand 3 states and 313 transitions. [2020-10-11 18:26:30,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 100 transitions, 216 flow [2020-10-11 18:26:30,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 100 transitions, 212 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-11 18:26:30,210 INFO L241 Difference]: Finished difference. Result has 111 places, 87 transitions, 186 flow [2020-10-11 18:26:30,213 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=111, PETRI_TRANSITIONS=87} [2020-10-11 18:26:30,214 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places. [2020-10-11 18:26:30,214 INFO L481 AbstractCegarLoop]: Abstraction has has 111 places, 87 transitions, 186 flow [2020-10-11 18:26:30,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:26:30,215 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:30,215 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:30,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:26:30,215 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:30,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:30,216 INFO L82 PathProgramCache]: Analyzing trace with hash 343442451, now seen corresponding path program 1 times [2020-10-11 18:26:30,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:30,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511489960] [2020-10-11 18:26:30,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:30,495 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-11 18:26:30,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511489960] [2020-10-11 18:26:30,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:30,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:26:30,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900289187] [2020-10-11 18:26:30,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:26:30,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:30,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:26:30,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:26:30,629 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107 [2020-10-11 18:26:30,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 87 transitions, 186 flow. Second operand 6 states. [2020-10-11 18:26:30,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:30,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107 [2020-10-11 18:26:30,630 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:30,788 INFO L129 PetriNetUnfolder]: 24/158 cut-off events. [2020-10-11 18:26:30,788 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:26:30,790 INFO L80 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 158 events. 24/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 421 event pairs, 5 based on Foata normal form. 4/160 useless extension candidates. Maximal degree in co-relation 191. Up to 31 conditions per place. [2020-10-11 18:26:30,791 INFO L132 encePairwiseOnDemand]: 100/107 looper letters, 8 selfloop transitions, 3 changer transitions 19/108 dead transitions. [2020-10-11 18:26:30,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 108 transitions, 288 flow [2020-10-11 18:26:30,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:26:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:26:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 896 transitions. [2020-10-11 18:26:30,800 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9304257528556594 [2020-10-11 18:26:30,800 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 896 transitions. [2020-10-11 18:26:30,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 896 transitions. [2020-10-11 18:26:30,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:30,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 896 transitions. [2020-10-11 18:26:30,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:26:30,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:26:30,810 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:26:30,810 INFO L185 Difference]: Start difference. First operand has 111 places, 87 transitions, 186 flow. Second operand 9 states and 896 transitions. [2020-10-11 18:26:30,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 108 transitions, 288 flow [2020-10-11 18:26:30,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 108 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:26:30,815 INFO L241 Difference]: Finished difference. Result has 111 places, 89 transitions, 225 flow [2020-10-11 18:26:30,816 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=225, PETRI_PLACES=111, PETRI_TRANSITIONS=89} [2020-10-11 18:26:30,817 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places. [2020-10-11 18:26:30,817 INFO L481 AbstractCegarLoop]: Abstraction has has 111 places, 89 transitions, 225 flow [2020-10-11 18:26:30,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:26:30,817 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:30,817 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:30,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:26:30,818 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:30,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:30,818 INFO L82 PathProgramCache]: Analyzing trace with hash 742380052, now seen corresponding path program 1 times [2020-10-11 18:26:30,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:30,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658152228] [2020-10-11 18:26:30,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:31,052 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-11 18:26:31,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658152228] [2020-10-11 18:26:31,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:31,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:26:31,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932033075] [2020-10-11 18:26:31,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:26:31,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:31,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:26:31,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:26:31,231 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107 [2020-10-11 18:26:31,232 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 89 transitions, 225 flow. Second operand 6 states. [2020-10-11 18:26:31,232 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:31,232 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107 [2020-10-11 18:26:31,232 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:31,450 INFO L129 PetriNetUnfolder]: 79/324 cut-off events. [2020-10-11 18:26:31,450 INFO L130 PetriNetUnfolder]: For 264/272 co-relation queries the response was YES. [2020-10-11 18:26:31,454 INFO L80 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 324 events. 79/324 cut-off events. For 264/272 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1524 event pairs, 18 based on Foata normal form. 10/324 useless extension candidates. Maximal degree in co-relation 636. Up to 64 conditions per place. [2020-10-11 18:26:31,456 INFO L132 encePairwiseOnDemand]: 100/107 looper letters, 8 selfloop transitions, 3 changer transitions 19/110 dead transitions. [2020-10-11 18:26:31,456 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 110 transitions, 345 flow [2020-10-11 18:26:31,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:26:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:26:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 896 transitions. [2020-10-11 18:26:31,460 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9304257528556594 [2020-10-11 18:26:31,460 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 896 transitions. [2020-10-11 18:26:31,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 896 transitions. [2020-10-11 18:26:31,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:31,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 896 transitions. [2020-10-11 18:26:31,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:26:31,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:26:31,465 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:26:31,465 INFO L185 Difference]: Start difference. First operand has 111 places, 89 transitions, 225 flow. Second operand 9 states and 896 transitions. [2020-10-11 18:26:31,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 110 transitions, 345 flow [2020-10-11 18:26:31,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 110 transitions, 328 flow, removed 7 selfloop flow, removed 4 redundant places. [2020-10-11 18:26:31,471 INFO L241 Difference]: Finished difference. Result has 116 places, 91 transitions, 259 flow [2020-10-11 18:26:31,472 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=259, PETRI_PLACES=116, PETRI_TRANSITIONS=91} [2020-10-11 18:26:31,472 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 2 predicate places. [2020-10-11 18:26:31,472 INFO L481 AbstractCegarLoop]: Abstraction has has 116 places, 91 transitions, 259 flow [2020-10-11 18:26:31,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:26:31,473 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:31,473 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:31,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:26:31,473 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:31,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:31,474 INFO L82 PathProgramCache]: Analyzing trace with hash -408379412, now seen corresponding path program 1 times [2020-10-11 18:26:31,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:31,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130051388] [2020-10-11 18:26:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:31,696 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-11 18:26:31,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130051388] [2020-10-11 18:26:31,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:31,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:26:31,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577783663] [2020-10-11 18:26:31,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:26:31,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:31,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:26:31,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:26:31,814 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107 [2020-10-11 18:26:31,815 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 91 transitions, 259 flow. Second operand 6 states. [2020-10-11 18:26:31,815 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:31,815 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107 [2020-10-11 18:26:31,815 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:31,997 INFO L129 PetriNetUnfolder]: 34/264 cut-off events. [2020-10-11 18:26:31,997 INFO L130 PetriNetUnfolder]: For 433/496 co-relation queries the response was YES. [2020-10-11 18:26:31,999 INFO L80 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 264 events. 34/264 cut-off events. For 433/496 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1215 event pairs, 4 based on Foata normal form. 8/264 useless extension candidates. Maximal degree in co-relation 611. Up to 36 conditions per place. [2020-10-11 18:26:32,001 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 12 selfloop transitions, 3 changer transitions 10/105 dead transitions. [2020-10-11 18:26:32,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 105 transitions, 407 flow [2020-10-11 18:26:32,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:26:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:26:32,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2020-10-11 18:26:32,005 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9241952232606438 [2020-10-11 18:26:32,005 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2020-10-11 18:26:32,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2020-10-11 18:26:32,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:32,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2020-10-11 18:26:32,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:26:32,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:26:32,010 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:26:32,010 INFO L185 Difference]: Start difference. First operand has 116 places, 91 transitions, 259 flow. Second operand 9 states and 890 transitions. [2020-10-11 18:26:32,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 105 transitions, 407 flow [2020-10-11 18:26:32,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 105 transitions, 376 flow, removed 14 selfloop flow, removed 4 redundant places. [2020-10-11 18:26:32,016 INFO L241 Difference]: Finished difference. Result has 121 places, 91 transitions, 271 flow [2020-10-11 18:26:32,016 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=271, PETRI_PLACES=121, PETRI_TRANSITIONS=91} [2020-10-11 18:26:32,017 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 7 predicate places. [2020-10-11 18:26:32,017 INFO L481 AbstractCegarLoop]: Abstraction has has 121 places, 91 transitions, 271 flow [2020-10-11 18:26:32,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:26:32,017 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:32,017 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:32,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:26:32,018 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:32,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:32,018 INFO L82 PathProgramCache]: Analyzing trace with hash 419512145, now seen corresponding path program 1 times [2020-10-11 18:26:32,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:32,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326769468] [2020-10-11 18:26:32,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:32,273 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-11 18:26:32,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326769468] [2020-10-11 18:26:32,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:32,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:26:32,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345867390] [2020-10-11 18:26:32,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:26:32,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:32,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:26:32,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:26:33,012 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107 [2020-10-11 18:26:33,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 91 transitions, 271 flow. Second operand 11 states. [2020-10-11 18:26:33,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:33,014 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107 [2020-10-11 18:26:33,014 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:33,700 INFO L129 PetriNetUnfolder]: 844/1866 cut-off events. [2020-10-11 18:26:33,700 INFO L130 PetriNetUnfolder]: For 5661/5782 co-relation queries the response was YES. [2020-10-11 18:26:33,722 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5695 conditions, 1866 events. 844/1866 cut-off events. For 5661/5782 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 13903 event pairs, 400 based on Foata normal form. 63/1848 useless extension candidates. Maximal degree in co-relation 5631. Up to 677 conditions per place. [2020-10-11 18:26:33,735 INFO L132 encePairwiseOnDemand]: 94/107 looper letters, 12 selfloop transitions, 11 changer transitions 34/132 dead transitions. [2020-10-11 18:26:33,736 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 132 transitions, 527 flow [2020-10-11 18:26:33,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 18:26:33,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 18:26:33,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1468 transitions. [2020-10-11 18:26:33,786 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8574766355140186 [2020-10-11 18:26:33,786 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1468 transitions. [2020-10-11 18:26:33,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1468 transitions. [2020-10-11 18:26:33,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:33,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1468 transitions. [2020-10-11 18:26:33,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 18:26:33,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 18:26:33,795 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 18:26:33,795 INFO L185 Difference]: Start difference. First operand has 121 places, 91 transitions, 271 flow. Second operand 16 states and 1468 transitions. [2020-10-11 18:26:33,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 132 transitions, 527 flow [2020-10-11 18:26:33,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 132 transitions, 482 flow, removed 21 selfloop flow, removed 7 redundant places. [2020-10-11 18:26:33,816 INFO L241 Difference]: Finished difference. Result has 134 places, 97 transitions, 342 flow [2020-10-11 18:26:33,817 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=342, PETRI_PLACES=134, PETRI_TRANSITIONS=97} [2020-10-11 18:26:33,817 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 20 predicate places. [2020-10-11 18:26:33,817 INFO L481 AbstractCegarLoop]: Abstraction has has 134 places, 97 transitions, 342 flow [2020-10-11 18:26:33,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:26:33,818 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:33,818 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:33,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:26:33,818 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:33,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:33,819 INFO L82 PathProgramCache]: Analyzing trace with hash 803705807, now seen corresponding path program 1 times [2020-10-11 18:26:33,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:33,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293286711] [2020-10-11 18:26:33,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:34,034 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-11 18:26:34,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293286711] [2020-10-11 18:26:34,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:34,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:26:34,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923657516] [2020-10-11 18:26:34,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:26:34,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:34,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:26:34,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:26:34,581 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107 [2020-10-11 18:26:34,582 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 97 transitions, 342 flow. Second operand 10 states. [2020-10-11 18:26:34,582 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:34,582 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107 [2020-10-11 18:26:34,582 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:35,324 INFO L129 PetriNetUnfolder]: 624/1427 cut-off events. [2020-10-11 18:26:35,324 INFO L130 PetriNetUnfolder]: For 6352/6447 co-relation queries the response was YES. [2020-10-11 18:26:35,338 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5511 conditions, 1427 events. 624/1427 cut-off events. For 6352/6447 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 9809 event pairs, 150 based on Foata normal form. 50/1423 useless extension candidates. Maximal degree in co-relation 5437. Up to 503 conditions per place. [2020-10-11 18:26:35,349 INFO L132 encePairwiseOnDemand]: 96/107 looper letters, 18 selfloop transitions, 9 changer transitions 20/123 dead transitions. [2020-10-11 18:26:35,349 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 123 transitions, 610 flow [2020-10-11 18:26:35,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:26:35,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:26:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1202 transitions. [2020-10-11 18:26:35,358 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8641265276779295 [2020-10-11 18:26:35,365 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1202 transitions. [2020-10-11 18:26:35,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1202 transitions. [2020-10-11 18:26:35,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:35,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1202 transitions. [2020-10-11 18:26:35,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:26:35,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:26:35,373 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:26:35,373 INFO L185 Difference]: Start difference. First operand has 134 places, 97 transitions, 342 flow. Second operand 13 states and 1202 transitions. [2020-10-11 18:26:35,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 123 transitions, 610 flow [2020-10-11 18:26:35,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 123 transitions, 580 flow, removed 12 selfloop flow, removed 6 redundant places. [2020-10-11 18:26:35,384 INFO L241 Difference]: Finished difference. Result has 139 places, 100 transitions, 387 flow [2020-10-11 18:26:35,385 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=387, PETRI_PLACES=139, PETRI_TRANSITIONS=100} [2020-10-11 18:26:35,385 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 25 predicate places. [2020-10-11 18:26:35,385 INFO L481 AbstractCegarLoop]: Abstraction has has 139 places, 100 transitions, 387 flow [2020-10-11 18:26:35,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:26:35,385 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:35,386 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:35,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:26:35,386 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:35,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:35,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1388607095, now seen corresponding path program 1 times [2020-10-11 18:26:35,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:35,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123654560] [2020-10-11 18:26:35,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:35,742 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-11 18:26:35,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123654560] [2020-10-11 18:26:35,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:35,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:26:35,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524046377] [2020-10-11 18:26:35,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:26:35,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:35,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:26:35,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:26:36,706 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107 [2020-10-11 18:26:36,707 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 100 transitions, 387 flow. Second operand 12 states. [2020-10-11 18:26:36,707 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:36,708 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107 [2020-10-11 18:26:36,708 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:37,420 INFO L129 PetriNetUnfolder]: 521/1255 cut-off events. [2020-10-11 18:26:37,420 INFO L130 PetriNetUnfolder]: For 7499/7681 co-relation queries the response was YES. [2020-10-11 18:26:37,433 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5221 conditions, 1255 events. 521/1255 cut-off events. For 7499/7681 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 8755 event pairs, 145 based on Foata normal form. 52/1252 useless extension candidates. Maximal degree in co-relation 5140. Up to 418 conditions per place. [2020-10-11 18:26:37,443 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 16 selfloop transitions, 11 changer transitions 23/125 dead transitions. [2020-10-11 18:26:37,443 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 125 transitions, 679 flow [2020-10-11 18:26:37,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:26:37,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:26:37,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1278 transitions. [2020-10-11 18:26:37,448 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8531375166889186 [2020-10-11 18:26:37,448 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1278 transitions. [2020-10-11 18:26:37,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1278 transitions. [2020-10-11 18:26:37,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:37,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1278 transitions. [2020-10-11 18:26:37,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:26:37,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:26:37,455 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:26:37,455 INFO L185 Difference]: Start difference. First operand has 139 places, 100 transitions, 387 flow. Second operand 14 states and 1278 transitions. [2020-10-11 18:26:37,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 125 transitions, 679 flow [2020-10-11 18:26:37,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 125 transitions, 612 flow, removed 28 selfloop flow, removed 13 redundant places. [2020-10-11 18:26:37,469 INFO L241 Difference]: Finished difference. Result has 140 places, 101 transitions, 404 flow [2020-10-11 18:26:37,469 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=404, PETRI_PLACES=140, PETRI_TRANSITIONS=101} [2020-10-11 18:26:37,469 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 26 predicate places. [2020-10-11 18:26:37,470 INFO L481 AbstractCegarLoop]: Abstraction has has 140 places, 101 transitions, 404 flow [2020-10-11 18:26:37,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:26:37,470 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:37,470 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:37,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:26:37,470 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:37,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:37,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1601007023, now seen corresponding path program 1 times [2020-10-11 18:26:37,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:37,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841726831] [2020-10-11 18:26:37,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:37,761 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-11 18:26:37,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841726831] [2020-10-11 18:26:37,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:37,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:26:37,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665464446] [2020-10-11 18:26:37,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:26:37,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:37,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:26:37,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:26:38,084 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 107 [2020-10-11 18:26:38,085 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 101 transitions, 404 flow. Second operand 9 states. [2020-10-11 18:26:38,085 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:38,085 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 107 [2020-10-11 18:26:38,085 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:38,466 INFO L129 PetriNetUnfolder]: 446/1097 cut-off events. [2020-10-11 18:26:38,466 INFO L130 PetriNetUnfolder]: For 7815/7984 co-relation queries the response was YES. [2020-10-11 18:26:38,479 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5060 conditions, 1097 events. 446/1097 cut-off events. For 7815/7984 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7359 event pairs, 152 based on Foata normal form. 40/1092 useless extension candidates. Maximal degree in co-relation 4981. Up to 408 conditions per place. [2020-10-11 18:26:38,490 INFO L132 encePairwiseOnDemand]: 96/107 looper letters, 18 selfloop transitions, 11 changer transitions 10/116 dead transitions. [2020-10-11 18:26:38,490 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 116 transitions, 630 flow [2020-10-11 18:26:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:26:38,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:26:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 844 transitions. [2020-10-11 18:26:38,494 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8764278296988577 [2020-10-11 18:26:38,495 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 844 transitions. [2020-10-11 18:26:38,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 844 transitions. [2020-10-11 18:26:38,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:38,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 844 transitions. [2020-10-11 18:26:38,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:26:38,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:26:38,500 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:26:38,500 INFO L185 Difference]: Start difference. First operand has 140 places, 101 transitions, 404 flow. Second operand 9 states and 844 transitions. [2020-10-11 18:26:38,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 116 transitions, 630 flow [2020-10-11 18:26:38,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 116 transitions, 597 flow, removed 8 selfloop flow, removed 9 redundant places. [2020-10-11 18:26:38,512 INFO L241 Difference]: Finished difference. Result has 137 places, 104 transitions, 443 flow [2020-10-11 18:26:38,512 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=443, PETRI_PLACES=137, PETRI_TRANSITIONS=104} [2020-10-11 18:26:38,512 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 23 predicate places. [2020-10-11 18:26:38,513 INFO L481 AbstractCegarLoop]: Abstraction has has 137 places, 104 transitions, 443 flow [2020-10-11 18:26:38,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:26:38,513 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:38,513 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:38,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:26:38,514 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:38,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:38,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1738273753, now seen corresponding path program 2 times [2020-10-11 18:26:38,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:38,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2331767] [2020-10-11 18:26:38,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:38,810 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-11 18:26:38,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2331767] [2020-10-11 18:26:38,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:38,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:26:38,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563973533] [2020-10-11 18:26:38,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:26:38,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:38,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:26:38,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:26:39,924 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107 [2020-10-11 18:26:39,925 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 104 transitions, 443 flow. Second operand 11 states. [2020-10-11 18:26:39,925 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:39,925 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107 [2020-10-11 18:26:39,925 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:40,427 INFO L129 PetriNetUnfolder]: 449/1106 cut-off events. [2020-10-11 18:26:40,427 INFO L130 PetriNetUnfolder]: For 9018/9270 co-relation queries the response was YES. [2020-10-11 18:26:40,433 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5439 conditions, 1106 events. 449/1106 cut-off events. For 9018/9270 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7426 event pairs, 145 based on Foata normal form. 44/1107 useless extension candidates. Maximal degree in co-relation 5360. Up to 411 conditions per place. [2020-10-11 18:26:40,440 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 20 selfloop transitions, 13 changer transitions 19/127 dead transitions. [2020-10-11 18:26:40,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 127 transitions, 815 flow [2020-10-11 18:26:40,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:26:40,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:26:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1190 transitions. [2020-10-11 18:26:40,446 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8554996405463695 [2020-10-11 18:26:40,446 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1190 transitions. [2020-10-11 18:26:40,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1190 transitions. [2020-10-11 18:26:40,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:40,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1190 transitions. [2020-10-11 18:26:40,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:26:40,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:26:40,453 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:26:40,453 INFO L185 Difference]: Start difference. First operand has 137 places, 104 transitions, 443 flow. Second operand 13 states and 1190 transitions. [2020-10-11 18:26:40,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 127 transitions, 815 flow [2020-10-11 18:26:40,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 127 transitions, 699 flow, removed 49 selfloop flow, removed 10 redundant places. [2020-10-11 18:26:40,465 INFO L241 Difference]: Finished difference. Result has 143 places, 106 transitions, 466 flow [2020-10-11 18:26:40,466 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=466, PETRI_PLACES=143, PETRI_TRANSITIONS=106} [2020-10-11 18:26:40,466 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 29 predicate places. [2020-10-11 18:26:40,466 INFO L481 AbstractCegarLoop]: Abstraction has has 143 places, 106 transitions, 466 flow [2020-10-11 18:26:40,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:26:40,466 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:40,466 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:40,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:26:40,467 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:40,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:40,467 INFO L82 PathProgramCache]: Analyzing trace with hash -937042383, now seen corresponding path program 3 times [2020-10-11 18:26:40,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:40,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738784974] [2020-10-11 18:26:40,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:40,733 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-11 18:26:40,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738784974] [2020-10-11 18:26:40,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:40,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:26:40,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361160581] [2020-10-11 18:26:40,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:26:40,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:40,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:26:40,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:26:41,824 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107 [2020-10-11 18:26:41,825 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 106 transitions, 466 flow. Second operand 11 states. [2020-10-11 18:26:41,825 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:41,825 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107 [2020-10-11 18:26:41,826 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:42,324 INFO L129 PetriNetUnfolder]: 454/1126 cut-off events. [2020-10-11 18:26:42,324 INFO L130 PetriNetUnfolder]: For 11043/11226 co-relation queries the response was YES. [2020-10-11 18:26:42,335 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6147 conditions, 1126 events. 454/1126 cut-off events. For 11043/11226 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 7647 event pairs, 110 based on Foata normal form. 44/1128 useless extension candidates. Maximal degree in co-relation 6067. Up to 414 conditions per place. [2020-10-11 18:26:42,345 INFO L132 encePairwiseOnDemand]: 96/107 looper letters, 19 selfloop transitions, 16 changer transitions 19/130 dead transitions. [2020-10-11 18:26:42,345 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 130 transitions, 928 flow [2020-10-11 18:26:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:26:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:26:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1201 transitions. [2020-10-11 18:26:42,349 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8634076204169662 [2020-10-11 18:26:42,349 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1201 transitions. [2020-10-11 18:26:42,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1201 transitions. [2020-10-11 18:26:42,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:42,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1201 transitions. [2020-10-11 18:26:42,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:26:42,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:26:42,355 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:26:42,356 INFO L185 Difference]: Start difference. First operand has 143 places, 106 transitions, 466 flow. Second operand 13 states and 1201 transitions. [2020-10-11 18:26:42,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 130 transitions, 928 flow [2020-10-11 18:26:42,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 130 transitions, 879 flow, removed 13 selfloop flow, removed 8 redundant places. [2020-10-11 18:26:42,371 INFO L241 Difference]: Finished difference. Result has 148 places, 110 transitions, 545 flow [2020-10-11 18:26:42,371 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=545, PETRI_PLACES=148, PETRI_TRANSITIONS=110} [2020-10-11 18:26:42,372 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 34 predicate places. [2020-10-11 18:26:42,372 INFO L481 AbstractCegarLoop]: Abstraction has has 148 places, 110 transitions, 545 flow [2020-10-11 18:26:42,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:26:42,372 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:42,372 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:42,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:26:42,373 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:42,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:42,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1862385885, now seen corresponding path program 4 times [2020-10-11 18:26:42,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:42,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282110019] [2020-10-11 18:26:42,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:42,726 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-11 18:26:42,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282110019] [2020-10-11 18:26:42,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:42,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:26:42,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685067877] [2020-10-11 18:26:42,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:26:42,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:42,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:26:42,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:26:44,011 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107 [2020-10-11 18:26:44,012 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 110 transitions, 545 flow. Second operand 11 states. [2020-10-11 18:26:44,012 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:44,012 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107 [2020-10-11 18:26:44,012 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:44,471 INFO L129 PetriNetUnfolder]: 438/1191 cut-off events. [2020-10-11 18:26:44,471 INFO L130 PetriNetUnfolder]: For 16214/16425 co-relation queries the response was YES. [2020-10-11 18:26:44,485 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6891 conditions, 1191 events. 438/1191 cut-off events. For 16214/16425 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8695 event pairs, 98 based on Foata normal form. 44/1195 useless extension candidates. Maximal degree in co-relation 6806. Up to 332 conditions per place. [2020-10-11 18:26:44,497 INFO L132 encePairwiseOnDemand]: 96/107 looper letters, 31 selfloop transitions, 12 changer transitions 19/137 dead transitions. [2020-10-11 18:26:44,497 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 137 transitions, 1135 flow [2020-10-11 18:26:44,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:26:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:26:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1191 transitions. [2020-10-11 18:26:44,501 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8562185478073329 [2020-10-11 18:26:44,501 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1191 transitions. [2020-10-11 18:26:44,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1191 transitions. [2020-10-11 18:26:44,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:44,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1191 transitions. [2020-10-11 18:26:44,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:26:44,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:26:44,506 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:26:44,506 INFO L185 Difference]: Start difference. First operand has 148 places, 110 transitions, 545 flow. Second operand 13 states and 1191 transitions. [2020-10-11 18:26:44,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 137 transitions, 1135 flow [2020-10-11 18:26:44,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 137 transitions, 1010 flow, removed 61 selfloop flow, removed 8 redundant places. [2020-10-11 18:26:44,529 INFO L241 Difference]: Finished difference. Result has 153 places, 112 transitions, 589 flow [2020-10-11 18:26:44,530 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=589, PETRI_PLACES=153, PETRI_TRANSITIONS=112} [2020-10-11 18:26:44,530 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 39 predicate places. [2020-10-11 18:26:44,530 INFO L481 AbstractCegarLoop]: Abstraction has has 153 places, 112 transitions, 589 flow [2020-10-11 18:26:44,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:26:44,530 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:44,530 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:44,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:26:44,531 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:44,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:44,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1375857164, now seen corresponding path program 1 times [2020-10-11 18:26:44,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:44,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013458079] [2020-10-11 18:26:44,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:44,873 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-11 18:26:44,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013458079] [2020-10-11 18:26:44,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:44,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:26:44,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867143893] [2020-10-11 18:26:44,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:26:44,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:44,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:26:44,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:26:46,245 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107 [2020-10-11 18:26:46,245 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 112 transitions, 589 flow. Second operand 12 states. [2020-10-11 18:26:46,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:46,246 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107 [2020-10-11 18:26:46,246 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:46,697 INFO L129 PetriNetUnfolder]: 342/895 cut-off events. [2020-10-11 18:26:46,697 INFO L130 PetriNetUnfolder]: For 14945/15178 co-relation queries the response was YES. [2020-10-11 18:26:46,708 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5682 conditions, 895 events. 342/895 cut-off events. For 14945/15178 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5668 event pairs, 124 based on Foata normal form. 30/888 useless extension candidates. Maximal degree in co-relation 5594. Up to 392 conditions per place. [2020-10-11 18:26:46,730 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 26 selfloop transitions, 16 changer transitions 7/124 dead transitions. [2020-10-11 18:26:46,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 124 transitions, 903 flow [2020-10-11 18:26:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:26:46,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:26:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1001 transitions. [2020-10-11 18:26:46,734 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8504672897196262 [2020-10-11 18:26:46,734 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1001 transitions. [2020-10-11 18:26:46,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1001 transitions. [2020-10-11 18:26:46,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:46,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1001 transitions. [2020-10-11 18:26:46,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:26:46,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:26:46,742 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:26:46,743 INFO L185 Difference]: Start difference. First operand has 153 places, 112 transitions, 589 flow. Second operand 11 states and 1001 transitions. [2020-10-11 18:26:46,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 124 transitions, 903 flow [2020-10-11 18:26:46,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 124 transitions, 826 flow, removed 33 selfloop flow, removed 10 redundant places. [2020-10-11 18:26:46,766 INFO L241 Difference]: Finished difference. Result has 152 places, 116 transitions, 651 flow [2020-10-11 18:26:46,767 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=651, PETRI_PLACES=152, PETRI_TRANSITIONS=116} [2020-10-11 18:26:46,767 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 38 predicate places. [2020-10-11 18:26:46,767 INFO L481 AbstractCegarLoop]: Abstraction has has 152 places, 116 transitions, 651 flow [2020-10-11 18:26:46,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:26:46,767 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:46,768 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:46,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:26:46,768 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:46,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:46,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1782769614, now seen corresponding path program 2 times [2020-10-11 18:26:46,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:46,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100654967] [2020-10-11 18:26:46,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:47,039 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-11 18:26:47,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100654967] [2020-10-11 18:26:47,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:47,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:26:47,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450598586] [2020-10-11 18:26:47,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:26:47,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:47,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:26:47,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:26:47,994 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 107 [2020-10-11 18:26:47,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 116 transitions, 651 flow. Second operand 13 states. [2020-10-11 18:26:47,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:47,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 107 [2020-10-11 18:26:47,995 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:48,560 INFO L129 PetriNetUnfolder]: 338/909 cut-off events. [2020-10-11 18:26:48,560 INFO L130 PetriNetUnfolder]: For 12046/12446 co-relation queries the response was YES. [2020-10-11 18:26:48,567 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5352 conditions, 909 events. 338/909 cut-off events. For 12046/12446 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5876 event pairs, 89 based on Foata normal form. 40/914 useless extension candidates. Maximal degree in co-relation 5262. Up to 386 conditions per place. [2020-10-11 18:26:48,574 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 29 selfloop transitions, 16 changer transitions 10/128 dead transitions. [2020-10-11 18:26:48,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 128 transitions, 965 flow [2020-10-11 18:26:48,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:26:48,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:26:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1243 transitions. [2020-10-11 18:26:48,577 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8297730307076101 [2020-10-11 18:26:48,577 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1243 transitions. [2020-10-11 18:26:48,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1243 transitions. [2020-10-11 18:26:48,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:48,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1243 transitions. [2020-10-11 18:26:48,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:26:48,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:26:48,582 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:26:48,582 INFO L185 Difference]: Start difference. First operand has 152 places, 116 transitions, 651 flow. Second operand 14 states and 1243 transitions. [2020-10-11 18:26:48,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 128 transitions, 965 flow [2020-10-11 18:26:48,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 128 transitions, 911 flow, removed 20 selfloop flow, removed 7 redundant places. [2020-10-11 18:26:48,602 INFO L241 Difference]: Finished difference. Result has 162 places, 117 transitions, 693 flow [2020-10-11 18:26:48,602 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=693, PETRI_PLACES=162, PETRI_TRANSITIONS=117} [2020-10-11 18:26:48,602 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 48 predicate places. [2020-10-11 18:26:48,602 INFO L481 AbstractCegarLoop]: Abstraction has has 162 places, 117 transitions, 693 flow [2020-10-11 18:26:48,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:26:48,603 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:48,603 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:48,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:26:48,603 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:48,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:48,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1952097740, now seen corresponding path program 3 times [2020-10-11 18:26:48,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:48,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57200338] [2020-10-11 18:26:48,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:49,004 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-11 18:26:49,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57200338] [2020-10-11 18:26:49,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:49,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-11 18:26:49,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160374424] [2020-10-11 18:26:49,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-11 18:26:49,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:49,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-11 18:26:49,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2020-10-11 18:26:50,907 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2020-10-11 18:26:50,908 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 117 transitions, 693 flow. Second operand 15 states. [2020-10-11 18:26:50,908 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:50,908 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2020-10-11 18:26:50,909 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:51,600 INFO L129 PetriNetUnfolder]: 342/913 cut-off events. [2020-10-11 18:26:51,600 INFO L130 PetriNetUnfolder]: For 15872/16229 co-relation queries the response was YES. [2020-10-11 18:26:51,607 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5838 conditions, 913 events. 342/913 cut-off events. For 15872/16229 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5869 event pairs, 95 based on Foata normal form. 40/917 useless extension candidates. Maximal degree in co-relation 5742. Up to 380 conditions per place. [2020-10-11 18:26:51,613 INFO L132 encePairwiseOnDemand]: 94/107 looper letters, 29 selfloop transitions, 18 changer transitions 10/129 dead transitions. [2020-10-11 18:26:51,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 129 transitions, 1053 flow [2020-10-11 18:26:51,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 18:26:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 18:26:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1399 transitions. [2020-10-11 18:26:51,616 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8171728971962616 [2020-10-11 18:26:51,616 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1399 transitions. [2020-10-11 18:26:51,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1399 transitions. [2020-10-11 18:26:51,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:51,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1399 transitions. [2020-10-11 18:26:51,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 18:26:51,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 18:26:51,621 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 18:26:51,621 INFO L185 Difference]: Start difference. First operand has 162 places, 117 transitions, 693 flow. Second operand 16 states and 1399 transitions. [2020-10-11 18:26:51,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 129 transitions, 1053 flow [2020-10-11 18:26:51,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 129 transitions, 951 flow, removed 38 selfloop flow, removed 12 redundant places. [2020-10-11 18:26:51,644 INFO L241 Difference]: Finished difference. Result has 166 places, 118 transitions, 729 flow [2020-10-11 18:26:51,645 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=729, PETRI_PLACES=166, PETRI_TRANSITIONS=118} [2020-10-11 18:26:51,645 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 52 predicate places. [2020-10-11 18:26:51,645 INFO L481 AbstractCegarLoop]: Abstraction has has 166 places, 118 transitions, 729 flow [2020-10-11 18:26:51,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-11 18:26:51,645 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:51,646 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:51,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:26:51,646 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:51,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:51,646 INFO L82 PathProgramCache]: Analyzing trace with hash 789251318, now seen corresponding path program 4 times [2020-10-11 18:26:51,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:51,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988950938] [2020-10-11 18:26:51,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:52,034 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-11 18:26:52,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988950938] [2020-10-11 18:26:52,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:52,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:26:52,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328240238] [2020-10-11 18:26:52,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:26:52,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:52,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:26:52,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:26:54,519 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107 [2020-10-11 18:26:54,519 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 118 transitions, 729 flow. Second operand 13 states. [2020-10-11 18:26:54,520 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:54,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107 [2020-10-11 18:26:54,520 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:54,930 INFO L129 PetriNetUnfolder]: 274/1009 cut-off events. [2020-10-11 18:26:54,931 INFO L130 PetriNetUnfolder]: For 12937/13073 co-relation queries the response was YES. [2020-10-11 18:26:54,939 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5358 conditions, 1009 events. 274/1009 cut-off events. For 12937/13073 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7732 event pairs, 60 based on Foata normal form. 25/997 useless extension candidates. Maximal degree in co-relation 5262. Up to 208 conditions per place. [2020-10-11 18:26:54,944 INFO L132 encePairwiseOnDemand]: 96/107 looper letters, 27 selfloop transitions, 14 changer transitions 10/132 dead transitions. [2020-10-11 18:26:54,944 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 132 transitions, 1081 flow [2020-10-11 18:26:54,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:26:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:26:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1281 transitions. [2020-10-11 18:26:54,952 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8551401869158879 [2020-10-11 18:26:54,953 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1281 transitions. [2020-10-11 18:26:54,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1281 transitions. [2020-10-11 18:26:54,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:54,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1281 transitions. [2020-10-11 18:26:54,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:26:54,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:26:54,957 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:26:54,958 INFO L185 Difference]: Start difference. First operand has 166 places, 118 transitions, 729 flow. Second operand 14 states and 1281 transitions. [2020-10-11 18:26:54,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 132 transitions, 1081 flow [2020-10-11 18:26:54,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 132 transitions, 939 flow, removed 58 selfloop flow, removed 14 redundant places. [2020-10-11 18:26:54,991 INFO L241 Difference]: Finished difference. Result has 166 places, 118 transitions, 702 flow [2020-10-11 18:26:54,991 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=702, PETRI_PLACES=166, PETRI_TRANSITIONS=118} [2020-10-11 18:26:54,991 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 52 predicate places. [2020-10-11 18:26:54,991 INFO L481 AbstractCegarLoop]: Abstraction has has 166 places, 118 transitions, 702 flow [2020-10-11 18:26:54,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:26:54,992 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:54,992 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:54,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 18:26:54,992 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:54,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:54,993 INFO L82 PathProgramCache]: Analyzing trace with hash 975509968, now seen corresponding path program 1 times [2020-10-11 18:26:54,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:54,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560749976] [2020-10-11 18:26:54,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:55,161 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-11 18:26:55,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560749976] [2020-10-11 18:26:55,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:55,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:26:55,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799954038] [2020-10-11 18:26:55,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:26:55,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:55,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:26:55,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:26:55,315 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2020-10-11 18:26:55,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 118 transitions, 702 flow. Second operand 6 states. [2020-10-11 18:26:55,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:55,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2020-10-11 18:26:55,316 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:56,066 INFO L129 PetriNetUnfolder]: 2448/5174 cut-off events. [2020-10-11 18:26:56,067 INFO L130 PetriNetUnfolder]: For 23866/24480 co-relation queries the response was YES. [2020-10-11 18:26:56,122 INFO L80 FinitePrefix]: Finished finitePrefix Result has 17289 conditions, 5174 events. 2448/5174 cut-off events. For 23866/24480 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 46955 event pairs, 396 based on Foata normal form. 109/4642 useless extension candidates. Maximal degree in co-relation 17198. Up to 1514 conditions per place. [2020-10-11 18:26:56,153 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 23 selfloop transitions, 19 changer transitions 0/149 dead transitions. [2020-10-11 18:26:56,153 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 149 transitions, 848 flow [2020-10-11 18:26:56,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:26:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:26:56,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2020-10-11 18:26:56,155 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9148494288681205 [2020-10-11 18:26:56,155 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 881 transitions. [2020-10-11 18:26:56,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions. [2020-10-11 18:26:56,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:56,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions. [2020-10-11 18:26:56,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:26:56,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:26:56,158 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:26:56,159 INFO L185 Difference]: Start difference. First operand has 166 places, 118 transitions, 702 flow. Second operand 9 states and 881 transitions. [2020-10-11 18:26:56,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 149 transitions, 848 flow [2020-10-11 18:26:56,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 149 transitions, 799 flow, removed 13 selfloop flow, removed 12 redundant places. [2020-10-11 18:26:56,212 INFO L241 Difference]: Finished difference. Result has 161 places, 135 transitions, 787 flow [2020-10-11 18:26:56,213 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=787, PETRI_PLACES=161, PETRI_TRANSITIONS=135} [2020-10-11 18:26:56,214 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 47 predicate places. [2020-10-11 18:26:56,214 INFO L481 AbstractCegarLoop]: Abstraction has has 161 places, 135 transitions, 787 flow [2020-10-11 18:26:56,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:26:56,214 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:56,214 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:56,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 18:26:56,214 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:56,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:56,215 INFO L82 PathProgramCache]: Analyzing trace with hash 253850306, now seen corresponding path program 1 times [2020-10-11 18:26:56,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:56,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610299332] [2020-10-11 18:26:56,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:56,330 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-11 18:26:56,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610299332] [2020-10-11 18:26:56,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:56,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:26:56,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523254949] [2020-10-11 18:26:56,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:26:56,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:56,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:26:56,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:26:56,512 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2020-10-11 18:26:56,512 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 135 transitions, 787 flow. Second operand 7 states. [2020-10-11 18:26:56,512 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:56,512 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2020-10-11 18:26:56,513 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:57,300 INFO L129 PetriNetUnfolder]: 2144/4555 cut-off events. [2020-10-11 18:26:57,301 INFO L130 PetriNetUnfolder]: For 19021/27309 co-relation queries the response was YES. [2020-10-11 18:26:57,333 INFO L80 FinitePrefix]: Finished finitePrefix Result has 18761 conditions, 4555 events. 2144/4555 cut-off events. For 19021/27309 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 41058 event pairs, 136 based on Foata normal form. 411/4404 useless extension candidates. Maximal degree in co-relation 18673. Up to 2150 conditions per place. [2020-10-11 18:26:57,357 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 25 selfloop transitions, 37 changer transitions 0/169 dead transitions. [2020-10-11 18:26:57,357 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 169 transitions, 1140 flow [2020-10-11 18:26:57,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:26:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:26:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1176 transitions. [2020-10-11 18:26:57,360 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9158878504672897 [2020-10-11 18:26:57,360 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1176 transitions. [2020-10-11 18:26:57,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1176 transitions. [2020-10-11 18:26:57,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:57,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1176 transitions. [2020-10-11 18:26:57,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:26:57,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:26:57,363 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:26:57,364 INFO L185 Difference]: Start difference. First operand has 161 places, 135 transitions, 787 flow. Second operand 12 states and 1176 transitions. [2020-10-11 18:26:57,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 169 transitions, 1140 flow [2020-10-11 18:26:57,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 169 transitions, 1138 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-11 18:26:57,393 INFO L241 Difference]: Finished difference. Result has 176 places, 154 transitions, 1065 flow [2020-10-11 18:26:57,394 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1065, PETRI_PLACES=176, PETRI_TRANSITIONS=154} [2020-10-11 18:26:57,394 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 62 predicate places. [2020-10-11 18:26:57,394 INFO L481 AbstractCegarLoop]: Abstraction has has 176 places, 154 transitions, 1065 flow [2020-10-11 18:26:57,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:26:57,394 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:57,394 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:57,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 18:26:57,395 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:57,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:57,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1892891163, now seen corresponding path program 1 times [2020-10-11 18:26:57,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:57,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518128432] [2020-10-11 18:26:57,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:57,491 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-11 18:26:57,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518128432] [2020-10-11 18:26:57,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:57,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:26:57,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559334406] [2020-10-11 18:26:57,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:26:57,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:57,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:26:57,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:26:57,667 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107 [2020-10-11 18:26:57,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 154 transitions, 1065 flow. Second operand 6 states. [2020-10-11 18:26:57,668 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:57,668 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107 [2020-10-11 18:26:57,668 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:58,368 INFO L129 PetriNetUnfolder]: 1545/4750 cut-off events. [2020-10-11 18:26:58,368 INFO L130 PetriNetUnfolder]: For 28066/37729 co-relation queries the response was YES. [2020-10-11 18:26:58,411 INFO L80 FinitePrefix]: Finished finitePrefix Result has 21207 conditions, 4750 events. 1545/4750 cut-off events. For 28066/37729 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 50741 event pairs, 274 based on Foata normal form. 148/4294 useless extension candidates. Maximal degree in co-relation 21112. Up to 1733 conditions per place. [2020-10-11 18:26:58,430 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 14 selfloop transitions, 11 changer transitions 0/168 dead transitions. [2020-10-11 18:26:58,430 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 168 transitions, 1251 flow [2020-10-11 18:26:58,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:26:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:26:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2020-10-11 18:26:58,432 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9241952232606438 [2020-10-11 18:26:58,433 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2020-10-11 18:26:58,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2020-10-11 18:26:58,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:58,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2020-10-11 18:26:58,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:26:58,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:26:58,435 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:26:58,436 INFO L185 Difference]: Start difference. First operand has 176 places, 154 transitions, 1065 flow. Second operand 9 states and 890 transitions. [2020-10-11 18:26:58,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 168 transitions, 1251 flow [2020-10-11 18:26:58,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 168 transitions, 1148 flow, removed 42 selfloop flow, removed 4 redundant places. [2020-10-11 18:26:58,716 INFO L241 Difference]: Finished difference. Result has 187 places, 162 transitions, 1117 flow [2020-10-11 18:26:58,716 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=968, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1117, PETRI_PLACES=187, PETRI_TRANSITIONS=162} [2020-10-11 18:26:58,717 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 73 predicate places. [2020-10-11 18:26:58,717 INFO L481 AbstractCegarLoop]: Abstraction has has 187 places, 162 transitions, 1117 flow [2020-10-11 18:26:58,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:26:58,717 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:58,717 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:58,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-11 18:26:58,717 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:58,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:58,718 INFO L82 PathProgramCache]: Analyzing trace with hash 953343011, now seen corresponding path program 1 times [2020-10-11 18:26:58,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:58,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050822090] [2020-10-11 18:26:58,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:58,839 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-11 18:26:58,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050822090] [2020-10-11 18:26:58,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:58,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:26:58,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781154101] [2020-10-11 18:26:58,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:26:58,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:58,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:26:58,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:26:58,934 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2020-10-11 18:26:58,935 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 162 transitions, 1117 flow. Second operand 8 states. [2020-10-11 18:26:58,935 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:58,935 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2020-10-11 18:26:58,935 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:59,992 INFO L129 PetriNetUnfolder]: 2915/5869 cut-off events. [2020-10-11 18:26:59,993 INFO L130 PetriNetUnfolder]: For 50675/70531 co-relation queries the response was YES. [2020-10-11 18:27:00,044 INFO L80 FinitePrefix]: Finished finitePrefix Result has 29886 conditions, 5869 events. 2915/5869 cut-off events. For 50675/70531 co-relation queries the response was YES. Maximal size of possible extension queue 961. Compared 54825 event pairs, 24 based on Foata normal form. 697/5739 useless extension candidates. Maximal degree in co-relation 29785. Up to 2639 conditions per place. [2020-10-11 18:27:00,058 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 19 selfloop transitions, 57 changer transitions 16/188 dead transitions. [2020-10-11 18:27:00,058 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 188 transitions, 1587 flow [2020-10-11 18:27:00,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:27:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:27:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1471 transitions. [2020-10-11 18:27:00,061 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9165109034267913 [2020-10-11 18:27:00,061 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1471 transitions. [2020-10-11 18:27:00,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1471 transitions. [2020-10-11 18:27:00,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:27:00,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1471 transitions. [2020-10-11 18:27:00,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:27:00,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:27:00,067 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:27:00,067 INFO L185 Difference]: Start difference. First operand has 187 places, 162 transitions, 1117 flow. Second operand 15 states and 1471 transitions. [2020-10-11 18:27:00,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 188 transitions, 1587 flow [2020-10-11 18:27:00,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 188 transitions, 1495 flow, removed 30 selfloop flow, removed 9 redundant places. [2020-10-11 18:27:00,183 INFO L241 Difference]: Finished difference. Result has 195 places, 168 transitions, 1287 flow [2020-10-11 18:27:00,183 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1287, PETRI_PLACES=195, PETRI_TRANSITIONS=168} [2020-10-11 18:27:00,184 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 81 predicate places. [2020-10-11 18:27:00,184 INFO L481 AbstractCegarLoop]: Abstraction has has 195 places, 168 transitions, 1287 flow [2020-10-11 18:27:00,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:27:00,184 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:27:00,184 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:27:00,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-11 18:27:00,185 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:27:00,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:27:00,185 INFO L82 PathProgramCache]: Analyzing trace with hash -600185698, now seen corresponding path program 1 times [2020-10-11 18:27:00,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:27:00,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260785842] [2020-10-11 18:27:00,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:27:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:27:00,325 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-11 18:27:00,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260785842] [2020-10-11 18:27:00,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:27:00,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:27:00,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984489845] [2020-10-11 18:27:00,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:27:00,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:27:00,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:27:00,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:27:00,538 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2020-10-11 18:27:00,540 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 168 transitions, 1287 flow. Second operand 9 states. [2020-10-11 18:27:00,540 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:27:00,540 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2020-10-11 18:27:00,540 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:27:01,875 INFO L129 PetriNetUnfolder]: 2534/5290 cut-off events. [2020-10-11 18:27:01,875 INFO L130 PetriNetUnfolder]: For 56607/87820 co-relation queries the response was YES. [2020-10-11 18:27:01,920 INFO L80 FinitePrefix]: Finished finitePrefix Result has 29951 conditions, 5290 events. 2534/5290 cut-off events. For 56607/87820 co-relation queries the response was YES. Maximal size of possible extension queue 961. Compared 51257 event pairs, 0 based on Foata normal form. 737/5204 useless extension candidates. Maximal degree in co-relation 29891. Up to 2309 conditions per place. [2020-10-11 18:27:01,932 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 12 selfloop transitions, 63 changer transitions 21/187 dead transitions. [2020-10-11 18:27:01,932 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 187 transitions, 1666 flow [2020-10-11 18:27:01,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 18:27:01,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 18:27:01,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1750 transitions. [2020-10-11 18:27:01,935 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9086188992731049 [2020-10-11 18:27:01,935 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1750 transitions. [2020-10-11 18:27:01,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1750 transitions. [2020-10-11 18:27:01,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:27:01,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1750 transitions. [2020-10-11 18:27:01,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 18:27:01,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 18:27:01,940 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 18:27:01,940 INFO L185 Difference]: Start difference. First operand has 195 places, 168 transitions, 1287 flow. Second operand 18 states and 1750 transitions. [2020-10-11 18:27:01,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 187 transitions, 1666 flow [2020-10-11 18:27:02,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 187 transitions, 1146 flow, removed 204 selfloop flow, removed 34 redundant places. [2020-10-11 18:27:02,884 INFO L241 Difference]: Finished difference. Result has 178 places, 162 transitions, 961 flow [2020-10-11 18:27:02,884 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=961, PETRI_PLACES=178, PETRI_TRANSITIONS=162} [2020-10-11 18:27:02,885 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 64 predicate places. [2020-10-11 18:27:02,885 INFO L481 AbstractCegarLoop]: Abstraction has has 178 places, 162 transitions, 961 flow [2020-10-11 18:27:02,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:27:02,885 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:27:02,885 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:27:02,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-11 18:27:02,885 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:27:02,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:27:02,885 INFO L82 PathProgramCache]: Analyzing trace with hash -151808410, now seen corresponding path program 1 times [2020-10-11 18:27:02,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:27:02,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096149678] [2020-10-11 18:27:02,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:27:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:27:03,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:27:03,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096149678] [2020-10-11 18:27:03,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:27:03,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:27:03,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573407600] [2020-10-11 18:27:03,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:27:03,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:27:03,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:27:03,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:27:03,269 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 107 [2020-10-11 18:27:03,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 162 transitions, 961 flow. Second operand 7 states. [2020-10-11 18:27:03,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:27:03,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 107 [2020-10-11 18:27:03,271 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:27:04,392 INFO L129 PetriNetUnfolder]: 3587/8735 cut-off events. [2020-10-11 18:27:04,392 INFO L130 PetriNetUnfolder]: For 24611/27742 co-relation queries the response was YES. [2020-10-11 18:27:04,461 INFO L80 FinitePrefix]: Finished finitePrefix Result has 29215 conditions, 8735 events. 3587/8735 cut-off events. For 24611/27742 co-relation queries the response was YES. Maximal size of possible extension queue 1524. Compared 102485 event pairs, 0 based on Foata normal form. 1/7558 useless extension candidates. Maximal degree in co-relation 29130. Up to 1204 conditions per place. [2020-10-11 18:27:04,468 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 9 selfloop transitions, 1 changer transitions 20/167 dead transitions. [2020-10-11 18:27:04,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 167 transitions, 1007 flow [2020-10-11 18:27:04,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:27:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:27:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 681 transitions. [2020-10-11 18:27:04,469 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9092122830440588 [2020-10-11 18:27:04,470 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 681 transitions. [2020-10-11 18:27:04,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 681 transitions. [2020-10-11 18:27:04,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:27:04,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 681 transitions. [2020-10-11 18:27:04,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:27:04,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:27:04,471 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:27:04,472 INFO L185 Difference]: Start difference. First operand has 178 places, 162 transitions, 961 flow. Second operand 7 states and 681 transitions. [2020-10-11 18:27:04,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 167 transitions, 1007 flow [2020-10-11 18:27:05,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 167 transitions, 866 flow, removed 15 selfloop flow, removed 21 redundant places. [2020-10-11 18:27:05,225 INFO L241 Difference]: Finished difference. Result has 166 places, 147 transitions, 746 flow [2020-10-11 18:27:05,225 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=746, PETRI_PLACES=166, PETRI_TRANSITIONS=147} [2020-10-11 18:27:05,226 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 52 predicate places. [2020-10-11 18:27:05,226 INFO L481 AbstractCegarLoop]: Abstraction has has 166 places, 147 transitions, 746 flow [2020-10-11 18:27:05,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:27:05,226 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:27:05,226 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:27:05,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-11 18:27:05,226 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:27:05,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:27:05,227 INFO L82 PathProgramCache]: Analyzing trace with hash -436699600, now seen corresponding path program 2 times [2020-10-11 18:27:05,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:27:05,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884999705] [2020-10-11 18:27:05,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:27:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:27:05,265 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:27:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:27:05,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:27:05,348 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:27:05,348 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:27:05,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-11 18:27:05,382 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-11 18:27:05,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,384 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-11 18:27:05,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,384 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-11 18:27:05,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,385 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-11 18:27:05,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,385 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-11 18:27:05,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,385 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-11 18:27:05,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,386 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-11 18:27:05,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,386 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-11 18:27:05,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,387 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-11 18:27:05,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,387 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-11 18:27:05,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,388 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-11 18:27:05,388 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,388 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-11 18:27:05,388 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,389 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-11 18:27:05,389 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,389 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-11 18:27:05,389 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,390 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-11 18:27:05,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,390 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-11 18:27:05,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,390 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-11 18:27:05,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,391 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-11 18:27:05,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,391 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-11 18:27:05,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,391 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-11 18:27:05,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,392 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-11 18:27:05,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,392 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-11 18:27:05,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,392 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-11 18:27:05,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,393 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-11 18:27:05,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,393 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-11 18:27:05,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,393 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-11 18:27:05,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,394 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-11 18:27:05,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,394 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-11 18:27:05,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,394 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-11 18:27:05,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,395 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-11 18:27:05,395 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:05,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:27:05 BasicIcfg [2020-10-11 18:27:05,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:27:05,540 INFO L168 Benchmark]: Toolchain (without parser) took 38997.18 ms. Allocated memory was 253.8 MB in the beginning and 1.1 GB in the end (delta: 857.2 MB). Free memory was 207.2 MB in the beginning and 487.9 MB in the end (delta: -280.7 MB). Peak memory consumption was 576.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:27:05,541 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 253.8 MB. Free memory is still 227.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:27:05,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.84 ms. Allocated memory was 253.8 MB in the beginning and 319.3 MB in the end (delta: 65.5 MB). Free memory was 207.2 MB in the beginning and 269.7 MB in the end (delta: -62.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 14.2 GB. [2020-10-11 18:27:05,543 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.54 ms. Allocated memory is still 319.3 MB. Free memory was 269.7 MB in the beginning and 267.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:27:05,543 INFO L168 Benchmark]: Boogie Preprocessor took 57.60 ms. Allocated memory is still 319.3 MB. Free memory was 267.1 MB in the beginning and 264.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:27:05,544 INFO L168 Benchmark]: RCFGBuilder took 1964.52 ms. Allocated memory was 319.3 MB in the beginning and 362.3 MB in the end (delta: 43.0 MB). Free memory was 264.6 MB in the beginning and 208.4 MB in the end (delta: 56.3 MB). Peak memory consumption was 99.7 MB. Max. memory is 14.2 GB. [2020-10-11 18:27:05,545 INFO L168 Benchmark]: TraceAbstraction took 36181.81 ms. Allocated memory was 362.3 MB in the beginning and 1.1 GB in the end (delta: 748.7 MB). Free memory was 208.4 MB in the beginning and 487.9 MB in the end (delta: -279.6 MB). Peak memory consumption was 469.1 MB. Max. memory is 14.2 GB. [2020-10-11 18:27:05,553 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.49 ms. Allocated memory is still 253.8 MB. Free memory is still 227.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 718.84 ms. Allocated memory was 253.8 MB in the beginning and 319.3 MB in the end (delta: 65.5 MB). Free memory was 207.2 MB in the beginning and 269.7 MB in the end (delta: -62.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 68.54 ms. Allocated memory is still 319.3 MB. Free memory was 269.7 MB in the beginning and 267.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 57.60 ms. Allocated memory is still 319.3 MB. Free memory was 267.1 MB in the beginning and 264.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1964.52 ms. Allocated memory was 319.3 MB in the beginning and 362.3 MB in the end (delta: 43.0 MB). Free memory was 264.6 MB in the beginning and 208.4 MB in the end (delta: 56.3 MB). Peak memory consumption was 99.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 36181.81 ms. Allocated memory was 362.3 MB in the beginning and 1.1 GB in the end (delta: 748.7 MB). Free memory was 208.4 MB in the beginning and 487.9 MB in the end (delta: -279.6 MB). Peak memory consumption was 469.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L701] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L703] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L709] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L711] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L712] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L713] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L714] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L715] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L716] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L717] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L718] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L719] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L720] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L721] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L722] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L723] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L724] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L725] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L726] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L727] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L728] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L729] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 0 pthread_t t1541; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1541, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 pthread_t t1542; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] FCALL, FORK 0 pthread_create(&t1542, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 pthread_t t1543; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] FCALL, FORK 0 pthread_create(&t1543, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 pthread_t t1544; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] FCALL, FORK 0 pthread_create(&t1544, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 4 z$w_buff1 = z$w_buff0 [L786] 4 z$w_buff0 = 2 [L787] 4 z$w_buff1_used = z$w_buff0_used [L788] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L790] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L791] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L792] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L793] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L794] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L795] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L738] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0: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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0: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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 z = 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L801] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L801] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L801] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L802] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L803] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L803] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L804] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L804] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L805] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L805] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L771] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L771] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L772] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L774] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L775] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L778] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L836] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L837] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L838] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L839] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L839] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L840] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 z$flush_delayed = weak$$choice2 [L846] 0 z$mem_tmp = z [L847] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L847] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L848] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L848] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L849] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L849] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L850] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L850] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L852] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L852] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L852] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L853] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L855] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L855] 0 z = z$flush_delayed ? z$mem_tmp : z [L856] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 106 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: 35.8s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 513 SDtfs, 1129 SDslu, 3529 SDs, 0 SdLazy, 3292 SolverSat, 607 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1287occurred in iteration=19, 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.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1500 NumberOfCodeBlocks, 1500 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1400 ConstructedInterpolants, 0 QuantifiedInterpolants, 562201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...