/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:40:47,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:40:47,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:40:47,930 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:40:47,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:40:47,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:40:47,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:40:47,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:40:47,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:40:47,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:40:47,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:40:47,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:40:47,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:40:47,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:40:47,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:40:47,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:40:47,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:40:47,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:40:47,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:40:47,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:40:47,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:40:47,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:40:47,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:40:47,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:40:47,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:40:47,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:40:47,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:40:47,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:40:47,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:40:47,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:40:47,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:40:47,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:40:47,957 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:40:47,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:40:47,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:40:47,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:40:47,960 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:40:47,960 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:40:47,960 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:40:47,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:40:47,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:40:47,963 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.epf [2020-10-16 01:40:47,995 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:40:47,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:40:47,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:40:47,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:40:47,998 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:40:47,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:40:47,999 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:40:47,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:40:47,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:40:47,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:40:48,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:40:48,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:40:48,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:40:48,000 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:40:48,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:40:48,000 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:40:48,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:40:48,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:40:48,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:40:48,001 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:40:48,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:40:48,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:40:48,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:40:48,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:40:48,004 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:40:48,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:40:48,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:40:48,005 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:40:48,005 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:40:48,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:40:48,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:40:48,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:40:48,362 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:40:48,362 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:40:48,363 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i [2020-10-16 01:40:48,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7894517a9/1d07afb5cb4f45f68f77b31b397c9134/FLAG255f372aa [2020-10-16 01:40:48,980 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:40:48,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i [2020-10-16 01:40:48,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7894517a9/1d07afb5cb4f45f68f77b31b397c9134/FLAG255f372aa [2020-10-16 01:40:49,393 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7894517a9/1d07afb5cb4f45f68f77b31b397c9134 [2020-10-16 01:40:49,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:40:49,406 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:40:49,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:40:49,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:40:49,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:40:49,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:40:49" (1/1) ... [2020-10-16 01:40:49,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cb2ea98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:49, skipping insertion in model container [2020-10-16 01:40:49,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:40:49" (1/1) ... [2020-10-16 01:40:49,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:40:49,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:40:50,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:40:50,088 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:40:50,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:40:50,266 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:40:50,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:50 WrapperNode [2020-10-16 01:40:50,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:40:50,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:40:50,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:40:50,268 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:40:50,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:50" (1/1) ... [2020-10-16 01:40:50,300 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:50" (1/1) ... [2020-10-16 01:40:50,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:40:50,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:40:50,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:40:50,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:40:50,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:50" (1/1) ... [2020-10-16 01:40:50,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:50" (1/1) ... [2020-10-16 01:40:50,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:50" (1/1) ... [2020-10-16 01:40:50,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:50" (1/1) ... [2020-10-16 01:40:50,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:50" (1/1) ... [2020-10-16 01:40:50,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:50" (1/1) ... [2020-10-16 01:40:50,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:50" (1/1) ... [2020-10-16 01:40:50,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:40:50,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:40:50,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:40:50,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:40:50,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:40:50,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:40:50,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:40:50,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:40:50,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:40:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:40:50,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:40:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:40:50,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:40:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:40:50,457 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:40:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:40:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:40:50,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:40:50,459 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 01:40:52,657 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:40:52,658 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:40:52,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:40:52 BoogieIcfgContainer [2020-10-16 01:40:52,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:40:52,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:40:52,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:40:52,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:40:52,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:40:49" (1/3) ... [2020-10-16 01:40:52,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17af33ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:40:52, skipping insertion in model container [2020-10-16 01:40:52,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:50" (2/3) ... [2020-10-16 01:40:52,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17af33ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:40:52, skipping insertion in model container [2020-10-16 01:40:52,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:40:52" (3/3) ... [2020-10-16 01:40:52,669 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc.i [2020-10-16 01:40:52,681 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:40:52,689 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:40:52,690 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:40:52,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,720 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,720 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,721 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,721 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,724 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,724 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,727 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,727 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,735 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,736 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,737 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,740 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,741 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,745 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,745 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:52,765 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 01:40:52,788 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:40:52,788 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:40:52,788 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:40:52,788 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:40:52,789 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:40:52,789 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:40:52,789 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:40:52,789 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:40:52,804 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-16 01:40:52,852 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-16 01:40:52,853 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:40:52,857 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 01:40:52,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 90 transitions, 195 flow [2020-10-16 01:40:52,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 87 transitions, 183 flow [2020-10-16 01:40:52,867 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:40:52,870 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 87 transitions, 183 flow [2020-10-16 01:40:52,873 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 87 transitions, 183 flow [2020-10-16 01:40:52,873 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 95 places, 87 transitions, 183 flow [2020-10-16 01:40:52,898 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-16 01:40:52,899 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:40:52,900 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 01:40:52,903 INFO L117 LiptonReduction]: Number of co-enabled transitions 1560 [2020-10-16 01:40:53,727 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:40:53,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:40:53,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:53,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:53,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:53,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:40:53,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:53,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:53,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:53,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:40:53,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:40:53,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:40:53,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:40:54,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:40:54,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:40:54,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:40:54,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:40:54,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:40:54,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:40:54,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:40:54,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:40:54,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:40:54,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:40:54,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:40:54,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:40:54,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:40:54,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:40:54,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:40:54,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:40:54,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:40:54,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:40:54,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:40:54,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:40:54,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:54,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:40:54,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:40:54,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:40:54,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:40:54,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:40:54,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:40:54,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:40:54,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:40:54,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:40:54,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:40:54,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:40:54,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:54,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:40:54,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:54,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:40:54,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:40:54,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:40:54,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:40:54,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:54,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:40:54,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:40:54,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:40:54,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:40:54,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:40:54,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:54,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:54,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:40:54,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:40:54,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:40:54,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,055 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:40:55,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:40:55,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:40:55,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:55,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:55,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:55,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:40:55,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:55,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:40:55,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:55,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:40:55,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:40:55,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:40:55,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:40:55,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:40:55,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:55,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:40:55,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:40:55,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:40:55,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:40:55,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:55,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:40:55,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:55,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:40:55,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:40:55,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-16 01:40:55,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:40:55,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:40:55,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:55,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-16 01:40:55,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:55,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:40:55,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:40:55,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:40:55,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:40:55,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:55,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:40:55,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:55,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:40:55,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:55,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:40:55,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:55,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:40:55,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:40:55,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-16 01:40:55,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:40:55,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:40:55,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:40:55,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:55,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:55,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:55,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:40:55,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:55,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:40:55,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:55,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:40:55,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:40:55,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:40:55,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:40:55,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:40:55,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:55,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:40:55,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:40:55,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:40:55,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:40:55,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:55,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:40:55,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:40:55,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:40:55,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:40:55,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:40:55,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:55,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:55,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:55,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:40:55,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:55,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:40:55,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:55,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:40:55,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:40:55,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:40:55,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:55,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:40:55,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:56,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:40:56,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:56,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:56,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:56,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:40:56,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:40:56,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:40:56,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:56,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:40:56,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:40:56,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:56,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:56,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:56,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:56,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:56,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:40:56,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:56,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:40:56,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:40:56,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:40:56,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:40:56,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:56,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:40:56,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:56,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:40:56,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:56,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:40:56,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:56,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:56,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:56,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:40:56,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:56,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:56,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:58,049 WARN L193 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 229 DAG size of output: 189 [2020-10-16 01:40:58,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 01:40:58,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:58,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:40:58,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:40:59,055 WARN L193 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 108 [2020-10-16 01:40:59,448 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 01:40:59,553 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-16 01:41:00,780 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 243 DAG size of output: 203 [2020-10-16 01:41:00,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 01:41:00,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:00,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:00,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,891 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2020-10-16 01:41:01,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:01,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:01,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:01,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:01,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:01,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:01,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:01,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:01,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:01,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:01,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:01,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:01,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:01,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:02,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:02,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:02,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:02,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:02,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:02,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:02,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:02,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:02,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:41:02,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:02,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:02,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:02,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:02,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:02,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:02,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:02,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:02,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:02,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:02,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:02,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:02,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:02,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:02,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:02,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:02,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:02,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:02,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:02,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:02,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:02,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:02,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:02,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:02,254 INFO L132 LiptonReduction]: Checked pairs total: 3946 [2020-10-16 01:41:02,255 INFO L134 LiptonReduction]: Total number of compositions: 78 [2020-10-16 01:41:02,258 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9393 [2020-10-16 01:41:02,263 INFO L129 PetriNetUnfolder]: 0/3 cut-off events. [2020-10-16 01:41:02,263 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:41:02,264 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:02,265 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 01:41:02,265 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:02,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:02,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1035167, now seen corresponding path program 1 times [2020-10-16 01:41:02,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:02,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648776018] [2020-10-16 01:41:02,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:41:02,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648776018] [2020-10-16 01:41:02,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:02,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:41:02,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130200750] [2020-10-16 01:41:02,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:41:02,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:02,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:41:02,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:41:02,523 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2020-10-16 01:41:02,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states. [2020-10-16 01:41:02,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:02,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2020-10-16 01:41:02,528 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:02,629 INFO L129 PetriNetUnfolder]: 69/141 cut-off events. [2020-10-16 01:41:02,629 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:41:02,630 INFO L80 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 141 events. 69/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 620 event pairs, 54 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 259. Up to 89 conditions per place. [2020-10-16 01:41:02,632 INFO L132 encePairwiseOnDemand]: 165/168 looper letters, 9 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2020-10-16 01:41:02,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 87 flow [2020-10-16 01:41:02,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:41:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:41:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2020-10-16 01:41:02,651 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8313492063492064 [2020-10-16 01:41:02,652 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2020-10-16 01:41:02,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2020-10-16 01:41:02,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:02,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2020-10-16 01:41:02,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:41:02,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:41:02,670 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:41:02,673 INFO L185 Difference]: Start difference. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states and 419 transitions. [2020-10-16 01:41:02,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 87 flow [2020-10-16 01:41:02,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 84 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:41:02,679 INFO L241 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2020-10-16 01:41:02,682 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2020-10-16 01:41:02,683 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2020-10-16 01:41:02,683 INFO L481 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2020-10-16 01:41:02,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:41:02,683 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:02,684 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:02,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:41:02,684 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:02,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:02,685 INFO L82 PathProgramCache]: Analyzing trace with hash 793045883, now seen corresponding path program 1 times [2020-10-16 01:41:02,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:02,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605521543] [2020-10-16 01:41:02,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:02,830 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 01:41:02,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605521543] [2020-10-16 01:41:02,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:02,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:41:02,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153451448] [2020-10-16 01:41:02,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:41:02,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:02,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:41:02,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:41:02,835 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 168 [2020-10-16 01:41:02,836 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states. [2020-10-16 01:41:02,836 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:02,836 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 168 [2020-10-16 01:41:02,836 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:02,859 INFO L129 PetriNetUnfolder]: 12/62 cut-off events. [2020-10-16 01:41:02,860 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:41:02,860 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 62 events. 12/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 208 event pairs, 6 based on Foata normal form. 1/59 useless extension candidates. Maximal degree in co-relation 90. Up to 25 conditions per place. [2020-10-16 01:41:02,861 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 5 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2020-10-16 01:41:02,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 23 transitions, 72 flow [2020-10-16 01:41:02,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:41:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:41:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2020-10-16 01:41:02,864 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8630952380952381 [2020-10-16 01:41:02,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2020-10-16 01:41:02,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2020-10-16 01:41:02,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:02,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2020-10-16 01:41:02,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:41:02,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:41:02,868 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:41:02,869 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 435 transitions. [2020-10-16 01:41:02,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 23 transitions, 72 flow [2020-10-16 01:41:02,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 23 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:41:02,870 INFO L241 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2020-10-16 01:41:02,870 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2020-10-16 01:41:02,871 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2020-10-16 01:41:02,871 INFO L481 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2020-10-16 01:41:02,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:41:02,872 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:02,872 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:02,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:41:02,872 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:02,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:02,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1657178972, now seen corresponding path program 1 times [2020-10-16 01:41:02,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:02,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743772207] [2020-10-16 01:41:02,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:03,009 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 01:41:03,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743772207] [2020-10-16 01:41:03,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:03,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:41:03,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877688856] [2020-10-16 01:41:03,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:41:03,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:03,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:41:03,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:41:03,014 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 168 [2020-10-16 01:41:03,015 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 flow. Second operand 4 states. [2020-10-16 01:41:03,015 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:03,015 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 168 [2020-10-16 01:41:03,015 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:03,115 INFO L129 PetriNetUnfolder]: 112/236 cut-off events. [2020-10-16 01:41:03,115 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-16 01:41:03,117 INFO L80 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 236 events. 112/236 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1104 event pairs, 56 based on Foata normal form. 2/222 useless extension candidates. Maximal degree in co-relation 455. Up to 164 conditions per place. [2020-10-16 01:41:03,119 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 9 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2020-10-16 01:41:03,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 97 flow [2020-10-16 01:41:03,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:41:03,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:41:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2020-10-16 01:41:03,122 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7638888888888888 [2020-10-16 01:41:03,122 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2020-10-16 01:41:03,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2020-10-16 01:41:03,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:03,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2020-10-16 01:41:03,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:41:03,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:41:03,125 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:41:03,125 INFO L185 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 3 states and 385 transitions. [2020-10-16 01:41:03,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 97 flow [2020-10-16 01:41:03,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:41:03,127 INFO L241 Difference]: Finished difference. Result has 32 places, 24 transitions, 81 flow [2020-10-16 01:41:03,127 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2020-10-16 01:41:03,127 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2020-10-16 01:41:03,127 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 81 flow [2020-10-16 01:41:03,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:41:03,128 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:03,128 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:03,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:41:03,128 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:03,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:03,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1907850104, now seen corresponding path program 1 times [2020-10-16 01:41:03,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:03,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719809499] [2020-10-16 01:41:03,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:03,227 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 01:41:03,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719809499] [2020-10-16 01:41:03,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:03,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:41:03,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166657221] [2020-10-16 01:41:03,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:41:03,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:03,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:41:03,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:41:03,230 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 168 [2020-10-16 01:41:03,231 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 81 flow. Second operand 3 states. [2020-10-16 01:41:03,231 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:03,231 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 168 [2020-10-16 01:41:03,231 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:03,261 INFO L129 PetriNetUnfolder]: 10/65 cut-off events. [2020-10-16 01:41:03,261 INFO L130 PetriNetUnfolder]: For 32/78 co-relation queries the response was YES. [2020-10-16 01:41:03,262 INFO L80 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 65 events. 10/65 cut-off events. For 32/78 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 279 event pairs, 5 based on Foata normal form. 4/65 useless extension candidates. Maximal degree in co-relation 130. Up to 19 conditions per place. [2020-10-16 01:41:03,262 INFO L132 encePairwiseOnDemand]: 165/168 looper letters, 6 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2020-10-16 01:41:03,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 103 flow [2020-10-16 01:41:03,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:41:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:41:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2020-10-16 01:41:03,265 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8611111111111112 [2020-10-16 01:41:03,265 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2020-10-16 01:41:03,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2020-10-16 01:41:03,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:03,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2020-10-16 01:41:03,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:41:03,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:41:03,268 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:41:03,268 INFO L185 Difference]: Start difference. First operand has 32 places, 24 transitions, 81 flow. Second operand 3 states and 434 transitions. [2020-10-16 01:41:03,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 103 flow [2020-10-16 01:41:03,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:41:03,271 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 89 flow [2020-10-16 01:41:03,271 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2020-10-16 01:41:03,271 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2020-10-16 01:41:03,271 INFO L481 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 89 flow [2020-10-16 01:41:03,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:41:03,272 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:03,272 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:03,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:41:03,272 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:03,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:03,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1907875028, now seen corresponding path program 1 times [2020-10-16 01:41:03,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:03,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805038567] [2020-10-16 01:41:03,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:03,324 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 01:41:03,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805038567] [2020-10-16 01:41:03,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:03,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:41:03,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898035686] [2020-10-16 01:41:03,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:41:03,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:03,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:41:03,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:41:03,328 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 168 [2020-10-16 01:41:03,328 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 89 flow. Second operand 3 states. [2020-10-16 01:41:03,328 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:03,328 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 168 [2020-10-16 01:41:03,328 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:03,344 INFO L129 PetriNetUnfolder]: 2/37 cut-off events. [2020-10-16 01:41:03,344 INFO L130 PetriNetUnfolder]: For 55/81 co-relation queries the response was YES. [2020-10-16 01:41:03,345 INFO L80 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 37 events. 2/37 cut-off events. For 55/81 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 105 event pairs, 0 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 68. Up to 9 conditions per place. [2020-10-16 01:41:03,345 INFO L132 encePairwiseOnDemand]: 165/168 looper letters, 1 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2020-10-16 01:41:03,345 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 24 transitions, 97 flow [2020-10-16 01:41:03,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:41:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:41:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2020-10-16 01:41:03,348 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8650793650793651 [2020-10-16 01:41:03,348 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2020-10-16 01:41:03,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2020-10-16 01:41:03,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:03,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2020-10-16 01:41:03,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:41:03,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:41:03,351 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:41:03,351 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 89 flow. Second operand 3 states and 436 transitions. [2020-10-16 01:41:03,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 24 transitions, 97 flow [2020-10-16 01:41:03,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 24 transitions, 92 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 01:41:03,353 INFO L241 Difference]: Finished difference. Result has 36 places, 24 transitions, 95 flow [2020-10-16 01:41:03,353 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2020-10-16 01:41:03,353 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2020-10-16 01:41:03,353 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 95 flow [2020-10-16 01:41:03,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:41:03,354 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:03,354 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:03,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:41:03,354 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:03,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash 165751114, now seen corresponding path program 1 times [2020-10-16 01:41:03,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:03,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260846339] [2020-10-16 01:41:03,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:03,455 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 01:41:03,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260846339] [2020-10-16 01:41:03,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:03,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:41:03,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985843754] [2020-10-16 01:41:03,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:41:03,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:03,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:41:03,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:41:03,458 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 168 [2020-10-16 01:41:03,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 95 flow. Second operand 4 states. [2020-10-16 01:41:03,465 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:03,465 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 168 [2020-10-16 01:41:03,465 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:03,569 INFO L129 PetriNetUnfolder]: 122/273 cut-off events. [2020-10-16 01:41:03,569 INFO L130 PetriNetUnfolder]: For 274/290 co-relation queries the response was YES. [2020-10-16 01:41:03,570 INFO L80 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 273 events. 122/273 cut-off events. For 274/290 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1391 event pairs, 57 based on Foata normal form. 2/256 useless extension candidates. Maximal degree in co-relation 628. Up to 200 conditions per place. [2020-10-16 01:41:03,572 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 9 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2020-10-16 01:41:03,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 28 transitions, 131 flow [2020-10-16 01:41:03,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:41:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:41:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2020-10-16 01:41:03,575 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7698412698412699 [2020-10-16 01:41:03,575 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2020-10-16 01:41:03,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2020-10-16 01:41:03,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:03,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2020-10-16 01:41:03,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:41:03,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:41:03,578 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:41:03,578 INFO L185 Difference]: Start difference. First operand has 36 places, 24 transitions, 95 flow. Second operand 3 states and 388 transitions. [2020-10-16 01:41:03,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 28 transitions, 131 flow [2020-10-16 01:41:03,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 125 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:41:03,580 INFO L241 Difference]: Finished difference. Result has 37 places, 26 transitions, 113 flow [2020-10-16 01:41:03,581 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2020-10-16 01:41:03,581 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2020-10-16 01:41:03,581 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 113 flow [2020-10-16 01:41:03,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:41:03,581 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:03,582 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:03,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:41:03,582 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:03,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:03,582 INFO L82 PathProgramCache]: Analyzing trace with hash -986137752, now seen corresponding path program 1 times [2020-10-16 01:41:03,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:03,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516552258] [2020-10-16 01:41:03,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:03,656 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 01:41:03,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516552258] [2020-10-16 01:41:03,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:03,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:41:03,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213866872] [2020-10-16 01:41:03,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:41:03,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:03,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:41:03,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:41:03,659 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 168 [2020-10-16 01:41:03,660 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 113 flow. Second operand 5 states. [2020-10-16 01:41:03,660 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:03,660 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 168 [2020-10-16 01:41:03,660 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:03,781 INFO L129 PetriNetUnfolder]: 131/282 cut-off events. [2020-10-16 01:41:03,781 INFO L130 PetriNetUnfolder]: For 462/485 co-relation queries the response was YES. [2020-10-16 01:41:03,783 INFO L80 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 282 events. 131/282 cut-off events. For 462/485 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1354 event pairs, 39 based on Foata normal form. 5/268 useless extension candidates. Maximal degree in co-relation 739. Up to 206 conditions per place. [2020-10-16 01:41:03,785 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 10 selfloop transitions, 7 changer transitions 0/32 dead transitions. [2020-10-16 01:41:03,785 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 161 flow [2020-10-16 01:41:03,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:41:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:41:03,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2020-10-16 01:41:03,788 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7455357142857143 [2020-10-16 01:41:03,788 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2020-10-16 01:41:03,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2020-10-16 01:41:03,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:03,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2020-10-16 01:41:03,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:41:03,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:41:03,791 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:41:03,791 INFO L185 Difference]: Start difference. First operand has 37 places, 26 transitions, 113 flow. Second operand 4 states and 501 transitions. [2020-10-16 01:41:03,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 161 flow [2020-10-16 01:41:03,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:41:03,794 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 144 flow [2020-10-16 01:41:03,795 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2020-10-16 01:41:03,795 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2020-10-16 01:41:03,795 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 144 flow [2020-10-16 01:41:03,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:41:03,795 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:03,795 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:03,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:41:03,796 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:03,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:03,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1022448645, now seen corresponding path program 1 times [2020-10-16 01:41:03,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:03,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435921525] [2020-10-16 01:41:03,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:03,856 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 01:41:03,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435921525] [2020-10-16 01:41:03,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:03,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:41:03,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911903788] [2020-10-16 01:41:03,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:41:03,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:03,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:41:03,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:41:03,859 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 168 [2020-10-16 01:41:03,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 144 flow. Second operand 4 states. [2020-10-16 01:41:03,860 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:03,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 168 [2020-10-16 01:41:03,860 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:03,911 INFO L129 PetriNetUnfolder]: 50/202 cut-off events. [2020-10-16 01:41:03,911 INFO L130 PetriNetUnfolder]: For 524/600 co-relation queries the response was YES. [2020-10-16 01:41:03,913 INFO L80 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 202 events. 50/202 cut-off events. For 524/600 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1186 event pairs, 13 based on Foata normal form. 17/208 useless extension candidates. Maximal degree in co-relation 507. Up to 90 conditions per place. [2020-10-16 01:41:03,914 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 4 selfloop transitions, 5 changer transitions 3/33 dead transitions. [2020-10-16 01:41:03,914 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 188 flow [2020-10-16 01:41:03,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:41:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:41:03,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2020-10-16 01:41:03,917 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8377976190476191 [2020-10-16 01:41:03,917 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 563 transitions. [2020-10-16 01:41:03,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 563 transitions. [2020-10-16 01:41:03,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:03,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 563 transitions. [2020-10-16 01:41:03,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:41:03,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:41:03,921 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:41:03,921 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 144 flow. Second operand 4 states and 563 transitions. [2020-10-16 01:41:03,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 188 flow [2020-10-16 01:41:03,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 33 transitions, 177 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:41:03,924 INFO L241 Difference]: Finished difference. Result has 42 places, 29 transitions, 149 flow [2020-10-16 01:41:03,925 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2020-10-16 01:41:03,925 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2020-10-16 01:41:03,925 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 149 flow [2020-10-16 01:41:03,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:41:03,925 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:03,925 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:03,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:41:03,926 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:03,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:03,926 INFO L82 PathProgramCache]: Analyzing trace with hash 843315768, now seen corresponding path program 1 times [2020-10-16 01:41:03,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:03,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508585401] [2020-10-16 01:41:03,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:03,977 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 01:41:03,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508585401] [2020-10-16 01:41:03,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:03,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:41:03,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509752773] [2020-10-16 01:41:03,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:41:03,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:03,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:41:03,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:41:03,980 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 168 [2020-10-16 01:41:03,980 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 149 flow. Second operand 5 states. [2020-10-16 01:41:03,980 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:03,980 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 168 [2020-10-16 01:41:03,981 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:04,110 INFO L129 PetriNetUnfolder]: 131/290 cut-off events. [2020-10-16 01:41:04,110 INFO L130 PetriNetUnfolder]: For 691/725 co-relation queries the response was YES. [2020-10-16 01:41:04,112 INFO L80 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 290 events. 131/290 cut-off events. For 691/725 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1442 event pairs, 50 based on Foata normal form. 4/282 useless extension candidates. Maximal degree in co-relation 891. Up to 191 conditions per place. [2020-10-16 01:41:04,114 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 13 selfloop transitions, 9 changer transitions 0/37 dead transitions. [2020-10-16 01:41:04,114 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 231 flow [2020-10-16 01:41:04,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:41:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:41:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 522 transitions. [2020-10-16 01:41:04,117 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7767857142857143 [2020-10-16 01:41:04,117 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 522 transitions. [2020-10-16 01:41:04,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 522 transitions. [2020-10-16 01:41:04,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:04,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 522 transitions. [2020-10-16 01:41:04,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:41:04,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:41:04,120 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:41:04,121 INFO L185 Difference]: Start difference. First operand has 42 places, 29 transitions, 149 flow. Second operand 4 states and 522 transitions. [2020-10-16 01:41:04,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 231 flow [2020-10-16 01:41:04,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 217 flow, removed 2 selfloop flow, removed 3 redundant places. [2020-10-16 01:41:04,124 INFO L241 Difference]: Finished difference. Result has 43 places, 33 transitions, 182 flow [2020-10-16 01:41:04,124 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2020-10-16 01:41:04,125 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2020-10-16 01:41:04,125 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 182 flow [2020-10-16 01:41:04,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:41:04,125 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:04,125 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:04,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:41:04,126 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:04,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:04,126 INFO L82 PathProgramCache]: Analyzing trace with hash 372998752, now seen corresponding path program 1 times [2020-10-16 01:41:04,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:04,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116659086] [2020-10-16 01:41:04,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:04,272 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 01:41:04,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116659086] [2020-10-16 01:41:04,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:04,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:41:04,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584711614] [2020-10-16 01:41:04,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:41:04,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:04,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:41:04,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:41:04,275 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 168 [2020-10-16 01:41:04,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 182 flow. Second operand 6 states. [2020-10-16 01:41:04,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:04,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 168 [2020-10-16 01:41:04,276 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:04,436 INFO L129 PetriNetUnfolder]: 126/280 cut-off events. [2020-10-16 01:41:04,436 INFO L130 PetriNetUnfolder]: For 659/707 co-relation queries the response was YES. [2020-10-16 01:41:04,437 INFO L80 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 280 events. 126/280 cut-off events. For 659/707 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1359 event pairs, 20 based on Foata normal form. 11/281 useless extension candidates. Maximal degree in co-relation 976. Up to 195 conditions per place. [2020-10-16 01:41:04,440 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 15 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2020-10-16 01:41:04,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 252 flow [2020-10-16 01:41:04,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:41:04,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:41:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2020-10-16 01:41:04,443 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7217261904761905 [2020-10-16 01:41:04,443 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 485 transitions. [2020-10-16 01:41:04,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 485 transitions. [2020-10-16 01:41:04,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:04,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 485 transitions. [2020-10-16 01:41:04,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:41:04,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:41:04,446 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:41:04,446 INFO L185 Difference]: Start difference. First operand has 43 places, 33 transitions, 182 flow. Second operand 4 states and 485 transitions. [2020-10-16 01:41:04,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 252 flow [2020-10-16 01:41:04,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 38 transitions, 241 flow, removed 3 selfloop flow, removed 1 redundant places. [2020-10-16 01:41:04,450 INFO L241 Difference]: Finished difference. Result has 46 places, 35 transitions, 209 flow [2020-10-16 01:41:04,450 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=209, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2020-10-16 01:41:04,451 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2020-10-16 01:41:04,451 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 209 flow [2020-10-16 01:41:04,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:41:04,451 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:04,451 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:04,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:41:04,451 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:04,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:04,452 INFO L82 PathProgramCache]: Analyzing trace with hash 841293948, now seen corresponding path program 2 times [2020-10-16 01:41:04,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:04,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937749420] [2020-10-16 01:41:04,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:04,515 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 01:41:04,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937749420] [2020-10-16 01:41:04,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:04,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:41:04,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322523861] [2020-10-16 01:41:04,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:41:04,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:04,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:41:04,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:41:04,518 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 168 [2020-10-16 01:41:04,518 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 209 flow. Second operand 5 states. [2020-10-16 01:41:04,518 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:04,519 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 168 [2020-10-16 01:41:04,519 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:04,645 INFO L129 PetriNetUnfolder]: 124/278 cut-off events. [2020-10-16 01:41:04,646 INFO L130 PetriNetUnfolder]: For 885/938 co-relation queries the response was YES. [2020-10-16 01:41:04,647 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 278 events. 124/278 cut-off events. For 885/938 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1359 event pairs, 46 based on Foata normal form. 5/273 useless extension candidates. Maximal degree in co-relation 1047. Up to 183 conditions per place. [2020-10-16 01:41:04,649 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 16 selfloop transitions, 11 changer transitions 0/42 dead transitions. [2020-10-16 01:41:04,649 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 312 flow [2020-10-16 01:41:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:41:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:41:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2020-10-16 01:41:04,652 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7648809523809523 [2020-10-16 01:41:04,652 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2020-10-16 01:41:04,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2020-10-16 01:41:04,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:04,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2020-10-16 01:41:04,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:41:04,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:41:04,656 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:41:04,656 INFO L185 Difference]: Start difference. First operand has 46 places, 35 transitions, 209 flow. Second operand 4 states and 514 transitions. [2020-10-16 01:41:04,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 312 flow [2020-10-16 01:41:04,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 300 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:41:04,660 INFO L241 Difference]: Finished difference. Result has 48 places, 38 transitions, 249 flow [2020-10-16 01:41:04,660 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2020-10-16 01:41:04,661 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2020-10-16 01:41:04,661 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 249 flow [2020-10-16 01:41:04,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:41:04,661 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:04,661 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:04,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:41:04,662 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:04,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:04,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1416194452, now seen corresponding path program 1 times [2020-10-16 01:41:04,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:04,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537742043] [2020-10-16 01:41:04,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:04,729 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 01:41:04,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537742043] [2020-10-16 01:41:04,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:04,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:41:04,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386548366] [2020-10-16 01:41:04,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:41:04,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:04,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:41:04,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:41:04,731 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 168 [2020-10-16 01:41:04,732 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 249 flow. Second operand 5 states. [2020-10-16 01:41:04,732 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:04,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 168 [2020-10-16 01:41:04,732 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:04,902 INFO L129 PetriNetUnfolder]: 143/318 cut-off events. [2020-10-16 01:41:04,903 INFO L130 PetriNetUnfolder]: For 1214/1271 co-relation queries the response was YES. [2020-10-16 01:41:04,905 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 318 events. 143/318 cut-off events. For 1214/1271 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1635 event pairs, 29 based on Foata normal form. 9/317 useless extension candidates. Maximal degree in co-relation 1288. Up to 188 conditions per place. [2020-10-16 01:41:04,908 INFO L132 encePairwiseOnDemand]: 160/168 looper letters, 14 selfloop transitions, 17 changer transitions 0/46 dead transitions. [2020-10-16 01:41:04,908 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 46 transitions, 373 flow [2020-10-16 01:41:04,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:41:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:41:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 772 transitions. [2020-10-16 01:41:04,912 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7658730158730159 [2020-10-16 01:41:04,912 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 772 transitions. [2020-10-16 01:41:04,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 772 transitions. [2020-10-16 01:41:04,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:04,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 772 transitions. [2020-10-16 01:41:04,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:41:04,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:41:04,918 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:41:04,918 INFO L185 Difference]: Start difference. First operand has 48 places, 38 transitions, 249 flow. Second operand 6 states and 772 transitions. [2020-10-16 01:41:04,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 46 transitions, 373 flow [2020-10-16 01:41:04,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 361 flow, removed 3 selfloop flow, removed 1 redundant places. [2020-10-16 01:41:04,923 INFO L241 Difference]: Finished difference. Result has 53 places, 42 transitions, 313 flow [2020-10-16 01:41:04,923 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=313, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2020-10-16 01:41:04,923 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2020-10-16 01:41:04,923 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 313 flow [2020-10-16 01:41:04,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:41:04,923 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:04,924 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:04,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:41:04,924 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:04,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:04,924 INFO L82 PathProgramCache]: Analyzing trace with hash -123542804, now seen corresponding path program 2 times [2020-10-16 01:41:04,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:04,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381487537] [2020-10-16 01:41:04,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:05,009 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 01:41:05,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381487537] [2020-10-16 01:41:05,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:05,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:41:05,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434311318] [2020-10-16 01:41:05,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:41:05,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:05,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:41:05,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:41:05,012 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 168 [2020-10-16 01:41:05,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 313 flow. Second operand 6 states. [2020-10-16 01:41:05,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:05,013 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 168 [2020-10-16 01:41:05,013 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:05,226 INFO L129 PetriNetUnfolder]: 149/342 cut-off events. [2020-10-16 01:41:05,226 INFO L130 PetriNetUnfolder]: For 1553/1624 co-relation queries the response was YES. [2020-10-16 01:41:05,228 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 342 events. 149/342 cut-off events. For 1553/1624 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1855 event pairs, 14 based on Foata normal form. 10/345 useless extension candidates. Maximal degree in co-relation 1625. Up to 200 conditions per place. [2020-10-16 01:41:05,231 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 22 selfloop transitions, 15 changer transitions 1/53 dead transitions. [2020-10-16 01:41:05,231 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 497 flow [2020-10-16 01:41:05,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:41:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:41:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2020-10-16 01:41:05,236 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7416666666666667 [2020-10-16 01:41:05,236 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 623 transitions. [2020-10-16 01:41:05,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 623 transitions. [2020-10-16 01:41:05,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:05,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 623 transitions. [2020-10-16 01:41:05,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:41:05,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:41:05,241 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:41:05,242 INFO L185 Difference]: Start difference. First operand has 53 places, 42 transitions, 313 flow. Second operand 5 states and 623 transitions. [2020-10-16 01:41:05,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 497 flow [2020-10-16 01:41:05,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 450 flow, removed 16 selfloop flow, removed 3 redundant places. [2020-10-16 01:41:05,249 INFO L241 Difference]: Finished difference. Result has 55 places, 47 transitions, 369 flow [2020-10-16 01:41:05,249 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2020-10-16 01:41:05,249 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2020-10-16 01:41:05,250 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 369 flow [2020-10-16 01:41:05,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:41:05,250 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:05,250 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:05,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:41:05,250 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:05,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:05,251 INFO L82 PathProgramCache]: Analyzing trace with hash 148023954, now seen corresponding path program 1 times [2020-10-16 01:41:05,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:05,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928041134] [2020-10-16 01:41:05,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:05,369 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 01:41:05,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928041134] [2020-10-16 01:41:05,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:05,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:41:05,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426754123] [2020-10-16 01:41:05,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:41:05,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:05,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:41:05,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:41:05,372 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 168 [2020-10-16 01:41:05,373 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 369 flow. Second operand 5 states. [2020-10-16 01:41:05,373 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:05,373 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 168 [2020-10-16 01:41:05,373 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:05,493 INFO L129 PetriNetUnfolder]: 145/337 cut-off events. [2020-10-16 01:41:05,493 INFO L130 PetriNetUnfolder]: For 2051/2138 co-relation queries the response was YES. [2020-10-16 01:41:05,495 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1722 conditions, 337 events. 145/337 cut-off events. For 2051/2138 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1841 event pairs, 33 based on Foata normal form. 6/332 useless extension candidates. Maximal degree in co-relation 1697. Up to 232 conditions per place. [2020-10-16 01:41:05,498 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 25 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2020-10-16 01:41:05,498 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 50 transitions, 467 flow [2020-10-16 01:41:05,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:41:05,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:41:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2020-10-16 01:41:05,501 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7872023809523809 [2020-10-16 01:41:05,501 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2020-10-16 01:41:05,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2020-10-16 01:41:05,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:05,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2020-10-16 01:41:05,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:41:05,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:41:05,504 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:41:05,504 INFO L185 Difference]: Start difference. First operand has 55 places, 47 transitions, 369 flow. Second operand 4 states and 529 transitions. [2020-10-16 01:41:05,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 50 transitions, 467 flow [2020-10-16 01:41:05,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 50 transitions, 446 flow, removed 7 selfloop flow, removed 2 redundant places. [2020-10-16 01:41:05,516 INFO L241 Difference]: Finished difference. Result has 57 places, 47 transitions, 379 flow [2020-10-16 01:41:05,517 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=379, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2020-10-16 01:41:05,517 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2020-10-16 01:41:05,517 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 379 flow [2020-10-16 01:41:05,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:41:05,517 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:05,517 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:05,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:41:05,518 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:05,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:05,518 INFO L82 PathProgramCache]: Analyzing trace with hash 83802556, now seen corresponding path program 3 times [2020-10-16 01:41:05,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:05,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669429443] [2020-10-16 01:41:05,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:05,618 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 01:41:05,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669429443] [2020-10-16 01:41:05,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:05,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:41:05,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221832182] [2020-10-16 01:41:05,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:41:05,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:05,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:41:05,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:41:05,621 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 168 [2020-10-16 01:41:05,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 379 flow. Second operand 5 states. [2020-10-16 01:41:05,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:05,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 168 [2020-10-16 01:41:05,621 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:05,781 INFO L129 PetriNetUnfolder]: 148/343 cut-off events. [2020-10-16 01:41:05,781 INFO L130 PetriNetUnfolder]: For 2032/2094 co-relation queries the response was YES. [2020-10-16 01:41:05,783 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1786 conditions, 343 events. 148/343 cut-off events. For 2032/2094 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1874 event pairs, 33 based on Foata normal form. 5/338 useless extension candidates. Maximal degree in co-relation 1760. Up to 231 conditions per place. [2020-10-16 01:41:05,786 INFO L132 encePairwiseOnDemand]: 160/168 looper letters, 24 selfloop transitions, 14 changer transitions 1/54 dead transitions. [2020-10-16 01:41:05,786 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 54 transitions, 522 flow [2020-10-16 01:41:05,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:41:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:41:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 631 transitions. [2020-10-16 01:41:05,789 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7511904761904762 [2020-10-16 01:41:05,789 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 631 transitions. [2020-10-16 01:41:05,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 631 transitions. [2020-10-16 01:41:05,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:05,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 631 transitions. [2020-10-16 01:41:05,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:41:05,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:41:05,793 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:41:05,793 INFO L185 Difference]: Start difference. First operand has 57 places, 47 transitions, 379 flow. Second operand 5 states and 631 transitions. [2020-10-16 01:41:05,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 54 transitions, 522 flow [2020-10-16 01:41:05,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 502 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:41:05,799 INFO L241 Difference]: Finished difference. Result has 59 places, 49 transitions, 422 flow [2020-10-16 01:41:05,799 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2020-10-16 01:41:05,799 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 27 predicate places. [2020-10-16 01:41:05,800 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 422 flow [2020-10-16 01:41:05,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:41:05,800 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:05,800 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:05,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:41:05,800 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:05,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:05,801 INFO L82 PathProgramCache]: Analyzing trace with hash 85348216, now seen corresponding path program 4 times [2020-10-16 01:41:05,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:05,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18502259] [2020-10-16 01:41:05,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:05,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 01:41:05,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18502259] [2020-10-16 01:41:05,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:05,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:41:05,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007889944] [2020-10-16 01:41:05,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:41:05,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:05,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:41:05,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:41:05,877 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 168 [2020-10-16 01:41:05,877 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 422 flow. Second operand 6 states. [2020-10-16 01:41:05,877 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:05,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 168 [2020-10-16 01:41:05,878 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:06,060 INFO L129 PetriNetUnfolder]: 153/347 cut-off events. [2020-10-16 01:41:06,061 INFO L130 PetriNetUnfolder]: For 2530/2592 co-relation queries the response was YES. [2020-10-16 01:41:06,062 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1946 conditions, 347 events. 153/347 cut-off events. For 2530/2592 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1878 event pairs, 22 based on Foata normal form. 22/360 useless extension candidates. Maximal degree in co-relation 1919. Up to 211 conditions per place. [2020-10-16 01:41:06,065 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 21 selfloop transitions, 25 changer transitions 2/63 dead transitions. [2020-10-16 01:41:06,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 63 transitions, 644 flow [2020-10-16 01:41:06,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:41:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:41:06,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2020-10-16 01:41:06,068 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7345238095238096 [2020-10-16 01:41:06,068 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2020-10-16 01:41:06,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2020-10-16 01:41:06,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:06,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2020-10-16 01:41:06,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:41:06,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:41:06,072 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:41:06,072 INFO L185 Difference]: Start difference. First operand has 59 places, 49 transitions, 422 flow. Second operand 5 states and 617 transitions. [2020-10-16 01:41:06,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 63 transitions, 644 flow [2020-10-16 01:41:06,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 63 transitions, 603 flow, removed 9 selfloop flow, removed 3 redundant places. [2020-10-16 01:41:06,079 INFO L241 Difference]: Finished difference. Result has 61 places, 57 transitions, 541 flow [2020-10-16 01:41:06,080 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=541, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2020-10-16 01:41:06,080 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2020-10-16 01:41:06,080 INFO L481 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 541 flow [2020-10-16 01:41:06,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:41:06,080 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:06,080 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:06,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 01:41:06,081 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:06,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:06,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1935018189, now seen corresponding path program 2 times [2020-10-16 01:41:06,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:06,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049658313] [2020-10-16 01:41:06,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:06,133 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 01:41:06,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049658313] [2020-10-16 01:41:06,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:06,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:41:06,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462917070] [2020-10-16 01:41:06,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:41:06,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:06,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:41:06,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:41:06,136 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 168 [2020-10-16 01:41:06,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 541 flow. Second operand 5 states. [2020-10-16 01:41:06,137 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:06,137 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 168 [2020-10-16 01:41:06,137 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:06,282 INFO L129 PetriNetUnfolder]: 267/603 cut-off events. [2020-10-16 01:41:06,282 INFO L130 PetriNetUnfolder]: For 4527/4625 co-relation queries the response was YES. [2020-10-16 01:41:06,286 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3174 conditions, 603 events. 267/603 cut-off events. For 4527/4625 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 3983 event pairs, 58 based on Foata normal form. 24/610 useless extension candidates. Maximal degree in co-relation 3146. Up to 353 conditions per place. [2020-10-16 01:41:06,290 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 14 selfloop transitions, 4 changer transitions 6/65 dead transitions. [2020-10-16 01:41:06,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 65 transitions, 632 flow [2020-10-16 01:41:06,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:41:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:41:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 788 transitions. [2020-10-16 01:41:06,293 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7817460317460317 [2020-10-16 01:41:06,293 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 788 transitions. [2020-10-16 01:41:06,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 788 transitions. [2020-10-16 01:41:06,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:06,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 788 transitions. [2020-10-16 01:41:06,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:41:06,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:41:06,298 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:41:06,298 INFO L185 Difference]: Start difference. First operand has 61 places, 57 transitions, 541 flow. Second operand 6 states and 788 transitions. [2020-10-16 01:41:06,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 65 transitions, 632 flow [2020-10-16 01:41:06,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 589 flow, removed 6 selfloop flow, removed 3 redundant places. [2020-10-16 01:41:06,307 INFO L241 Difference]: Finished difference. Result has 65 places, 57 transitions, 513 flow [2020-10-16 01:41:06,307 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=513, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2020-10-16 01:41:06,308 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 33 predicate places. [2020-10-16 01:41:06,308 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 513 flow [2020-10-16 01:41:06,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:41:06,308 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:06,308 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:06,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 01:41:06,308 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:06,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:06,309 INFO L82 PathProgramCache]: Analyzing trace with hash 943759117, now seen corresponding path program 1 times [2020-10-16 01:41:06,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:06,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137172926] [2020-10-16 01:41:06,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:06,383 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 01:41:06,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137172926] [2020-10-16 01:41:06,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:06,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:41:06,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305504613] [2020-10-16 01:41:06,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:41:06,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:06,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:41:06,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:41:06,387 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 168 [2020-10-16 01:41:06,387 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 513 flow. Second operand 4 states. [2020-10-16 01:41:06,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:06,387 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 168 [2020-10-16 01:41:06,387 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:06,558 INFO L129 PetriNetUnfolder]: 240/561 cut-off events. [2020-10-16 01:41:06,558 INFO L130 PetriNetUnfolder]: For 3155/3374 co-relation queries the response was YES. [2020-10-16 01:41:06,561 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2411 conditions, 561 events. 240/561 cut-off events. For 3155/3374 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 3629 event pairs, 83 based on Foata normal form. 141/677 useless extension candidates. Maximal degree in co-relation 2381. Up to 253 conditions per place. [2020-10-16 01:41:06,567 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 10 selfloop transitions, 8 changer transitions 2/64 dead transitions. [2020-10-16 01:41:06,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 545 flow [2020-10-16 01:41:06,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:41:06,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:41:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2020-10-16 01:41:06,571 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8071428571428572 [2020-10-16 01:41:06,571 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2020-10-16 01:41:06,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2020-10-16 01:41:06,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:06,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2020-10-16 01:41:06,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:41:06,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:41:06,575 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:41:06,576 INFO L185 Difference]: Start difference. First operand has 65 places, 57 transitions, 513 flow. Second operand 5 states and 678 transitions. [2020-10-16 01:41:06,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 545 flow [2020-10-16 01:41:06,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 535 flow, removed 1 selfloop flow, removed 4 redundant places. [2020-10-16 01:41:06,586 INFO L241 Difference]: Finished difference. Result has 66 places, 59 transitions, 531 flow [2020-10-16 01:41:06,586 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=531, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2020-10-16 01:41:06,586 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 34 predicate places. [2020-10-16 01:41:06,586 INFO L481 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 531 flow [2020-10-16 01:41:06,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:41:06,587 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:06,587 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:06,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 01:41:06,587 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:06,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:06,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1306193070, now seen corresponding path program 1 times [2020-10-16 01:41:06,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:06,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357597310] [2020-10-16 01:41:06,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:06,712 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 01:41:06,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357597310] [2020-10-16 01:41:06,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:06,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:41:06,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583768962] [2020-10-16 01:41:06,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:41:06,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:06,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:41:06,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:41:06,716 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 168 [2020-10-16 01:41:06,717 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 531 flow. Second operand 5 states. [2020-10-16 01:41:06,717 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:06,717 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 168 [2020-10-16 01:41:06,717 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:06,839 INFO L129 PetriNetUnfolder]: 116/359 cut-off events. [2020-10-16 01:41:06,840 INFO L130 PetriNetUnfolder]: For 2219/2842 co-relation queries the response was YES. [2020-10-16 01:41:06,842 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 359 events. 116/359 cut-off events. For 2219/2842 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2384 event pairs, 16 based on Foata normal form. 281/623 useless extension candidates. Maximal degree in co-relation 1673. Up to 185 conditions per place. [2020-10-16 01:41:06,845 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 6 selfloop transitions, 15 changer transitions 3/63 dead transitions. [2020-10-16 01:41:06,845 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 63 transitions, 582 flow [2020-10-16 01:41:06,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:41:06,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:41:06,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 949 transitions. [2020-10-16 01:41:06,849 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8069727891156463 [2020-10-16 01:41:06,849 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 949 transitions. [2020-10-16 01:41:06,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 949 transitions. [2020-10-16 01:41:06,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:06,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 949 transitions. [2020-10-16 01:41:06,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:41:06,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:41:06,857 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:41:06,857 INFO L185 Difference]: Start difference. First operand has 66 places, 59 transitions, 531 flow. Second operand 7 states and 949 transitions. [2020-10-16 01:41:06,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 63 transitions, 582 flow [2020-10-16 01:41:06,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 550 flow, removed 5 selfloop flow, removed 5 redundant places. [2020-10-16 01:41:06,866 INFO L241 Difference]: Finished difference. Result has 70 places, 60 transitions, 547 flow [2020-10-16 01:41:06,866 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=547, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2020-10-16 01:41:06,866 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2020-10-16 01:41:06,866 INFO L481 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 547 flow [2020-10-16 01:41:06,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:41:06,867 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:06,867 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 01:41:06,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 01:41:06,867 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:06,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:06,867 INFO L82 PathProgramCache]: Analyzing trace with hash 943332095, now seen corresponding path program 1 times [2020-10-16 01:41:06,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:06,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958820290] [2020-10-16 01:41:06,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:06,961 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 01:41:06,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958820290] [2020-10-16 01:41:06,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:06,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:41:06,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946982899] [2020-10-16 01:41:06,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:41:06,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:06,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:41:06,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:41:06,964 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 168 [2020-10-16 01:41:06,965 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 547 flow. Second operand 6 states. [2020-10-16 01:41:06,965 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:06,965 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 168 [2020-10-16 01:41:06,965 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:07,098 INFO L129 PetriNetUnfolder]: 86/296 cut-off events. [2020-10-16 01:41:07,098 INFO L130 PetriNetUnfolder]: For 2679/3686 co-relation queries the response was YES. [2020-10-16 01:41:07,100 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1557 conditions, 296 events. 86/296 cut-off events. For 2679/3686 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2008 event pairs, 5 based on Foata normal form. 264/544 useless extension candidates. Maximal degree in co-relation 1524. Up to 166 conditions per place. [2020-10-16 01:41:07,102 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 2 selfloop transitions, 19 changer transitions 16/62 dead transitions. [2020-10-16 01:41:07,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 62 transitions, 603 flow [2020-10-16 01:41:07,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:41:07,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:41:07,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1214 transitions. [2020-10-16 01:41:07,107 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8029100529100529 [2020-10-16 01:41:07,107 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1214 transitions. [2020-10-16 01:41:07,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1214 transitions. [2020-10-16 01:41:07,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:07,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1214 transitions. [2020-10-16 01:41:07,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:41:07,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:41:07,113 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:41:07,113 INFO L185 Difference]: Start difference. First operand has 70 places, 60 transitions, 547 flow. Second operand 9 states and 1214 transitions. [2020-10-16 01:41:07,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 62 transitions, 603 flow [2020-10-16 01:41:07,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 62 transitions, 488 flow, removed 31 selfloop flow, removed 7 redundant places. [2020-10-16 01:41:07,122 INFO L241 Difference]: Finished difference. Result has 74 places, 46 transitions, 377 flow [2020-10-16 01:41:07,122 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=377, PETRI_PLACES=74, PETRI_TRANSITIONS=46} [2020-10-16 01:41:07,123 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2020-10-16 01:41:07,123 INFO L481 AbstractCegarLoop]: Abstraction has has 74 places, 46 transitions, 377 flow [2020-10-16 01:41:07,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:41:07,123 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:07,123 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 01:41:07,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 01:41:07,123 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:07,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:07,124 INFO L82 PathProgramCache]: Analyzing trace with hash -182447360, now seen corresponding path program 1 times [2020-10-16 01:41:07,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:07,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077655071] [2020-10-16 01:41:07,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:07,299 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 01:41:07,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077655071] [2020-10-16 01:41:07,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:07,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:41:07,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356127982] [2020-10-16 01:41:07,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:41:07,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:07,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:41:07,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:41:07,302 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 168 [2020-10-16 01:41:07,302 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 46 transitions, 377 flow. Second operand 8 states. [2020-10-16 01:41:07,303 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:07,303 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 168 [2020-10-16 01:41:07,303 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:07,447 INFO L129 PetriNetUnfolder]: 44/158 cut-off events. [2020-10-16 01:41:07,447 INFO L130 PetriNetUnfolder]: For 913/1027 co-relation queries the response was YES. [2020-10-16 01:41:07,448 INFO L80 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 158 events. 44/158 cut-off events. For 913/1027 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 845 event pairs, 0 based on Foata normal form. 19/167 useless extension candidates. Maximal degree in co-relation 699. Up to 50 conditions per place. [2020-10-16 01:41:07,449 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 7 selfloop transitions, 10 changer transitions 5/49 dead transitions. [2020-10-16 01:41:07,449 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 49 transitions, 457 flow [2020-10-16 01:41:07,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:41:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:41:07,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 730 transitions. [2020-10-16 01:41:07,457 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7242063492063492 [2020-10-16 01:41:07,457 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 730 transitions. [2020-10-16 01:41:07,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 730 transitions. [2020-10-16 01:41:07,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:07,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 730 transitions. [2020-10-16 01:41:07,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:41:07,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:41:07,463 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:41:07,463 INFO L185 Difference]: Start difference. First operand has 74 places, 46 transitions, 377 flow. Second operand 6 states and 730 transitions. [2020-10-16 01:41:07,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 49 transitions, 457 flow [2020-10-16 01:41:07,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 49 transitions, 349 flow, removed 24 selfloop flow, removed 18 redundant places. [2020-10-16 01:41:07,468 INFO L241 Difference]: Finished difference. Result has 59 places, 42 transitions, 280 flow [2020-10-16 01:41:07,468 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=280, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2020-10-16 01:41:07,468 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 27 predicate places. [2020-10-16 01:41:07,469 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 280 flow [2020-10-16 01:41:07,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:41:07,469 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:07,469 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 01:41:07,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 01:41:07,470 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:07,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:07,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2091042698, now seen corresponding path program 2 times [2020-10-16 01:41:07,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:07,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914246115] [2020-10-16 01:41:07,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:41:07,513 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:41:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:41:07,565 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:41:07,598 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:41:07,598 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:41:07,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 01:41:07,600 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 01:41:07,610 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L2-->L818: Formula: (let ((.cse7 (= (mod ~y$r_buff0_thd0~0_In1489192857 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In1489192857 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In1489192857 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In1489192857 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out1489192857 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1489192857|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1489192857 0)) (or (and (= ~y$w_buff1_used~0_In1489192857 ~y$w_buff1_used~0_Out1489192857) .cse0) (and (= 0 ~y$w_buff1_used~0_Out1489192857) .cse1 .cse2)) (= ~y$r_buff0_thd0~0_In1489192857 ~y$r_buff0_thd0~0_Out1489192857) (or (and (or (and (= ~y~0_Out1489192857 ~y~0_In1489192857) .cse0) (and (= ~y~0_Out1489192857 ~y$w_buff1~0_In1489192857) .cse1 .cse2)) .cse3) (and (= ~y~0_Out1489192857 ~y$w_buff0~0_In1489192857) .cse4 .cse5)) (or (and .cse3 (= ~y$w_buff0_used~0_In1489192857 ~y$w_buff0_used~0_Out1489192857)) (and (= ~y$w_buff0_used~0_Out1489192857 0) .cse4 .cse5)) (= ~y$r_buff1_thd0~0_Out1489192857 ~y$r_buff1_thd0~0_In1489192857)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1489192857|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1489192857, ~y$w_buff1~0=~y$w_buff1~0_In1489192857, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1489192857, ~y$w_buff0~0=~y$w_buff0~0_In1489192857, ~y~0=~y~0_In1489192857, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1489192857, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1489192857} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1489192857|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out1489192857, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1489192857|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1489192857|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1489192857|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1489192857|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1489192857|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1489192857|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1489192857, ~y$w_buff1~0=~y$w_buff1~0_In1489192857, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1489192857, ~y$w_buff0~0=~y$w_buff0~0_In1489192857, ~y~0=~y~0_Out1489192857, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1489192857, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1489192857} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 01:41:07,614 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:07,614 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,617 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:07,617 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,617 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:07,617 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,617 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:07,618 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,618 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:07,618 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,618 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:07,618 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,619 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 01:41:07,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,619 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 01:41:07,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,619 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 01:41:07,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,620 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 01:41:07,620 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,620 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 01:41:07,620 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,620 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 01:41:07,621 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,621 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 01:41:07,621 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,621 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 01:41:07,621 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,621 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 01:41:07,622 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,622 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 01:41:07,622 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,622 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 01:41:07,622 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,623 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 01:41:07,623 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,624 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 01:41:07,624 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,624 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 01:41:07,624 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,624 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 01:41:07,624 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,625 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 01:41:07,625 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,625 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 01:41:07,625 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,625 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 01:41:07,625 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,626 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 01:41:07,626 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,626 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 01:41:07,626 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,626 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 01:41:07,626 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,626 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 01:41:07,627 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,627 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 01:41:07,627 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,627 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 01:41:07,627 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,627 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 01:41:07,628 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,628 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 01:41:07,628 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:07,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:41:07 BasicIcfg [2020-10-16 01:41:07,713 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:41:07,718 INFO L168 Benchmark]: Toolchain (without parser) took 18313.29 ms. Allocated memory was 249.0 MB in the beginning and 673.7 MB in the end (delta: 424.7 MB). Free memory was 202.0 MB in the beginning and 393.6 MB in the end (delta: -191.6 MB). Peak memory consumption was 233.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:41:07,719 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:41:07,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 860.86 ms. Allocated memory was 249.0 MB in the beginning and 305.7 MB in the end (delta: 56.6 MB). Free memory was 202.0 MB in the beginning and 254.0 MB in the end (delta: -51.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. [2020-10-16 01:41:07,720 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.87 ms. Allocated memory is still 305.7 MB. Free memory was 254.0 MB in the beginning and 251.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:41:07,722 INFO L168 Benchmark]: Boogie Preprocessor took 40.53 ms. Allocated memory is still 305.7 MB. Free memory was 251.5 MB in the beginning and 248.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:41:07,723 INFO L168 Benchmark]: RCFGBuilder took 2271.18 ms. Allocated memory was 305.7 MB in the beginning and 357.6 MB in the end (delta: 51.9 MB). Free memory was 248.9 MB in the beginning and 188.6 MB in the end (delta: 60.3 MB). Peak memory consumption was 112.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:41:07,724 INFO L168 Benchmark]: TraceAbstraction took 15052.13 ms. Allocated memory was 357.6 MB in the beginning and 673.7 MB in the end (delta: 316.1 MB). Free memory was 188.6 MB in the beginning and 393.6 MB in the end (delta: -205.0 MB). Peak memory consumption was 111.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:41:07,730 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.42 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 860.86 ms. Allocated memory was 249.0 MB in the beginning and 305.7 MB in the end (delta: 56.6 MB). Free memory was 202.0 MB in the beginning and 254.0 MB in the end (delta: -51.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 79.87 ms. Allocated memory is still 305.7 MB. Free memory was 254.0 MB in the beginning and 251.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 40.53 ms. Allocated memory is still 305.7 MB. Free memory was 251.5 MB in the beginning and 248.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2271.18 ms. Allocated memory was 305.7 MB in the beginning and 357.6 MB in the end (delta: 51.9 MB). Free memory was 248.9 MB in the beginning and 188.6 MB in the end (delta: 60.3 MB). Peak memory consumption was 112.2 MB. Max. memory is 14.2 GB. * TraceAbstraction took 15052.13 ms. Allocated memory was 357.6 MB in the beginning and 673.7 MB in the end (delta: 316.1 MB). Free memory was 188.6 MB in the beginning and 393.6 MB in the end (delta: -205.0 MB). Peak memory consumption was 111.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 896 VarBasedMoverChecksPositive, 52 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 46 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 73 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.3s, 95 PlacesBefore, 32 PlacesAfterwards, 87 TransitionsBefore, 22 TransitionsAfterwards, 1560 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 3946 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L723] 0 _Bool weak$$choice0; [L724] 0 _Bool weak$$choice2; [L802] 0 pthread_t t2177; [L803] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L728] 1 y$w_buff1 = y$w_buff0 [L729] 1 y$w_buff0 = 2 [L730] 1 y$w_buff1_used = y$w_buff0_used [L731] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L733] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L734] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L735] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L736] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L737] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 pthread_t t2178; [L805] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 pthread_t t2179; [L807] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 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) [L760] 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) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 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 [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 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 [L777] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 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) [L780] 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) [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L781] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L782] 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 [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 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] 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) [L743] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L743] 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) [L743] 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) [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L745] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L745] 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 [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L746] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L747] 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 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L752] 1 return 0; [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L787] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 3 return 0; [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 y$flush_delayed = weak$$choice2 [L823] 0 y$mem_tmp = y [L824] 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) [L824] 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) [L825] 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)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] 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)) [L825] 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)) [L826] 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)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] 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)) [L826] 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)) [L827] 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)) [L827] 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)) [L828] 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)) [L828] 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)) [L829] 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)) [L829] 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) [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] 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) [L829] 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)) [L829] 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)) [L830] 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)) [L830] EXPR 0 !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) [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] 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)) [L830] 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)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L832] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L832] 0 y = y$flush_delayed ? y$mem_tmp : y [L833] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 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: 14.8s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 91 SDtfs, 42 SDslu, 24 SDs, 0 SdLazy, 500 SolverSat, 137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=547occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 243 ConstructedInterpolants, 0 QuantifiedInterpolants, 24344 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...