/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 05:07:30,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 05:07:30,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 05:07:30,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 05:07:30,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 05:07:30,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 05:07:30,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 05:07:30,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 05:07:30,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 05:07:30,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 05:07:30,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 05:07:30,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 05:07:30,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 05:07:30,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 05:07:30,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 05:07:30,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 05:07:30,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 05:07:30,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 05:07:30,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 05:07:30,333 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 05:07:30,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 05:07:30,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 05:07:30,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 05:07:30,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 05:07:30,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 05:07:30,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 05:07:30,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 05:07:30,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 05:07:30,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 05:07:30,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 05:07:30,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 05:07:30,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 05:07:30,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 05:07:30,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 05:07:30,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 05:07:30,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 05:07:30,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 05:07:30,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 05:07:30,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 05:07:30,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 05:07:30,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 05:07:30,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 05:07:30,416 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 05:07:30,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 05:07:30,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 05:07:30,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 05:07:30,418 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 05:07:30,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 05:07:30,418 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 05:07:30,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 05:07:30,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 05:07:30,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 05:07:30,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 05:07:30,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 05:07:30,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 05:07:30,421 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 05:07:30,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 05:07:30,421 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 05:07:30,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 05:07:30,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 05:07:30,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 05:07:30,422 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 05:07:30,422 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 05:07:30,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:07:30,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 05:07:30,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 05:07:30,423 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 05:07:30,423 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 05:07:30,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 05:07:30,424 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 05:07:30,424 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 05:07:30,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 05:07:30,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 05:07:30,775 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 05:07:30,776 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 05:07:30,777 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 05:07:30,777 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i [2020-10-16 05:07:30,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcc3ecde5/a5d4edb4042544d9bebcd3d77ca7aa6b/FLAG78102386b [2020-10-16 05:07:31,459 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 05:07:31,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i [2020-10-16 05:07:31,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcc3ecde5/a5d4edb4042544d9bebcd3d77ca7aa6b/FLAG78102386b [2020-10-16 05:07:31,751 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcc3ecde5/a5d4edb4042544d9bebcd3d77ca7aa6b [2020-10-16 05:07:31,762 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 05:07:31,764 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 05:07:31,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 05:07:31,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 05:07:31,769 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 05:07:31,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:07:31" (1/1) ... [2020-10-16 05:07:31,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b04d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:31, skipping insertion in model container [2020-10-16 05:07:31,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:07:31" (1/1) ... [2020-10-16 05:07:31,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 05:07:31,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 05:07:32,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:07:32,463 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 05:07:32,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:07:32,629 INFO L208 MainTranslator]: Completed translation [2020-10-16 05:07:32,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:32 WrapperNode [2020-10-16 05:07:32,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 05:07:32,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 05:07:32,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 05:07:32,631 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 05:07:32,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:32" (1/1) ... [2020-10-16 05:07:32,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:32" (1/1) ... [2020-10-16 05:07:32,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 05:07:32,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 05:07:32,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 05:07:32,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 05:07:32,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:32" (1/1) ... [2020-10-16 05:07:32,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:32" (1/1) ... [2020-10-16 05:07:32,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:32" (1/1) ... [2020-10-16 05:07:32,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:32" (1/1) ... [2020-10-16 05:07:32,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:32" (1/1) ... [2020-10-16 05:07:32,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:32" (1/1) ... [2020-10-16 05:07:32,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:32" (1/1) ... [2020-10-16 05:07:32,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 05:07:32,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 05:07:32,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 05:07:32,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 05:07:32,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:07:32,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 05:07:32,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 05:07:32,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 05:07:32,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 05:07:32,841 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 05:07:32,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 05:07:32,843 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 05:07:32,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 05:07:32,844 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 05:07:32,844 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 05:07:32,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 05:07:32,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 05:07:32,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 05:07:32,852 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 05:07:36,746 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 05:07:36,746 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 05:07:36,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:07:36 BoogieIcfgContainer [2020-10-16 05:07:36,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 05:07:36,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 05:07:36,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 05:07:36,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 05:07:36,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:07:31" (1/3) ... [2020-10-16 05:07:36,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5366ebfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:07:36, skipping insertion in model container [2020-10-16 05:07:36,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:32" (2/3) ... [2020-10-16 05:07:36,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5366ebfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:07:36, skipping insertion in model container [2020-10-16 05:07:36,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:07:36" (3/3) ... [2020-10-16 05:07:36,759 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_rmo.oepc.i [2020-10-16 05:07:36,771 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 05:07:36,780 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 05:07:36,782 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 05:07:36,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,837 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,837 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,851 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,851 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,852 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,852 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,855 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,855 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,876 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,876 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,876 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,876 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,876 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,876 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,884 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,884 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,885 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,885 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,885 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,885 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,885 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,891 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,892 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,898 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,899 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:36,925 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 05:07:36,949 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 05:07:36,949 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 05:07:36,950 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 05:07:36,950 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 05:07:36,950 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 05:07:36,950 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 05:07:36,950 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 05:07:36,950 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 05:07:36,970 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 203 flow [2020-10-16 05:07:37,031 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-16 05:07:37,032 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:07:37,040 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 05:07:37,040 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 94 transitions, 203 flow [2020-10-16 05:07:37,050 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 91 transitions, 191 flow [2020-10-16 05:07:37,053 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 05:07:37,056 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 191 flow [2020-10-16 05:07:37,059 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 91 transitions, 191 flow [2020-10-16 05:07:37,059 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 191 flow [2020-10-16 05:07:37,104 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-16 05:07:37,105 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:07:37,111 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 05:07:37,116 INFO L117 LiptonReduction]: Number of co-enabled transitions 1740 [2020-10-16 05:07:37,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:07:37,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:37,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:07:37,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:37,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:37,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:37,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:37,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:37,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:07:37,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:37,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:37,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:37,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:37,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:37,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:37,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:37,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:37,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:37,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:37,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:37,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:37,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:37,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:37,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:37,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:37,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:37,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:37,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:37,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:37,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:37,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:37,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:37,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:37,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:37,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:07:37,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:37,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:37,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:37,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:37,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:37,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:37,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:07:37,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:07:37,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:37,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:37,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:37,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:37,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:37,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:37,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:37,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:37,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:37,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:37,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:37,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:37,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:37,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:37,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:37,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:37,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:37,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:37,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:37,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:37,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:37,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:37,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:37,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:37,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:37,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:37,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:37,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:37,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:37,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:37,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:37,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:37,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:37,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:07:37,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:38,415 WARN L193 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 05:07:38,549 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 05:07:38,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:07:38,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:38,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:07:38,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:38,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:07:38,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:38,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:38,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:38,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:38,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:39,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:39,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:39,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:39,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:39,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:39,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:39,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:07:39,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:39,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:39,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:39,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:39,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:39,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:39,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:07:39,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:07:39,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:39,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:07:39,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,482 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 05:07:39,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:39,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:07:39,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:07:39,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:39,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:39,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:39,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:39,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:39,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:39,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:39,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:07:39,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:39,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:39,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:39,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:39,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:40,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:07:40,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:07:40,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:40,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:40,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:40,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:40,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:40,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:40,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:07:40,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:40,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:40,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:40,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:40,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:40,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:40,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:40,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:40,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:07:40,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:07:40,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:07:40,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:07:40,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:07:40,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:40,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:40,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:40,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:40,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:07:40,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:07:40,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:07:40,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:40,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:40,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:40,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:40,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:40,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:41,273 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-16 05:07:41,382 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 05:07:41,390 INFO L132 LiptonReduction]: Checked pairs total: 5549 [2020-10-16 05:07:41,390 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 05:07:41,393 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4342 [2020-10-16 05:07:41,401 INFO L129 PetriNetUnfolder]: 0/9 cut-off events. [2020-10-16 05:07:41,401 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:07:41,401 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:41,402 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 05:07:41,402 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:41,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:41,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1712567520, now seen corresponding path program 1 times [2020-10-16 05:07:41,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:41,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85714886] [2020-10-16 05:07:41,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:41,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85714886] [2020-10-16 05:07:41,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:41,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:07:41,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940804965] [2020-10-16 05:07:41,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:07:41,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:41,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:07:41,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:07:41,678 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 05:07:41,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states. [2020-10-16 05:07:41,681 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:41,681 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 05:07:41,683 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:41,910 INFO L129 PetriNetUnfolder]: 190/405 cut-off events. [2020-10-16 05:07:41,910 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:07:41,913 INFO L80 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 405 events. 190/405 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2152 event pairs, 104 based on Foata normal form. 33/403 useless extension candidates. Maximal degree in co-relation 704. Up to 223 conditions per place. [2020-10-16 05:07:41,918 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 15 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2020-10-16 05:07:41,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 105 flow [2020-10-16 05:07:41,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:07:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:07:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2020-10-16 05:07:41,938 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8576998050682261 [2020-10-16 05:07:41,939 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2020-10-16 05:07:41,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2020-10-16 05:07:41,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:41,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2020-10-16 05:07:41,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:07:41,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:07:41,958 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:07:41,961 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 440 transitions. [2020-10-16 05:07:41,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 105 flow [2020-10-16 05:07:41,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 05:07:41,968 INFO L241 Difference]: Finished difference. Result has 33 places, 24 transitions, 58 flow [2020-10-16 05:07:41,971 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2020-10-16 05:07:41,972 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2020-10-16 05:07:41,972 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2020-10-16 05:07:41,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:07:41,972 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:41,972 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:41,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 05:07:41,973 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:41,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:41,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1739866846, now seen corresponding path program 1 times [2020-10-16 05:07:41,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:41,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495433677] [2020-10-16 05:07:41,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:42,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495433677] [2020-10-16 05:07:42,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:42,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:07:42,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442822038] [2020-10-16 05:07:42,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:07:42,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:42,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:07:42,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:07:42,183 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 171 [2020-10-16 05:07:42,184 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand 4 states. [2020-10-16 05:07:42,184 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:42,184 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 171 [2020-10-16 05:07:42,184 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:42,245 INFO L129 PetriNetUnfolder]: 1/35 cut-off events. [2020-10-16 05:07:42,245 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:07:42,246 INFO L80 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 47. Up to 5 conditions per place. [2020-10-16 05:07:42,246 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 2 selfloop transitions, 2 changer transitions 5/28 dead transitions. [2020-10-16 05:07:42,246 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 84 flow [2020-10-16 05:07:42,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:07:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:07:42,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 701 transitions. [2020-10-16 05:07:42,251 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8198830409356725 [2020-10-16 05:07:42,251 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 701 transitions. [2020-10-16 05:07:42,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 701 transitions. [2020-10-16 05:07:42,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:42,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 701 transitions. [2020-10-16 05:07:42,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:07:42,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:07:42,257 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:07:42,257 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 701 transitions. [2020-10-16 05:07:42,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 84 flow [2020-10-16 05:07:42,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:07:42,259 INFO L241 Difference]: Finished difference. Result has 38 places, 23 transitions, 64 flow [2020-10-16 05:07:42,259 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2020-10-16 05:07:42,260 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2020-10-16 05:07:42,260 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 64 flow [2020-10-16 05:07:42,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:07:42,260 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:42,260 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:42,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 05:07:42,261 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:42,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:42,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1859395228, now seen corresponding path program 1 times [2020-10-16 05:07:42,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:42,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402376838] [2020-10-16 05:07:42,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:42,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402376838] [2020-10-16 05:07:42,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:42,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:07:42,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24829797] [2020-10-16 05:07:42,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:07:42,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:42,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:07:42,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:07:42,519 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 171 [2020-10-16 05:07:42,519 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 64 flow. Second operand 5 states. [2020-10-16 05:07:42,520 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:42,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 171 [2020-10-16 05:07:42,520 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:42,718 INFO L129 PetriNetUnfolder]: 65/141 cut-off events. [2020-10-16 05:07:42,718 INFO L130 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2020-10-16 05:07:42,719 INFO L80 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 141 events. 65/141 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 594 event pairs, 42 based on Foata normal form. 12/150 useless extension candidates. Maximal degree in co-relation 289. Up to 81 conditions per place. [2020-10-16 05:07:42,721 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 10 selfloop transitions, 5 changer transitions 11/41 dead transitions. [2020-10-16 05:07:42,721 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 156 flow [2020-10-16 05:07:42,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:07:42,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:07:42,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 918 transitions. [2020-10-16 05:07:42,725 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7669172932330827 [2020-10-16 05:07:42,726 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 918 transitions. [2020-10-16 05:07:42,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 918 transitions. [2020-10-16 05:07:42,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:42,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 918 transitions. [2020-10-16 05:07:42,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:07:42,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:07:42,731 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:07:42,731 INFO L185 Difference]: Start difference. First operand has 38 places, 23 transitions, 64 flow. Second operand 7 states and 918 transitions. [2020-10-16 05:07:42,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 156 flow [2020-10-16 05:07:42,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 148 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 05:07:42,734 INFO L241 Difference]: Finished difference. Result has 42 places, 26 transitions, 97 flow [2020-10-16 05:07:42,734 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=97, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2020-10-16 05:07:42,735 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2020-10-16 05:07:42,735 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 97 flow [2020-10-16 05:07:42,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:07:42,735 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:42,735 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:42,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 05:07:42,736 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:42,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:42,736 INFO L82 PathProgramCache]: Analyzing trace with hash -447025861, now seen corresponding path program 1 times [2020-10-16 05:07:42,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:42,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925647167] [2020-10-16 05:07:42,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:43,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925647167] [2020-10-16 05:07:43,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:43,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:07:43,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641149627] [2020-10-16 05:07:43,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:07:43,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:43,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:07:43,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:07:43,074 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 171 [2020-10-16 05:07:43,075 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 97 flow. Second operand 7 states. [2020-10-16 05:07:43,075 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:43,075 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 171 [2020-10-16 05:07:43,075 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:43,740 INFO L129 PetriNetUnfolder]: 757/1282 cut-off events. [2020-10-16 05:07:43,740 INFO L130 PetriNetUnfolder]: For 1025/1062 co-relation queries the response was YES. [2020-10-16 05:07:43,746 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3326 conditions, 1282 events. 757/1282 cut-off events. For 1025/1062 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6755 event pairs, 193 based on Foata normal form. 59/1304 useless extension candidates. Maximal degree in co-relation 3311. Up to 461 conditions per place. [2020-10-16 05:07:43,752 INFO L132 encePairwiseOnDemand]: 162/171 looper letters, 27 selfloop transitions, 6 changer transitions 22/66 dead transitions. [2020-10-16 05:07:43,752 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 325 flow [2020-10-16 05:07:43,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:07:43,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:07:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 823 transitions. [2020-10-16 05:07:43,756 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6875522138680034 [2020-10-16 05:07:43,756 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 823 transitions. [2020-10-16 05:07:43,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 823 transitions. [2020-10-16 05:07:43,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:43,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 823 transitions. [2020-10-16 05:07:43,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:07:43,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:07:43,762 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:07:43,762 INFO L185 Difference]: Start difference. First operand has 42 places, 26 transitions, 97 flow. Second operand 7 states and 823 transitions. [2020-10-16 05:07:43,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 325 flow [2020-10-16 05:07:43,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 66 transitions, 312 flow, removed 2 selfloop flow, removed 3 redundant places. [2020-10-16 05:07:43,773 INFO L241 Difference]: Finished difference. Result has 47 places, 29 transitions, 136 flow [2020-10-16 05:07:43,773 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2020-10-16 05:07:43,774 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2020-10-16 05:07:43,774 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 29 transitions, 136 flow [2020-10-16 05:07:43,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:07:43,774 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:43,774 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:43,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 05:07:43,775 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:43,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:43,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1010530284, now seen corresponding path program 1 times [2020-10-16 05:07:43,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:43,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855177123] [2020-10-16 05:07:43,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:43,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855177123] [2020-10-16 05:07:43,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:43,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:07:43,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877190059] [2020-10-16 05:07:43,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:07:43,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:43,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:07:43,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:07:43,935 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 171 [2020-10-16 05:07:43,935 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 29 transitions, 136 flow. Second operand 7 states. [2020-10-16 05:07:43,936 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:43,936 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 171 [2020-10-16 05:07:43,936 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:44,409 INFO L129 PetriNetUnfolder]: 525/945 cut-off events. [2020-10-16 05:07:44,409 INFO L130 PetriNetUnfolder]: For 1937/2025 co-relation queries the response was YES. [2020-10-16 05:07:44,413 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3010 conditions, 945 events. 525/945 cut-off events. For 1937/2025 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5128 event pairs, 127 based on Foata normal form. 52/971 useless extension candidates. Maximal degree in co-relation 2991. Up to 344 conditions per place. [2020-10-16 05:07:44,418 INFO L132 encePairwiseOnDemand]: 161/171 looper letters, 26 selfloop transitions, 10 changer transitions 17/66 dead transitions. [2020-10-16 05:07:44,418 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 66 transitions, 396 flow [2020-10-16 05:07:44,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:07:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:07:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 971 transitions. [2020-10-16 05:07:44,422 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7097953216374269 [2020-10-16 05:07:44,423 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 971 transitions. [2020-10-16 05:07:44,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 971 transitions. [2020-10-16 05:07:44,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:44,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 971 transitions. [2020-10-16 05:07:44,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:07:44,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:07:44,429 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:07:44,429 INFO L185 Difference]: Start difference. First operand has 47 places, 29 transitions, 136 flow. Second operand 8 states and 971 transitions. [2020-10-16 05:07:44,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 66 transitions, 396 flow [2020-10-16 05:07:44,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 375 flow, removed 6 selfloop flow, removed 4 redundant places. [2020-10-16 05:07:44,435 INFO L241 Difference]: Finished difference. Result has 54 places, 35 transitions, 207 flow [2020-10-16 05:07:44,436 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=207, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2020-10-16 05:07:44,436 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 19 predicate places. [2020-10-16 05:07:44,436 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 207 flow [2020-10-16 05:07:44,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:07:44,436 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:44,436 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:44,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 05:07:44,437 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:44,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:44,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1175466053, now seen corresponding path program 1 times [2020-10-16 05:07:44,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:44,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49887011] [2020-10-16 05:07:44,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:44,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49887011] [2020-10-16 05:07:44,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:44,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:07:44,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234641870] [2020-10-16 05:07:44,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:07:44,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:44,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:07:44,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:07:44,595 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 171 [2020-10-16 05:07:44,596 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 35 transitions, 207 flow. Second operand 7 states. [2020-10-16 05:07:44,596 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:44,596 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 171 [2020-10-16 05:07:44,597 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:45,714 INFO L129 PetriNetUnfolder]: 1520/2352 cut-off events. [2020-10-16 05:07:45,714 INFO L130 PetriNetUnfolder]: For 4570/4635 co-relation queries the response was YES. [2020-10-16 05:07:45,723 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8161 conditions, 2352 events. 1520/2352 cut-off events. For 4570/4635 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11668 event pairs, 462 based on Foata normal form. 49/2367 useless extension candidates. Maximal degree in co-relation 8138. Up to 1844 conditions per place. [2020-10-16 05:07:45,734 INFO L132 encePairwiseOnDemand]: 158/171 looper letters, 35 selfloop transitions, 30 changer transitions 11/85 dead transitions. [2020-10-16 05:07:45,735 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 85 transitions, 649 flow [2020-10-16 05:07:45,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 05:07:45,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 05:07:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1041 transitions. [2020-10-16 05:07:45,740 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6087719298245614 [2020-10-16 05:07:45,741 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1041 transitions. [2020-10-16 05:07:45,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1041 transitions. [2020-10-16 05:07:45,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:45,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1041 transitions. [2020-10-16 05:07:45,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 05:07:45,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 05:07:45,749 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 05:07:45,749 INFO L185 Difference]: Start difference. First operand has 54 places, 35 transitions, 207 flow. Second operand 10 states and 1041 transitions. [2020-10-16 05:07:45,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 85 transitions, 649 flow [2020-10-16 05:07:45,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 85 transitions, 643 flow, removed 2 selfloop flow, removed 3 redundant places. [2020-10-16 05:07:45,768 INFO L241 Difference]: Finished difference. Result has 64 places, 61 transitions, 520 flow [2020-10-16 05:07:45,769 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=520, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2020-10-16 05:07:45,769 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2020-10-16 05:07:45,769 INFO L481 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 520 flow [2020-10-16 05:07:45,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:07:45,770 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:45,770 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:45,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 05:07:45,770 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:45,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:45,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1963748685, now seen corresponding path program 2 times [2020-10-16 05:07:45,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:45,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271845423] [2020-10-16 05:07:45,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:46,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271845423] [2020-10-16 05:07:46,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:46,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:07:46,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966207450] [2020-10-16 05:07:46,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:07:46,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:46,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:07:46,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:07:46,036 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 171 [2020-10-16 05:07:46,037 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 520 flow. Second operand 7 states. [2020-10-16 05:07:46,037 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:46,037 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 171 [2020-10-16 05:07:46,037 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:47,089 INFO L129 PetriNetUnfolder]: 1614/2510 cut-off events. [2020-10-16 05:07:47,089 INFO L130 PetriNetUnfolder]: For 8696/8849 co-relation queries the response was YES. [2020-10-16 05:07:47,099 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11145 conditions, 2510 events. 1614/2510 cut-off events. For 8696/8849 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 12684 event pairs, 453 based on Foata normal form. 88/2563 useless extension candidates. Maximal degree in co-relation 11116. Up to 1869 conditions per place. [2020-10-16 05:07:47,113 INFO L132 encePairwiseOnDemand]: 159/171 looper letters, 41 selfloop transitions, 30 changer transitions 15/95 dead transitions. [2020-10-16 05:07:47,113 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 95 transitions, 922 flow [2020-10-16 05:07:47,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:07:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:07:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 928 transitions. [2020-10-16 05:07:47,117 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6029889538661468 [2020-10-16 05:07:47,117 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 928 transitions. [2020-10-16 05:07:47,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 928 transitions. [2020-10-16 05:07:47,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:47,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 928 transitions. [2020-10-16 05:07:47,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:07:47,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:07:47,123 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:07:47,123 INFO L185 Difference]: Start difference. First operand has 64 places, 61 transitions, 520 flow. Second operand 9 states and 928 transitions. [2020-10-16 05:07:47,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 95 transitions, 922 flow [2020-10-16 05:07:47,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 95 transitions, 877 flow, removed 22 selfloop flow, removed 3 redundant places. [2020-10-16 05:07:47,148 INFO L241 Difference]: Finished difference. Result has 70 places, 68 transitions, 634 flow [2020-10-16 05:07:47,148 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=634, PETRI_PLACES=70, PETRI_TRANSITIONS=68} [2020-10-16 05:07:47,148 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 35 predicate places. [2020-10-16 05:07:47,148 INFO L481 AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 634 flow [2020-10-16 05:07:47,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:07:47,149 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:47,149 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:47,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 05:07:47,149 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:47,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:47,150 INFO L82 PathProgramCache]: Analyzing trace with hash -595653223, now seen corresponding path program 3 times [2020-10-16 05:07:47,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:47,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012048812] [2020-10-16 05:07:47,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:47,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012048812] [2020-10-16 05:07:47,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:47,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:07:47,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419854847] [2020-10-16 05:07:47,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:07:47,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:47,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:07:47,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:07:47,357 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 171 [2020-10-16 05:07:47,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 634 flow. Second operand 9 states. [2020-10-16 05:07:47,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:47,358 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 171 [2020-10-16 05:07:47,358 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:48,122 INFO L129 PetriNetUnfolder]: 568/1091 cut-off events. [2020-10-16 05:07:48,123 INFO L130 PetriNetUnfolder]: For 6367/6721 co-relation queries the response was YES. [2020-10-16 05:07:48,130 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6021 conditions, 1091 events. 568/1091 cut-off events. For 6367/6721 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6307 event pairs, 132 based on Foata normal form. 97/1148 useless extension candidates. Maximal degree in co-relation 5990. Up to 752 conditions per place. [2020-10-16 05:07:48,137 INFO L132 encePairwiseOnDemand]: 161/171 looper letters, 32 selfloop transitions, 37 changer transitions 12/97 dead transitions. [2020-10-16 05:07:48,137 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 97 transitions, 1117 flow [2020-10-16 05:07:48,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 05:07:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 05:07:48,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1105 transitions. [2020-10-16 05:07:48,142 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6461988304093568 [2020-10-16 05:07:48,142 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1105 transitions. [2020-10-16 05:07:48,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1105 transitions. [2020-10-16 05:07:48,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:48,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1105 transitions. [2020-10-16 05:07:48,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 05:07:48,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 05:07:48,149 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 05:07:48,149 INFO L185 Difference]: Start difference. First operand has 70 places, 68 transitions, 634 flow. Second operand 10 states and 1105 transitions. [2020-10-16 05:07:48,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 97 transitions, 1117 flow [2020-10-16 05:07:48,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 97 transitions, 1089 flow, removed 7 selfloop flow, removed 4 redundant places. [2020-10-16 05:07:48,163 INFO L241 Difference]: Finished difference. Result has 77 places, 80 transitions, 878 flow [2020-10-16 05:07:48,164 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=878, PETRI_PLACES=77, PETRI_TRANSITIONS=80} [2020-10-16 05:07:48,164 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 42 predicate places. [2020-10-16 05:07:48,164 INFO L481 AbstractCegarLoop]: Abstraction has has 77 places, 80 transitions, 878 flow [2020-10-16 05:07:48,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:07:48,164 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:48,164 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:48,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 05:07:48,165 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:48,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:48,165 INFO L82 PathProgramCache]: Analyzing trace with hash -610522589, now seen corresponding path program 1 times [2020-10-16 05:07:48,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:48,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978855263] [2020-10-16 05:07:48,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:48,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978855263] [2020-10-16 05:07:48,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:48,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:07:48,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062621356] [2020-10-16 05:07:48,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:07:48,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:48,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:07:48,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:07:48,594 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 171 [2020-10-16 05:07:48,595 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 80 transitions, 878 flow. Second operand 7 states. [2020-10-16 05:07:48,595 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:48,595 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 171 [2020-10-16 05:07:48,595 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:49,415 INFO L129 PetriNetUnfolder]: 609/1177 cut-off events. [2020-10-16 05:07:49,416 INFO L130 PetriNetUnfolder]: For 8502/9016 co-relation queries the response was YES. [2020-10-16 05:07:49,424 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7163 conditions, 1177 events. 609/1177 cut-off events. For 8502/9016 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7213 event pairs, 88 based on Foata normal form. 71/1222 useless extension candidates. Maximal degree in co-relation 7129. Up to 765 conditions per place. [2020-10-16 05:07:49,437 INFO L132 encePairwiseOnDemand]: 164/171 looper letters, 49 selfloop transitions, 35 changer transitions 6/106 dead transitions. [2020-10-16 05:07:49,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 106 transitions, 1393 flow [2020-10-16 05:07:49,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:07:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:07:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 880 transitions. [2020-10-16 05:07:49,441 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6432748538011696 [2020-10-16 05:07:49,441 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 880 transitions. [2020-10-16 05:07:49,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 880 transitions. [2020-10-16 05:07:49,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:49,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 880 transitions. [2020-10-16 05:07:49,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:07:49,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:07:49,447 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:07:49,447 INFO L185 Difference]: Start difference. First operand has 77 places, 80 transitions, 878 flow. Second operand 8 states and 880 transitions. [2020-10-16 05:07:49,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 106 transitions, 1393 flow [2020-10-16 05:07:49,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 106 transitions, 1298 flow, removed 36 selfloop flow, removed 4 redundant places. [2020-10-16 05:07:49,471 INFO L241 Difference]: Finished difference. Result has 81 places, 90 transitions, 1042 flow [2020-10-16 05:07:49,471 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1042, PETRI_PLACES=81, PETRI_TRANSITIONS=90} [2020-10-16 05:07:49,471 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 46 predicate places. [2020-10-16 05:07:49,471 INFO L481 AbstractCegarLoop]: Abstraction has has 81 places, 90 transitions, 1042 flow [2020-10-16 05:07:49,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:07:49,471 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:49,472 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:49,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 05:07:49,472 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:49,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:49,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1830325709, now seen corresponding path program 2 times [2020-10-16 05:07:49,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:49,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164839991] [2020-10-16 05:07:49,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:49,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164839991] [2020-10-16 05:07:49,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:49,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:07:49,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894067292] [2020-10-16 05:07:49,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:07:49,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:49,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:07:49,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:07:49,726 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 171 [2020-10-16 05:07:49,727 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 90 transitions, 1042 flow. Second operand 9 states. [2020-10-16 05:07:49,727 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:49,727 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 171 [2020-10-16 05:07:49,728 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:50,352 INFO L129 PetriNetUnfolder]: 551/1062 cut-off events. [2020-10-16 05:07:50,353 INFO L130 PetriNetUnfolder]: For 7576/8217 co-relation queries the response was YES. [2020-10-16 05:07:50,361 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6365 conditions, 1062 events. 551/1062 cut-off events. For 7576/8217 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6432 event pairs, 86 based on Foata normal form. 92/1131 useless extension candidates. Maximal degree in co-relation 6330. Up to 692 conditions per place. [2020-10-16 05:07:50,369 INFO L132 encePairwiseOnDemand]: 164/171 looper letters, 45 selfloop transitions, 35 changer transitions 6/102 dead transitions. [2020-10-16 05:07:50,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 102 transitions, 1363 flow [2020-10-16 05:07:50,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:07:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:07:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 790 transitions. [2020-10-16 05:07:50,373 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6599832915622389 [2020-10-16 05:07:50,373 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 790 transitions. [2020-10-16 05:07:50,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 790 transitions. [2020-10-16 05:07:50,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:50,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 790 transitions. [2020-10-16 05:07:50,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:07:50,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:07:50,378 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:07:50,378 INFO L185 Difference]: Start difference. First operand has 81 places, 90 transitions, 1042 flow. Second operand 7 states and 790 transitions. [2020-10-16 05:07:50,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 102 transitions, 1363 flow [2020-10-16 05:07:50,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 102 transitions, 1299 flow, removed 8 selfloop flow, removed 5 redundant places. [2020-10-16 05:07:50,410 INFO L241 Difference]: Finished difference. Result has 83 places, 90 transitions, 1094 flow [2020-10-16 05:07:50,412 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1094, PETRI_PLACES=83, PETRI_TRANSITIONS=90} [2020-10-16 05:07:50,412 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 48 predicate places. [2020-10-16 05:07:50,412 INFO L481 AbstractCegarLoop]: Abstraction has has 83 places, 90 transitions, 1094 flow [2020-10-16 05:07:50,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:07:50,412 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:50,412 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:50,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 05:07:50,413 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:50,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:50,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1829453121, now seen corresponding path program 1 times [2020-10-16 05:07:50,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:50,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244480019] [2020-10-16 05:07:50,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:50,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244480019] [2020-10-16 05:07:50,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:50,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:07:50,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522482075] [2020-10-16 05:07:50,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:07:50,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:50,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:07:50,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:07:50,536 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 05:07:50,537 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 90 transitions, 1094 flow. Second operand 4 states. [2020-10-16 05:07:50,537 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:50,537 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 05:07:50,537 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:50,777 INFO L129 PetriNetUnfolder]: 456/998 cut-off events. [2020-10-16 05:07:50,778 INFO L130 PetriNetUnfolder]: For 6411/7041 co-relation queries the response was YES. [2020-10-16 05:07:50,784 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4954 conditions, 998 events. 456/998 cut-off events. For 6411/7041 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6693 event pairs, 119 based on Foata normal form. 335/1286 useless extension candidates. Maximal degree in co-relation 4918. Up to 411 conditions per place. [2020-10-16 05:07:50,790 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 10 selfloop transitions, 14 changer transitions 0/90 dead transitions. [2020-10-16 05:07:50,790 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 90 transitions, 1019 flow [2020-10-16 05:07:50,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:07:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:07:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2020-10-16 05:07:50,793 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.839766081871345 [2020-10-16 05:07:50,793 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2020-10-16 05:07:50,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2020-10-16 05:07:50,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:50,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2020-10-16 05:07:50,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:07:50,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:07:50,797 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:07:50,797 INFO L185 Difference]: Start difference. First operand has 83 places, 90 transitions, 1094 flow. Second operand 5 states and 718 transitions. [2020-10-16 05:07:50,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 90 transitions, 1019 flow [2020-10-16 05:07:50,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 90 transitions, 918 flow, removed 17 selfloop flow, removed 7 redundant places. [2020-10-16 05:07:50,816 INFO L241 Difference]: Finished difference. Result has 81 places, 87 transitions, 929 flow [2020-10-16 05:07:50,816 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=929, PETRI_PLACES=81, PETRI_TRANSITIONS=87} [2020-10-16 05:07:50,816 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 46 predicate places. [2020-10-16 05:07:50,816 INFO L481 AbstractCegarLoop]: Abstraction has has 81 places, 87 transitions, 929 flow [2020-10-16 05:07:50,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:07:50,817 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:50,817 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:50,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 05:07:50,817 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:50,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:50,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1009057247, now seen corresponding path program 1 times [2020-10-16 05:07:50,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:50,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967387297] [2020-10-16 05:07:50,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:50,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967387297] [2020-10-16 05:07:50,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:50,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:07:50,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910027229] [2020-10-16 05:07:50,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:07:50,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:50,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:07:50,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:07:50,920 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 05:07:50,921 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 87 transitions, 929 flow. Second operand 5 states. [2020-10-16 05:07:50,921 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:50,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 05:07:50,921 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:51,129 INFO L129 PetriNetUnfolder]: 246/662 cut-off events. [2020-10-16 05:07:51,129 INFO L130 PetriNetUnfolder]: For 5733/7479 co-relation queries the response was YES. [2020-10-16 05:07:51,133 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3657 conditions, 662 events. 246/662 cut-off events. For 5733/7479 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4602 event pairs, 14 based on Foata normal form. 593/1226 useless extension candidates. Maximal degree in co-relation 3621. Up to 275 conditions per place. [2020-10-16 05:07:51,136 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 6 selfloop transitions, 21 changer transitions 3/92 dead transitions. [2020-10-16 05:07:51,136 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 92 transitions, 1022 flow [2020-10-16 05:07:51,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:07:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:07:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1005 transitions. [2020-10-16 05:07:51,146 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8395989974937343 [2020-10-16 05:07:51,146 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1005 transitions. [2020-10-16 05:07:51,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1005 transitions. [2020-10-16 05:07:51,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:51,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1005 transitions. [2020-10-16 05:07:51,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:07:51,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:07:51,151 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:07:51,151 INFO L185 Difference]: Start difference. First operand has 81 places, 87 transitions, 929 flow. Second operand 7 states and 1005 transitions. [2020-10-16 05:07:51,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 92 transitions, 1022 flow [2020-10-16 05:07:51,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 92 transitions, 959 flow, removed 10 selfloop flow, removed 5 redundant places. [2020-10-16 05:07:51,164 INFO L241 Difference]: Finished difference. Result has 85 places, 89 transitions, 952 flow [2020-10-16 05:07:51,164 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=952, PETRI_PLACES=85, PETRI_TRANSITIONS=89} [2020-10-16 05:07:51,164 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 50 predicate places. [2020-10-16 05:07:51,164 INFO L481 AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 952 flow [2020-10-16 05:07:51,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:07:51,165 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:51,165 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] [2020-10-16 05:07:51,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 05:07:51,165 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:51,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:51,165 INFO L82 PathProgramCache]: Analyzing trace with hash 596831156, now seen corresponding path program 1 times [2020-10-16 05:07:51,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:51,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108739260] [2020-10-16 05:07:51,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:51,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108739260] [2020-10-16 05:07:51,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:51,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:07:51,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294755776] [2020-10-16 05:07:51,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:07:51,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:51,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:07:51,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:07:51,300 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 05:07:51,300 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 89 transitions, 952 flow. Second operand 6 states. [2020-10-16 05:07:51,300 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:51,301 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 05:07:51,301 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:51,480 INFO L129 PetriNetUnfolder]: 206/583 cut-off events. [2020-10-16 05:07:51,480 INFO L130 PetriNetUnfolder]: For 6390/7931 co-relation queries the response was YES. [2020-10-16 05:07:51,484 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3470 conditions, 583 events. 206/583 cut-off events. For 6390/7931 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4123 event pairs, 6 based on Foata normal form. 517/1079 useless extension candidates. Maximal degree in co-relation 3433. Up to 257 conditions per place. [2020-10-16 05:07:51,487 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 2 selfloop transitions, 25 changer transitions 3/90 dead transitions. [2020-10-16 05:07:51,487 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 90 transitions, 1021 flow [2020-10-16 05:07:51,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:07:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:07:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1286 transitions. [2020-10-16 05:07:51,500 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8356075373619233 [2020-10-16 05:07:51,500 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1286 transitions. [2020-10-16 05:07:51,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1286 transitions. [2020-10-16 05:07:51,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:51,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1286 transitions. [2020-10-16 05:07:51,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:07:51,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:07:51,506 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:07:51,506 INFO L185 Difference]: Start difference. First operand has 85 places, 89 transitions, 952 flow. Second operand 9 states and 1286 transitions. [2020-10-16 05:07:51,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 90 transitions, 1021 flow [2020-10-16 05:07:51,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 90 transitions, 909 flow, removed 39 selfloop flow, removed 5 redundant places. [2020-10-16 05:07:51,534 INFO L241 Difference]: Finished difference. Result has 91 places, 87 transitions, 884 flow [2020-10-16 05:07:51,534 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=884, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2020-10-16 05:07:51,535 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 56 predicate places. [2020-10-16 05:07:51,535 INFO L481 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 884 flow [2020-10-16 05:07:51,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:07:51,535 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:51,535 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] [2020-10-16 05:07:51,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 05:07:51,535 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:51,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:51,536 INFO L82 PathProgramCache]: Analyzing trace with hash -952828507, now seen corresponding path program 1 times [2020-10-16 05:07:51,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:51,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091734754] [2020-10-16 05:07:51,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:51,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091734754] [2020-10-16 05:07:51,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:51,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 05:07:51,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024728137] [2020-10-16 05:07:51,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 05:07:51,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:51,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 05:07:51,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-16 05:07:51,879 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 171 [2020-10-16 05:07:51,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 884 flow. Second operand 11 states. [2020-10-16 05:07:51,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:51,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 171 [2020-10-16 05:07:51,880 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:52,919 INFO L129 PetriNetUnfolder]: 1050/1852 cut-off events. [2020-10-16 05:07:52,920 INFO L130 PetriNetUnfolder]: For 12558/13107 co-relation queries the response was YES. [2020-10-16 05:07:52,928 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11176 conditions, 1852 events. 1050/1852 cut-off events. For 12558/13107 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11009 event pairs, 79 based on Foata normal form. 111/1953 useless extension candidates. Maximal degree in co-relation 11138. Up to 858 conditions per place. [2020-10-16 05:07:52,932 INFO L132 encePairwiseOnDemand]: 158/171 looper letters, 62 selfloop transitions, 41 changer transitions 47/159 dead transitions. [2020-10-16 05:07:52,932 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 159 transitions, 1929 flow [2020-10-16 05:07:52,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 05:07:52,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 05:07:52,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1454 transitions. [2020-10-16 05:07:52,938 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6073517126148705 [2020-10-16 05:07:52,938 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1454 transitions. [2020-10-16 05:07:52,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1454 transitions. [2020-10-16 05:07:52,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:52,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1454 transitions. [2020-10-16 05:07:52,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 05:07:52,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 05:07:52,945 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 05:07:52,945 INFO L185 Difference]: Start difference. First operand has 91 places, 87 transitions, 884 flow. Second operand 14 states and 1454 transitions. [2020-10-16 05:07:52,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 159 transitions, 1929 flow [2020-10-16 05:07:53,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 159 transitions, 1707 flow, removed 56 selfloop flow, removed 11 redundant places. [2020-10-16 05:07:53,004 INFO L241 Difference]: Finished difference. Result has 100 places, 91 transitions, 984 flow [2020-10-16 05:07:53,005 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=984, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2020-10-16 05:07:53,005 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 65 predicate places. [2020-10-16 05:07:53,005 INFO L481 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 984 flow [2020-10-16 05:07:53,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 05:07:53,005 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:53,005 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] [2020-10-16 05:07:53,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 05:07:53,006 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:53,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:53,006 INFO L82 PathProgramCache]: Analyzing trace with hash 810369869, now seen corresponding path program 2 times [2020-10-16 05:07:53,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:53,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175921116] [2020-10-16 05:07:53,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:53,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175921116] [2020-10-16 05:07:53,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:53,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:07:53,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018050707] [2020-10-16 05:07:53,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:07:53,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:53,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:07:53,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:07:53,185 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 171 [2020-10-16 05:07:53,186 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 984 flow. Second operand 7 states. [2020-10-16 05:07:53,186 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:53,186 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 171 [2020-10-16 05:07:53,186 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:54,044 INFO L129 PetriNetUnfolder]: 356/914 cut-off events. [2020-10-16 05:07:54,044 INFO L130 PetriNetUnfolder]: For 8363/9167 co-relation queries the response was YES. [2020-10-16 05:07:54,053 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5101 conditions, 914 events. 356/914 cut-off events. For 8363/9167 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6612 event pairs, 2 based on Foata normal form. 292/1205 useless extension candidates. Maximal degree in co-relation 5069. Up to 358 conditions per place. [2020-10-16 05:07:54,058 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 40 selfloop transitions, 34 changer transitions 25/128 dead transitions. [2020-10-16 05:07:54,058 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 128 transitions, 1592 flow [2020-10-16 05:07:54,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:07:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:07:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 903 transitions. [2020-10-16 05:07:54,063 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6600877192982456 [2020-10-16 05:07:54,063 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 903 transitions. [2020-10-16 05:07:54,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 903 transitions. [2020-10-16 05:07:54,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:54,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 903 transitions. [2020-10-16 05:07:54,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:07:54,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:07:54,070 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:07:54,070 INFO L185 Difference]: Start difference. First operand has 100 places, 91 transitions, 984 flow. Second operand 8 states and 903 transitions. [2020-10-16 05:07:54,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 128 transitions, 1592 flow [2020-10-16 05:07:54,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 128 transitions, 1456 flow, removed 37 selfloop flow, removed 12 redundant places. [2020-10-16 05:07:54,112 INFO L241 Difference]: Finished difference. Result has 95 places, 100 transitions, 1134 flow [2020-10-16 05:07:54,112 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1134, PETRI_PLACES=95, PETRI_TRANSITIONS=100} [2020-10-16 05:07:54,112 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 60 predicate places. [2020-10-16 05:07:54,113 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 100 transitions, 1134 flow [2020-10-16 05:07:54,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:07:54,113 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:54,113 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] [2020-10-16 05:07:54,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 05:07:54,114 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:54,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:54,114 INFO L82 PathProgramCache]: Analyzing trace with hash -218143255, now seen corresponding path program 3 times [2020-10-16 05:07:54,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:54,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153287854] [2020-10-16 05:07:54,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:54,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153287854] [2020-10-16 05:07:54,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:54,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 05:07:54,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554758688] [2020-10-16 05:07:54,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 05:07:54,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:54,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 05:07:54,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-10-16 05:07:54,615 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 171 [2020-10-16 05:07:54,616 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 100 transitions, 1134 flow. Second operand 12 states. [2020-10-16 05:07:54,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:54,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 171 [2020-10-16 05:07:54,617 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:55,786 INFO L129 PetriNetUnfolder]: 830/1503 cut-off events. [2020-10-16 05:07:55,786 INFO L130 PetriNetUnfolder]: For 11092/11638 co-relation queries the response was YES. [2020-10-16 05:07:55,796 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9303 conditions, 1503 events. 830/1503 cut-off events. For 11092/11638 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 8799 event pairs, 121 based on Foata normal form. 60/1549 useless extension candidates. Maximal degree in co-relation 9272. Up to 1266 conditions per place. [2020-10-16 05:07:55,801 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 75 selfloop transitions, 31 changer transitions 24/139 dead transitions. [2020-10-16 05:07:55,802 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 139 transitions, 1747 flow [2020-10-16 05:07:55,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-16 05:07:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-16 05:07:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1414 transitions. [2020-10-16 05:07:55,805 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5512670565302145 [2020-10-16 05:07:55,805 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1414 transitions. [2020-10-16 05:07:55,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1414 transitions. [2020-10-16 05:07:55,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:55,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1414 transitions. [2020-10-16 05:07:55,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-16 05:07:55,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-16 05:07:55,812 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-16 05:07:55,812 INFO L185 Difference]: Start difference. First operand has 95 places, 100 transitions, 1134 flow. Second operand 15 states and 1414 transitions. [2020-10-16 05:07:55,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 139 transitions, 1747 flow [2020-10-16 05:07:55,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 139 transitions, 1708 flow, removed 19 selfloop flow, removed 4 redundant places. [2020-10-16 05:07:55,859 INFO L241 Difference]: Finished difference. Result has 109 places, 107 transitions, 1305 flow [2020-10-16 05:07:55,860 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1305, PETRI_PLACES=109, PETRI_TRANSITIONS=107} [2020-10-16 05:07:55,860 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 74 predicate places. [2020-10-16 05:07:55,860 INFO L481 AbstractCegarLoop]: Abstraction has has 109 places, 107 transitions, 1305 flow [2020-10-16 05:07:55,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 05:07:55,860 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:55,860 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] [2020-10-16 05:07:55,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 05:07:55,861 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:55,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:55,861 INFO L82 PathProgramCache]: Analyzing trace with hash -155199169, now seen corresponding path program 4 times [2020-10-16 05:07:55,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:55,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803190392] [2020-10-16 05:07:55,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:56,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803190392] [2020-10-16 05:07:56,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:56,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:07:56,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939836994] [2020-10-16 05:07:56,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:07:56,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:56,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:07:56,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:07:56,155 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 171 [2020-10-16 05:07:56,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 1305 flow. Second operand 9 states. [2020-10-16 05:07:56,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:56,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 171 [2020-10-16 05:07:56,156 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:56,637 INFO L129 PetriNetUnfolder]: 290/758 cut-off events. [2020-10-16 05:07:56,638 INFO L130 PetriNetUnfolder]: For 7092/7927 co-relation queries the response was YES. [2020-10-16 05:07:56,642 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4572 conditions, 758 events. 290/758 cut-off events. For 7092/7927 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5262 event pairs, 10 based on Foata normal form. 266/1021 useless extension candidates. Maximal degree in co-relation 4537. Up to 294 conditions per place. [2020-10-16 05:07:56,645 INFO L132 encePairwiseOnDemand]: 162/171 looper letters, 53 selfloop transitions, 35 changer transitions 8/125 dead transitions. [2020-10-16 05:07:56,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 125 transitions, 1697 flow [2020-10-16 05:07:56,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 05:07:56,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 05:07:56,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1301 transitions. [2020-10-16 05:07:56,648 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6340155945419104 [2020-10-16 05:07:56,649 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1301 transitions. [2020-10-16 05:07:56,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1301 transitions. [2020-10-16 05:07:56,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:56,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1301 transitions. [2020-10-16 05:07:56,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 05:07:56,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 05:07:56,653 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 05:07:56,653 INFO L185 Difference]: Start difference. First operand has 109 places, 107 transitions, 1305 flow. Second operand 12 states and 1301 transitions. [2020-10-16 05:07:56,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 125 transitions, 1697 flow [2020-10-16 05:07:56,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 125 transitions, 1577 flow, removed 13 selfloop flow, removed 12 redundant places. [2020-10-16 05:07:56,678 INFO L241 Difference]: Finished difference. Result has 105 places, 107 transitions, 1317 flow [2020-10-16 05:07:56,678 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1317, PETRI_PLACES=105, PETRI_TRANSITIONS=107} [2020-10-16 05:07:56,678 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 70 predicate places. [2020-10-16 05:07:56,678 INFO L481 AbstractCegarLoop]: Abstraction has has 105 places, 107 transitions, 1317 flow [2020-10-16 05:07:56,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:07:56,679 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:56,679 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] [2020-10-16 05:07:56,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 05:07:56,679 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:56,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:56,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1778065165, now seen corresponding path program 5 times [2020-10-16 05:07:56,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:56,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946864765] [2020-10-16 05:07:56,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:57,138 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 27 [2020-10-16 05:07:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:57,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946864765] [2020-10-16 05:07:57,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:57,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 05:07:57,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848035960] [2020-10-16 05:07:57,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 05:07:57,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:57,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 05:07:57,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-16 05:07:57,256 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 171 [2020-10-16 05:07:57,257 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 107 transitions, 1317 flow. Second operand 12 states. [2020-10-16 05:07:57,257 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:57,257 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 171 [2020-10-16 05:07:57,258 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:58,387 INFO L129 PetriNetUnfolder]: 333/846 cut-off events. [2020-10-16 05:07:58,388 INFO L130 PetriNetUnfolder]: For 8827/9944 co-relation queries the response was YES. [2020-10-16 05:07:58,392 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5321 conditions, 846 events. 333/846 cut-off events. For 8827/9944 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5881 event pairs, 6 based on Foata normal form. 353/1196 useless extension candidates. Maximal degree in co-relation 5284. Up to 346 conditions per place. [2020-10-16 05:07:58,400 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 53 selfloop transitions, 50 changer transitions 13/143 dead transitions. [2020-10-16 05:07:58,400 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 143 transitions, 2047 flow [2020-10-16 05:07:58,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 05:07:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 05:07:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1248 transitions. [2020-10-16 05:07:58,406 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6081871345029239 [2020-10-16 05:07:58,408 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1248 transitions. [2020-10-16 05:07:58,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1248 transitions. [2020-10-16 05:07:58,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:58,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1248 transitions. [2020-10-16 05:07:58,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 05:07:58,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 05:07:58,414 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 05:07:58,415 INFO L185 Difference]: Start difference. First operand has 105 places, 107 transitions, 1317 flow. Second operand 12 states and 1248 transitions. [2020-10-16 05:07:58,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 143 transitions, 2047 flow [2020-10-16 05:07:58,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 143 transitions, 1973 flow, removed 16 selfloop flow, removed 7 redundant places. [2020-10-16 05:07:58,443 INFO L241 Difference]: Finished difference. Result has 115 places, 123 transitions, 1763 flow [2020-10-16 05:07:58,443 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1763, PETRI_PLACES=115, PETRI_TRANSITIONS=123} [2020-10-16 05:07:58,443 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 80 predicate places. [2020-10-16 05:07:58,443 INFO L481 AbstractCegarLoop]: Abstraction has has 115 places, 123 transitions, 1763 flow [2020-10-16 05:07:58,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 05:07:58,444 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:58,444 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] [2020-10-16 05:07:58,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 05:07:58,444 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:58,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:58,444 INFO L82 PathProgramCache]: Analyzing trace with hash -61867167, now seen corresponding path program 6 times [2020-10-16 05:07:58,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:58,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844287322] [2020-10-16 05:07:58,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:58,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844287322] [2020-10-16 05:07:58,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:58,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 05:07:58,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912061628] [2020-10-16 05:07:58,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 05:07:58,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:58,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 05:07:58,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-10-16 05:07:58,818 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 171 [2020-10-16 05:07:58,819 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 123 transitions, 1763 flow. Second operand 12 states. [2020-10-16 05:07:58,819 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:58,819 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 171 [2020-10-16 05:07:58,819 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:00,059 INFO L129 PetriNetUnfolder]: 1049/1855 cut-off events. [2020-10-16 05:08:00,060 INFO L130 PetriNetUnfolder]: For 21597/22791 co-relation queries the response was YES. [2020-10-16 05:08:00,069 INFO L80 FinitePrefix]: Finished finitePrefix Result has 12955 conditions, 1855 events. 1049/1855 cut-off events. For 21597/22791 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 11222 event pairs, 160 based on Foata normal form. 97/1930 useless extension candidates. Maximal degree in co-relation 12916. Up to 1176 conditions per place. [2020-10-16 05:08:00,075 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 94 selfloop transitions, 31 changer transitions 49/183 dead transitions. [2020-10-16 05:08:00,075 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 183 transitions, 2686 flow [2020-10-16 05:08:00,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-16 05:08:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-16 05:08:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1511 transitions. [2020-10-16 05:08:00,083 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5522660818713451 [2020-10-16 05:08:00,083 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1511 transitions. [2020-10-16 05:08:00,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1511 transitions. [2020-10-16 05:08:00,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:00,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1511 transitions. [2020-10-16 05:08:00,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-16 05:08:00,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-16 05:08:00,089 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-16 05:08:00,089 INFO L185 Difference]: Start difference. First operand has 115 places, 123 transitions, 1763 flow. Second operand 16 states and 1511 transitions. [2020-10-16 05:08:00,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 183 transitions, 2686 flow [2020-10-16 05:08:00,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 183 transitions, 2474 flow, removed 70 selfloop flow, removed 7 redundant places. [2020-10-16 05:08:00,165 INFO L241 Difference]: Finished difference. Result has 127 places, 119 transitions, 1675 flow [2020-10-16 05:08:00,165 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1575, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1675, PETRI_PLACES=127, PETRI_TRANSITIONS=119} [2020-10-16 05:08:00,165 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 92 predicate places. [2020-10-16 05:08:00,165 INFO L481 AbstractCegarLoop]: Abstraction has has 127 places, 119 transitions, 1675 flow [2020-10-16 05:08:00,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 05:08:00,166 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:00,166 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] [2020-10-16 05:08:00,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 05:08:00,166 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:00,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:00,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1433300035, now seen corresponding path program 7 times [2020-10-16 05:08:00,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:00,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673535758] [2020-10-16 05:08:00,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:00,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:08:00,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673535758] [2020-10-16 05:08:00,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:00,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:08:00,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73204827] [2020-10-16 05:08:00,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:08:00,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:00,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:08:00,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:08:00,354 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 171 [2020-10-16 05:08:00,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 119 transitions, 1675 flow. Second operand 6 states. [2020-10-16 05:08:00,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:00,355 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 171 [2020-10-16 05:08:00,355 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:00,700 INFO L129 PetriNetUnfolder]: 303/755 cut-off events. [2020-10-16 05:08:00,700 INFO L130 PetriNetUnfolder]: For 10595/11488 co-relation queries the response was YES. [2020-10-16 05:08:00,707 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5079 conditions, 755 events. 303/755 cut-off events. For 10595/11488 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5129 event pairs, 26 based on Foata normal form. 264/1016 useless extension candidates. Maximal degree in co-relation 5032. Up to 303 conditions per place. [2020-10-16 05:08:00,710 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 47 selfloop transitions, 50 changer transitions 10/134 dead transitions. [2020-10-16 05:08:00,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 134 transitions, 2063 flow [2020-10-16 05:08:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:08:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:08:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions. [2020-10-16 05:08:00,713 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6793372319688109 [2020-10-16 05:08:00,713 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 697 transitions. [2020-10-16 05:08:00,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 697 transitions. [2020-10-16 05:08:00,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:00,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 697 transitions. [2020-10-16 05:08:00,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:08:00,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:08:00,716 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:08:00,716 INFO L185 Difference]: Start difference. First operand has 127 places, 119 transitions, 1675 flow. Second operand 6 states and 697 transitions. [2020-10-16 05:08:00,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 134 transitions, 2063 flow [2020-10-16 05:08:00,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 134 transitions, 1896 flow, removed 18 selfloop flow, removed 13 redundant places. [2020-10-16 05:08:00,743 INFO L241 Difference]: Finished difference. Result has 109 places, 120 transitions, 1685 flow [2020-10-16 05:08:00,743 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1685, PETRI_PLACES=109, PETRI_TRANSITIONS=120} [2020-10-16 05:08:00,743 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 74 predicate places. [2020-10-16 05:08:00,743 INFO L481 AbstractCegarLoop]: Abstraction has has 109 places, 120 transitions, 1685 flow [2020-10-16 05:08:00,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:08:00,744 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:00,744 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] [2020-10-16 05:08:00,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 05:08:00,744 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:00,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:00,745 INFO L82 PathProgramCache]: Analyzing trace with hash 908613699, now seen corresponding path program 8 times [2020-10-16 05:08:00,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:00,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286497736] [2020-10-16 05:08:00,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:01,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:08:01,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286497736] [2020-10-16 05:08:01,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:01,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:08:01,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126356952] [2020-10-16 05:08:01,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:08:01,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:01,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:08:01,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:08:01,188 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 171 [2020-10-16 05:08:01,189 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 120 transitions, 1685 flow. Second operand 8 states. [2020-10-16 05:08:01,189 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:01,189 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 171 [2020-10-16 05:08:01,189 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:01,880 INFO L129 PetriNetUnfolder]: 360/912 cut-off events. [2020-10-16 05:08:01,880 INFO L130 PetriNetUnfolder]: For 11731/12569 co-relation queries the response was YES. [2020-10-16 05:08:01,886 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6043 conditions, 912 events. 360/912 cut-off events. For 11731/12569 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 6622 event pairs, 8 based on Foata normal form. 320/1229 useless extension candidates. Maximal degree in co-relation 6002. Up to 366 conditions per place. [2020-10-16 05:08:01,888 INFO L132 encePairwiseOnDemand]: 161/171 looper letters, 43 selfloop transitions, 76 changer transitions 9/155 dead transitions. [2020-10-16 05:08:01,888 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 155 transitions, 2415 flow [2020-10-16 05:08:01,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 05:08:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 05:08:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1507 transitions. [2020-10-16 05:08:01,892 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6294903926482874 [2020-10-16 05:08:01,892 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1507 transitions. [2020-10-16 05:08:01,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1507 transitions. [2020-10-16 05:08:01,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:01,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1507 transitions. [2020-10-16 05:08:01,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 05:08:01,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 05:08:01,897 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 05:08:01,897 INFO L185 Difference]: Start difference. First operand has 109 places, 120 transitions, 1685 flow. Second operand 14 states and 1507 transitions. [2020-10-16 05:08:01,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 155 transitions, 2415 flow [2020-10-16 05:08:01,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 155 transitions, 2295 flow, removed 8 selfloop flow, removed 5 redundant places. [2020-10-16 05:08:01,936 INFO L241 Difference]: Finished difference. Result has 120 places, 137 transitions, 2080 flow [2020-10-16 05:08:01,937 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1585, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2080, PETRI_PLACES=120, PETRI_TRANSITIONS=137} [2020-10-16 05:08:01,937 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 85 predicate places. [2020-10-16 05:08:01,937 INFO L481 AbstractCegarLoop]: Abstraction has has 120 places, 137 transitions, 2080 flow [2020-10-16 05:08:01,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:08:01,937 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:01,937 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] [2020-10-16 05:08:01,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 05:08:01,938 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:01,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:01,938 INFO L82 PathProgramCache]: Analyzing trace with hash -193708285, now seen corresponding path program 9 times [2020-10-16 05:08:01,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:01,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525325640] [2020-10-16 05:08:01,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:08:02,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525325640] [2020-10-16 05:08:02,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:02,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 05:08:02,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681588303] [2020-10-16 05:08:02,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 05:08:02,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:02,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 05:08:02,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-16 05:08:02,397 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 171 [2020-10-16 05:08:02,398 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 137 transitions, 2080 flow. Second operand 10 states. [2020-10-16 05:08:02,398 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:02,398 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 171 [2020-10-16 05:08:02,398 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:03,481 INFO L129 PetriNetUnfolder]: 417/1028 cut-off events. [2020-10-16 05:08:03,481 INFO L130 PetriNetUnfolder]: For 15656/16611 co-relation queries the response was YES. [2020-10-16 05:08:03,488 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6994 conditions, 1028 events. 417/1028 cut-off events. For 15656/16611 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 7505 event pairs, 12 based on Foata normal form. 358/1377 useless extension candidates. Maximal degree in co-relation 6949. Up to 381 conditions per place. [2020-10-16 05:08:03,491 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 53 selfloop transitions, 91 changer transitions 4/175 dead transitions. [2020-10-16 05:08:03,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 175 transitions, 2946 flow [2020-10-16 05:08:03,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 05:08:03,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 05:08:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1422 transitions. [2020-10-16 05:08:03,500 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5939849624060151 [2020-10-16 05:08:03,500 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1422 transitions. [2020-10-16 05:08:03,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1422 transitions. [2020-10-16 05:08:03,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:03,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1422 transitions. [2020-10-16 05:08:03,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 05:08:03,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 05:08:03,505 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 05:08:03,505 INFO L185 Difference]: Start difference. First operand has 120 places, 137 transitions, 2080 flow. Second operand 14 states and 1422 transitions. [2020-10-16 05:08:03,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 175 transitions, 2946 flow [2020-10-16 05:08:03,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 175 transitions, 2753 flow, removed 75 selfloop flow, removed 5 redundant places. [2020-10-16 05:08:03,563 INFO L241 Difference]: Finished difference. Result has 130 places, 161 transitions, 2626 flow [2020-10-16 05:08:03,563 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1935, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2626, PETRI_PLACES=130, PETRI_TRANSITIONS=161} [2020-10-16 05:08:03,563 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 95 predicate places. [2020-10-16 05:08:03,563 INFO L481 AbstractCegarLoop]: Abstraction has has 130 places, 161 transitions, 2626 flow [2020-10-16 05:08:03,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 05:08:03,564 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:03,564 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] [2020-10-16 05:08:03,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 05:08:03,564 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:03,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:03,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1445269849, now seen corresponding path program 10 times [2020-10-16 05:08:03,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:03,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133178060] [2020-10-16 05:08:03,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:08:03,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133178060] [2020-10-16 05:08:03,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:03,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:08:03,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343102318] [2020-10-16 05:08:03,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:08:03,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:03,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:08:03,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:08:03,977 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 171 [2020-10-16 05:08:03,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 161 transitions, 2626 flow. Second operand 9 states. [2020-10-16 05:08:03,978 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:03,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 171 [2020-10-16 05:08:03,978 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:04,753 INFO L129 PetriNetUnfolder]: 447/1140 cut-off events. [2020-10-16 05:08:04,753 INFO L130 PetriNetUnfolder]: For 17449/18419 co-relation queries the response was YES. [2020-10-16 05:08:04,759 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7875 conditions, 1140 events. 447/1140 cut-off events. For 17449/18419 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 8669 event pairs, 40 based on Foata normal form. 352/1483 useless extension candidates. Maximal degree in co-relation 7824. Up to 390 conditions per place. [2020-10-16 05:08:04,762 INFO L132 encePairwiseOnDemand]: 162/171 looper letters, 74 selfloop transitions, 73 changer transitions 9/183 dead transitions. [2020-10-16 05:08:04,762 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 183 transitions, 3218 flow [2020-10-16 05:08:04,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 05:08:04,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 05:08:04,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1109 transitions. [2020-10-16 05:08:04,764 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6485380116959064 [2020-10-16 05:08:04,764 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1109 transitions. [2020-10-16 05:08:04,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1109 transitions. [2020-10-16 05:08:04,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:04,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1109 transitions. [2020-10-16 05:08:04,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 05:08:04,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 05:08:04,768 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 05:08:04,768 INFO L185 Difference]: Start difference. First operand has 130 places, 161 transitions, 2626 flow. Second operand 10 states and 1109 transitions. [2020-10-16 05:08:04,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 183 transitions, 3218 flow [2020-10-16 05:08:04,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 183 transitions, 3026 flow, removed 51 selfloop flow, removed 8 redundant places. [2020-10-16 05:08:04,811 INFO L241 Difference]: Finished difference. Result has 133 places, 160 transitions, 2568 flow [2020-10-16 05:08:04,811 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=2442, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2568, PETRI_PLACES=133, PETRI_TRANSITIONS=160} [2020-10-16 05:08:04,812 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 98 predicate places. [2020-10-16 05:08:04,812 INFO L481 AbstractCegarLoop]: Abstraction has has 133 places, 160 transitions, 2568 flow [2020-10-16 05:08:04,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:08:04,812 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:04,812 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] [2020-10-16 05:08:04,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-16 05:08:04,812 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:04,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:04,812 INFO L82 PathProgramCache]: Analyzing trace with hash 154030197, now seen corresponding path program 11 times [2020-10-16 05:08:04,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:04,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554511203] [2020-10-16 05:08:04,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:08:05,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554511203] [2020-10-16 05:08:05,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:05,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:08:05,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998546583] [2020-10-16 05:08:05,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:08:05,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:05,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:08:05,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:08:05,149 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 171 [2020-10-16 05:08:05,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 160 transitions, 2568 flow. Second operand 9 states. [2020-10-16 05:08:05,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:05,150 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 171 [2020-10-16 05:08:05,150 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:06,047 INFO L129 PetriNetUnfolder]: 535/1453 cut-off events. [2020-10-16 05:08:06,047 INFO L130 PetriNetUnfolder]: For 20276/21216 co-relation queries the response was YES. [2020-10-16 05:08:06,056 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9306 conditions, 1453 events. 535/1453 cut-off events. For 20276/21216 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 12142 event pairs, 8 based on Foata normal form. 383/1827 useless extension candidates. Maximal degree in co-relation 9253. Up to 488 conditions per place. [2020-10-16 05:08:06,059 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 44 selfloop transitions, 42 changer transitions 73/186 dead transitions. [2020-10-16 05:08:06,060 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 186 transitions, 3197 flow [2020-10-16 05:08:06,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 05:08:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 05:08:06,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1175 transitions. [2020-10-16 05:08:06,065 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6246677299308878 [2020-10-16 05:08:06,065 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1175 transitions. [2020-10-16 05:08:06,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1175 transitions. [2020-10-16 05:08:06,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:06,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1175 transitions. [2020-10-16 05:08:06,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 05:08:06,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 05:08:06,069 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 05:08:06,070 INFO L185 Difference]: Start difference. First operand has 133 places, 160 transitions, 2568 flow. Second operand 11 states and 1175 transitions. [2020-10-16 05:08:06,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 186 transitions, 3197 flow [2020-10-16 05:08:06,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 186 transitions, 3063 flow, removed 29 selfloop flow, removed 9 redundant places. [2020-10-16 05:08:06,148 INFO L241 Difference]: Finished difference. Result has 132 places, 102 transitions, 1567 flow [2020-10-16 05:08:06,148 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=2446, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1567, PETRI_PLACES=132, PETRI_TRANSITIONS=102} [2020-10-16 05:08:06,149 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 97 predicate places. [2020-10-16 05:08:06,149 INFO L481 AbstractCegarLoop]: Abstraction has has 132 places, 102 transitions, 1567 flow [2020-10-16 05:08:06,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:08:06,149 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:06,149 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] [2020-10-16 05:08:06,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-16 05:08:06,150 INFO L429 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:06,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:06,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1713754129, now seen corresponding path program 12 times [2020-10-16 05:08:06,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:06,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062960677] [2020-10-16 05:08:06,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:06,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-16 05:08:06,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062960677] [2020-10-16 05:08:06,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:06,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-16 05:08:06,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089623066] [2020-10-16 05:08:06,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-16 05:08:06,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:06,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-16 05:08:06,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-10-16 05:08:06,745 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 171 [2020-10-16 05:08:06,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 102 transitions, 1567 flow. Second operand 13 states. [2020-10-16 05:08:06,746 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:06,746 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 171 [2020-10-16 05:08:06,746 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:08,627 INFO L129 PetriNetUnfolder]: 1124/2324 cut-off events. [2020-10-16 05:08:08,628 INFO L130 PetriNetUnfolder]: For 27745/27872 co-relation queries the response was YES. [2020-10-16 05:08:08,641 INFO L80 FinitePrefix]: Finished finitePrefix Result has 15962 conditions, 2324 events. 1124/2324 cut-off events. For 27745/27872 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 17382 event pairs, 13 based on Foata normal form. 30/2349 useless extension candidates. Maximal degree in co-relation 15912. Up to 1059 conditions per place. [2020-10-16 05:08:08,646 INFO L132 encePairwiseOnDemand]: 157/171 looper letters, 56 selfloop transitions, 124 changer transitions 34/223 dead transitions. [2020-10-16 05:08:08,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 223 transitions, 3501 flow [2020-10-16 05:08:08,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-16 05:08:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-16 05:08:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1609 transitions. [2020-10-16 05:08:08,650 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5534915720674235 [2020-10-16 05:08:08,650 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1609 transitions. [2020-10-16 05:08:08,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1609 transitions. [2020-10-16 05:08:08,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:08,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1609 transitions. [2020-10-16 05:08:08,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 18 states. [2020-10-16 05:08:08,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 18 states. [2020-10-16 05:08:08,657 INFO L81 ComplementDD]: Finished complementDD. Result 18 states. [2020-10-16 05:08:08,657 INFO L185 Difference]: Start difference. First operand has 132 places, 102 transitions, 1567 flow. Second operand 17 states and 1609 transitions. [2020-10-16 05:08:08,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 223 transitions, 3501 flow [2020-10-16 05:08:08,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 223 transitions, 2912 flow, removed 158 selfloop flow, removed 20 redundant places. [2020-10-16 05:08:08,755 INFO L241 Difference]: Finished difference. Result has 127 places, 171 transitions, 2408 flow [2020-10-16 05:08:08,755 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1262, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2408, PETRI_PLACES=127, PETRI_TRANSITIONS=171} [2020-10-16 05:08:08,756 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 92 predicate places. [2020-10-16 05:08:08,756 INFO L481 AbstractCegarLoop]: Abstraction has has 127 places, 171 transitions, 2408 flow [2020-10-16 05:08:08,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-16 05:08:08,756 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:08,756 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] [2020-10-16 05:08:08,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-16 05:08:08,757 INFO L429 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:08,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:08,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1693977273, now seen corresponding path program 13 times [2020-10-16 05:08:08,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:08,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378759367] [2020-10-16 05:08:08,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:08:09,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378759367] [2020-10-16 05:08:09,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:09,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 05:08:09,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934300173] [2020-10-16 05:08:09,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 05:08:09,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:09,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 05:08:09,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-16 05:08:09,224 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 171 [2020-10-16 05:08:09,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 171 transitions, 2408 flow. Second operand 12 states. [2020-10-16 05:08:09,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:09,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 171 [2020-10-16 05:08:09,225 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:10,546 INFO L129 PetriNetUnfolder]: 1182/2541 cut-off events. [2020-10-16 05:08:10,546 INFO L130 PetriNetUnfolder]: For 24107/24191 co-relation queries the response was YES. [2020-10-16 05:08:10,566 INFO L80 FinitePrefix]: Finished finitePrefix Result has 17950 conditions, 2541 events. 1182/2541 cut-off events. For 24107/24191 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 20001 event pairs, 240 based on Foata normal form. 42/2580 useless extension candidates. Maximal degree in co-relation 17898. Up to 1372 conditions per place. [2020-10-16 05:08:10,572 INFO L132 encePairwiseOnDemand]: 158/171 looper letters, 132 selfloop transitions, 46 changer transitions 77/264 dead transitions. [2020-10-16 05:08:10,572 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 264 transitions, 3982 flow [2020-10-16 05:08:10,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-16 05:08:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-16 05:08:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1815 transitions. [2020-10-16 05:08:10,576 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5896686159844055 [2020-10-16 05:08:10,576 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1815 transitions. [2020-10-16 05:08:10,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1815 transitions. [2020-10-16 05:08:10,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:10,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1815 transitions. [2020-10-16 05:08:10,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-16 05:08:10,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-16 05:08:10,582 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-16 05:08:10,582 INFO L185 Difference]: Start difference. First operand has 127 places, 171 transitions, 2408 flow. Second operand 18 states and 1815 transitions. [2020-10-16 05:08:10,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 264 transitions, 3982 flow [2020-10-16 05:08:10,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 264 transitions, 3663 flow, removed 143 selfloop flow, removed 7 redundant places. [2020-10-16 05:08:10,722 INFO L241 Difference]: Finished difference. Result has 144 places, 179 transitions, 2430 flow [2020-10-16 05:08:10,722 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=2194, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2430, PETRI_PLACES=144, PETRI_TRANSITIONS=179} [2020-10-16 05:08:10,722 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 109 predicate places. [2020-10-16 05:08:10,723 INFO L481 AbstractCegarLoop]: Abstraction has has 144 places, 179 transitions, 2430 flow [2020-10-16 05:08:10,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 05:08:10,723 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:10,723 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] [2020-10-16 05:08:10,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-16 05:08:10,723 INFO L429 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:10,723 INFO L82 PathProgramCache]: Analyzing trace with hash 876319935, now seen corresponding path program 14 times [2020-10-16 05:08:10,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:10,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252659718] [2020-10-16 05:08:10,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:11,128 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2020-10-16 05:08:11,290 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2020-10-16 05:08:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:08:11,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252659718] [2020-10-16 05:08:11,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:11,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:08:11,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119913465] [2020-10-16 05:08:11,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:08:11,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:11,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:08:11,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:08:11,798 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 171 [2020-10-16 05:08:11,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 179 transitions, 2430 flow. Second operand 14 states. [2020-10-16 05:08:11,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:11,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 171 [2020-10-16 05:08:11,798 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:13,776 INFO L129 PetriNetUnfolder]: 1120/2368 cut-off events. [2020-10-16 05:08:13,777 INFO L130 PetriNetUnfolder]: For 21360/21440 co-relation queries the response was YES. [2020-10-16 05:08:13,787 INFO L80 FinitePrefix]: Finished finitePrefix Result has 16779 conditions, 2368 events. 1120/2368 cut-off events. For 21360/21440 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 18191 event pairs, 28 based on Foata normal form. 35/2398 useless extension candidates. Maximal degree in co-relation 16720. Up to 1017 conditions per place. [2020-10-16 05:08:13,791 INFO L132 encePairwiseOnDemand]: 158/171 looper letters, 91 selfloop transitions, 97 changer transitions 71/268 dead transitions. [2020-10-16 05:08:13,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 268 transitions, 4095 flow [2020-10-16 05:08:13,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:08:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:08:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1198 transitions. [2020-10-16 05:08:13,793 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5389113810166442 [2020-10-16 05:08:13,793 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1198 transitions. [2020-10-16 05:08:13,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1198 transitions. [2020-10-16 05:08:13,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:13,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1198 transitions. [2020-10-16 05:08:13,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:08:13,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:08:13,796 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:08:13,796 INFO L185 Difference]: Start difference. First operand has 144 places, 179 transitions, 2430 flow. Second operand 13 states and 1198 transitions. [2020-10-16 05:08:13,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 268 transitions, 4095 flow [2020-10-16 05:08:13,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 268 transitions, 3914 flow, removed 60 selfloop flow, removed 12 redundant places. [2020-10-16 05:08:13,887 INFO L241 Difference]: Finished difference. Result has 145 places, 178 transitions, 2690 flow [2020-10-16 05:08:13,888 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=2282, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2690, PETRI_PLACES=145, PETRI_TRANSITIONS=178} [2020-10-16 05:08:13,888 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 110 predicate places. [2020-10-16 05:08:13,888 INFO L481 AbstractCegarLoop]: Abstraction has has 145 places, 178 transitions, 2690 flow [2020-10-16 05:08:13,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:08:13,888 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:13,888 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] [2020-10-16 05:08:13,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-16 05:08:13,889 INFO L429 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:13,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:13,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1490631141, now seen corresponding path program 15 times [2020-10-16 05:08:13,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:13,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996962278] [2020-10-16 05:08:13,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:08:14,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996962278] [2020-10-16 05:08:14,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:14,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:08:14,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780057720] [2020-10-16 05:08:14,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:08:14,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:14,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:08:14,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:08:14,150 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 171 [2020-10-16 05:08:14,151 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 178 transitions, 2690 flow. Second operand 7 states. [2020-10-16 05:08:14,152 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:14,152 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 171 [2020-10-16 05:08:14,152 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:14,718 INFO L129 PetriNetUnfolder]: 293/832 cut-off events. [2020-10-16 05:08:14,718 INFO L130 PetriNetUnfolder]: For 10939/11102 co-relation queries the response was YES. [2020-10-16 05:08:14,725 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6411 conditions, 832 events. 293/832 cut-off events. For 10939/11102 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5986 event pairs, 0 based on Foata normal form. 146/977 useless extension candidates. Maximal degree in co-relation 6359. Up to 375 conditions per place. [2020-10-16 05:08:14,727 INFO L132 encePairwiseOnDemand]: 163/171 looper letters, 88 selfloop transitions, 13 changer transitions 30/181 dead transitions. [2020-10-16 05:08:14,727 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 181 transitions, 2959 flow [2020-10-16 05:08:14,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:08:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:08:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 757 transitions. [2020-10-16 05:08:14,730 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6324143692564745 [2020-10-16 05:08:14,730 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 757 transitions. [2020-10-16 05:08:14,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 757 transitions. [2020-10-16 05:08:14,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:14,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 757 transitions. [2020-10-16 05:08:14,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:08:14,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:08:14,732 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:08:14,733 INFO L185 Difference]: Start difference. First operand has 145 places, 178 transitions, 2690 flow. Second operand 7 states and 757 transitions. [2020-10-16 05:08:14,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 181 transitions, 2959 flow [2020-10-16 05:08:14,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 181 transitions, 2810 flow, removed 42 selfloop flow, removed 7 redundant places. [2020-10-16 05:08:14,811 INFO L241 Difference]: Finished difference. Result has 144 places, 150 transitions, 2188 flow [2020-10-16 05:08:14,812 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=2547, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2188, PETRI_PLACES=144, PETRI_TRANSITIONS=150} [2020-10-16 05:08:14,812 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 109 predicate places. [2020-10-16 05:08:14,812 INFO L481 AbstractCegarLoop]: Abstraction has has 144 places, 150 transitions, 2188 flow [2020-10-16 05:08:14,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:08:14,812 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:14,812 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] [2020-10-16 05:08:14,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-16 05:08:14,812 INFO L429 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:14,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:14,813 INFO L82 PathProgramCache]: Analyzing trace with hash -91473579, now seen corresponding path program 16 times [2020-10-16 05:08:14,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:14,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984822886] [2020-10-16 05:08:14,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:14,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:08:14,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984822886] [2020-10-16 05:08:14,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:14,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:08:14,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915161501] [2020-10-16 05:08:14,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:08:14,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:14,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:08:14,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:08:14,970 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 171 [2020-10-16 05:08:14,971 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 150 transitions, 2188 flow. Second operand 7 states. [2020-10-16 05:08:14,971 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:14,971 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 171 [2020-10-16 05:08:14,971 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:15,309 INFO L129 PetriNetUnfolder]: 128/343 cut-off events. [2020-10-16 05:08:15,310 INFO L130 PetriNetUnfolder]: For 4361/4418 co-relation queries the response was YES. [2020-10-16 05:08:15,312 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 343 events. 128/343 cut-off events. For 4361/4418 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1724 event pairs, 13 based on Foata normal form. 51/394 useless extension candidates. Maximal degree in co-relation 2560. Up to 125 conditions per place. [2020-10-16 05:08:15,313 INFO L132 encePairwiseOnDemand]: 161/171 looper letters, 19 selfloop transitions, 63 changer transitions 28/157 dead transitions. [2020-10-16 05:08:15,313 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 157 transitions, 2485 flow [2020-10-16 05:08:15,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:08:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:08:15,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 886 transitions. [2020-10-16 05:08:15,315 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6476608187134503 [2020-10-16 05:08:15,315 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 886 transitions. [2020-10-16 05:08:15,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 886 transitions. [2020-10-16 05:08:15,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:15,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 886 transitions. [2020-10-16 05:08:15,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:08:15,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:08:15,318 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:08:15,318 INFO L185 Difference]: Start difference. First operand has 144 places, 150 transitions, 2188 flow. Second operand 8 states and 886 transitions. [2020-10-16 05:08:15,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 157 transitions, 2485 flow [2020-10-16 05:08:15,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 157 transitions, 2266 flow, removed 37 selfloop flow, removed 23 redundant places. [2020-10-16 05:08:15,336 INFO L241 Difference]: Finished difference. Result has 125 places, 129 transitions, 1783 flow [2020-10-16 05:08:15,336 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1974, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1783, PETRI_PLACES=125, PETRI_TRANSITIONS=129} [2020-10-16 05:08:15,336 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 90 predicate places. [2020-10-16 05:08:15,337 INFO L481 AbstractCegarLoop]: Abstraction has has 125 places, 129 transitions, 1783 flow [2020-10-16 05:08:15,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:08:15,337 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:15,337 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] [2020-10-16 05:08:15,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-16 05:08:15,337 INFO L429 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:15,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:15,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1448583773, now seen corresponding path program 17 times [2020-10-16 05:08:15,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:15,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197865829] [2020-10-16 05:08:15,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:15,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:08:15,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197865829] [2020-10-16 05:08:15,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:15,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 05:08:15,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744675490] [2020-10-16 05:08:15,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 05:08:15,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:15,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 05:08:15,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-16 05:08:15,891 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 171 [2020-10-16 05:08:15,892 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 129 transitions, 1783 flow. Second operand 12 states. [2020-10-16 05:08:15,892 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:15,892 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 171 [2020-10-16 05:08:15,893 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:16,890 INFO L129 PetriNetUnfolder]: 202/522 cut-off events. [2020-10-16 05:08:16,890 INFO L130 PetriNetUnfolder]: For 6092/6191 co-relation queries the response was YES. [2020-10-16 05:08:16,893 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3576 conditions, 522 events. 202/522 cut-off events. For 6092/6191 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3202 event pairs, 4 based on Foata normal form. 87/608 useless extension candidates. Maximal degree in co-relation 3542. Up to 211 conditions per place. [2020-10-16 05:08:16,894 INFO L132 encePairwiseOnDemand]: 163/171 looper letters, 52 selfloop transitions, 25 changer transitions 72/183 dead transitions. [2020-10-16 05:08:16,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 183 transitions, 2802 flow [2020-10-16 05:08:16,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 05:08:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 05:08:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1140 transitions. [2020-10-16 05:08:16,897 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2020-10-16 05:08:16,897 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1140 transitions. [2020-10-16 05:08:16,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1140 transitions. [2020-10-16 05:08:16,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:16,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1140 transitions. [2020-10-16 05:08:16,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 05:08:16,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 05:08:16,900 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 05:08:16,900 INFO L185 Difference]: Start difference. First operand has 125 places, 129 transitions, 1783 flow. Second operand 11 states and 1140 transitions. [2020-10-16 05:08:16,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 183 transitions, 2802 flow [2020-10-16 05:08:16,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 183 transitions, 2633 flow, removed 30 selfloop flow, removed 16 redundant places. [2020-10-16 05:08:16,932 INFO L241 Difference]: Finished difference. Result has 112 places, 97 transitions, 1308 flow [2020-10-16 05:08:16,932 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1685, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1308, PETRI_PLACES=112, PETRI_TRANSITIONS=97} [2020-10-16 05:08:16,932 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 77 predicate places. [2020-10-16 05:08:16,932 INFO L481 AbstractCegarLoop]: Abstraction has has 112 places, 97 transitions, 1308 flow [2020-10-16 05:08:16,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 05:08:16,933 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:16,933 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] [2020-10-16 05:08:16,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-16 05:08:16,933 INFO L429 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:16,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:16,933 INFO L82 PathProgramCache]: Analyzing trace with hash 867976331, now seen corresponding path program 18 times [2020-10-16 05:08:16,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:16,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302364331] [2020-10-16 05:08:16,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:08:16,997 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:08:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:08:17,065 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:08:17,108 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 05:08:17,108 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 05:08:17,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-16 05:08:17,134 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,134 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,135 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,135 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,135 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,135 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,136 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,136 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,136 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,137 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,137 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,137 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,137 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,137 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,137 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,138 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,138 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,138 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,138 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,138 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,139 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,139 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,139 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,139 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,140 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,140 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,140 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,140 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,140 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,140 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,141 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,141 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,141 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,141 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,141 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,141 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,142 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,142 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,142 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,143 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,143 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,143 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,143 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,143 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,143 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,144 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,144 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,144 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,145 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,145 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,145 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,145 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,145 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,146 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,146 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,146 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,146 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,146 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,146 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,146 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,147 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,147 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,147 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,147 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,147 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,147 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,148 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,148 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,148 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,148 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,148 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,148 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,148 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,149 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,149 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,149 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,149 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,149 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,149 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,149 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,151 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,151 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,151 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,151 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,151 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,152 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,152 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,152 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,152 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,152 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,152 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,153 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,153 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,153 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,153 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,153 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,153 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,153 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,154 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,154 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,154 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,154 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,154 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,154 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,155 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,155 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,155 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,155 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,155 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,155 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,155 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,156 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,156 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,156 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,156 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:08:17,156 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:17,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:08:17 BasicIcfg [2020-10-16 05:08:17,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 05:08:17,235 INFO L168 Benchmark]: Toolchain (without parser) took 45471.32 ms. Allocated memory was 244.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 200.0 MB in the beginning and 564.7 MB in the end (delta: -364.7 MB). Peak memory consumption was 850.6 MB. Max. memory is 14.2 GB. [2020-10-16 05:08:17,235 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 244.8 MB. Free memory is still 221.2 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 05:08:17,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 864.86 ms. Allocated memory was 244.8 MB in the beginning and 294.6 MB in the end (delta: 49.8 MB). Free memory was 200.0 MB in the beginning and 240.2 MB in the end (delta: -40.3 MB). Peak memory consumption was 29.8 MB. Max. memory is 14.2 GB. [2020-10-16 05:08:17,236 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.63 ms. Allocated memory is still 294.6 MB. Free memory was 240.2 MB in the beginning and 237.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:08:17,236 INFO L168 Benchmark]: Boogie Preprocessor took 51.03 ms. Allocated memory is still 294.6 MB. Free memory was 237.7 MB in the beginning and 235.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:08:17,237 INFO L168 Benchmark]: RCFGBuilder took 4000.13 ms. Allocated memory was 294.6 MB in the beginning and 442.0 MB in the end (delta: 147.3 MB). Free memory was 235.2 MB in the beginning and 401.7 MB in the end (delta: -166.5 MB). Peak memory consumption was 170.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:08:17,238 INFO L168 Benchmark]: TraceAbstraction took 40481.91 ms. Allocated memory was 442.0 MB in the beginning and 1.5 GB in the end (delta: 1.0 GB). Free memory was 401.7 MB in the beginning and 564.7 MB in the end (delta: -163.0 MB). Peak memory consumption was 855.2 MB. Max. memory is 14.2 GB. [2020-10-16 05:08:17,240 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.24 ms. Allocated memory is still 244.8 MB. Free memory is still 221.2 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 864.86 ms. Allocated memory was 244.8 MB in the beginning and 294.6 MB in the end (delta: 49.8 MB). Free memory was 200.0 MB in the beginning and 240.2 MB in the end (delta: -40.3 MB). Peak memory consumption was 29.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 67.63 ms. Allocated memory is still 294.6 MB. Free memory was 240.2 MB in the beginning and 237.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 51.03 ms. Allocated memory is still 294.6 MB. Free memory was 237.7 MB in the beginning and 235.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 4000.13 ms. Allocated memory was 294.6 MB in the beginning and 442.0 MB in the end (delta: 147.3 MB). Free memory was 235.2 MB in the beginning and 401.7 MB in the end (delta: -166.5 MB). Peak memory consumption was 170.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 40481.91 ms. Allocated memory was 442.0 MB in the beginning and 1.5 GB in the end (delta: 1.0 GB). Free memory was 401.7 MB in the beginning and 564.7 MB in the end (delta: -163.0 MB). Peak memory consumption was 855.2 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 972 VarBasedMoverChecksPositive, 65 VarBasedMoverChecksNegative, 24 SemBasedMoverChecksPositive, 41 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 94 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.3s, 99 PlacesBefore, 35 PlacesAfterwards, 91 TransitionsBefore, 26 TransitionsAfterwards, 1740 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 5549 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p2_EBX = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L712] 0 _Bool y$flush_delayed; [L713] 0 int y$mem_tmp; [L714] 0 _Bool y$r_buff0_thd0; [L715] 0 _Bool y$r_buff0_thd1; [L716] 0 _Bool y$r_buff0_thd2; [L717] 0 _Bool y$r_buff0_thd3; [L718] 0 _Bool y$r_buff1_thd0; [L719] 0 _Bool y$r_buff1_thd1; [L720] 0 _Bool y$r_buff1_thd2; [L721] 0 _Bool y$r_buff1_thd3; [L722] 0 _Bool y$read_delayed; [L723] 0 int *y$read_delayed_var; [L724] 0 int y$w_buff0; [L725] 0 _Bool y$w_buff0_used; [L726] 0 int y$w_buff1; [L727] 0 _Bool y$w_buff1_used; [L728] 0 _Bool weak$$choice0; [L729] 0 _Bool weak$$choice2; [L843] 0 pthread_t t2333; [L844] FCALL, FORK 0 pthread_create(&t2333, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L845] 0 pthread_t t2334; [L846] FCALL, FORK 0 pthread_create(&t2334, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L847] 0 pthread_t t2335; [L848] FCALL, FORK 0 pthread_create(&t2335, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 2 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L8] COND FALSE 2 !(!expression) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L782] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 y$flush_delayed = weak$$choice2 [L808] 3 y$mem_tmp = y [L809] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L809] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L810] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L811] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L812] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L812] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L812] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L814] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = y [L817] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L817] 3 y = y$flush_delayed ? y$mem_tmp : y [L818] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L733] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L821] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L821] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L821] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L821] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L822] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L823] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L824] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L825] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L743] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L744] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L745] 1 y$flush_delayed = weak$$choice2 [L746] 1 y$mem_tmp = y [L747] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 [L747] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L748] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L749] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L749] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L750] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L750] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L751] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L752] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L753] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L753] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L754] 1 __unbuffered_p0_EAX = y [L755] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L755] 1 y = y$flush_delayed ? y$mem_tmp : y [L756] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L761] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L762] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L763] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L763] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L854] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L868] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L869] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L869] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L870] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 93 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: 40.1s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 25.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 223 SDtfs, 427 SDslu, 569 SDs, 0 SdLazy, 4250 SolverSat, 855 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 363 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2690occurred in iteration=27, 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, 1.4s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 606 NumberOfCodeBlocks, 606 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 553 ConstructedInterpolants, 0 QuantifiedInterpolants, 152912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...